BASIC (1–10) — EASY JAVA CODE

1. Sum of Digits

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0;

while(n>0){ sum+=n%10; n/=10; }

[Link](sum);

}}

2. Reverse Number

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),rev=0;

while(n>0){ rev=rev*10+n%10; n/=10; }

[Link](rev);

}}

3. Palindrome Number

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),rev=0,temp=n;

while(n>0){ rev=rev*10+n%10; n/=10; }

[Link](temp==rev?"Palindrome":"Not Palindrome");

}}
4. Fibonacci Series

class Main{

public static void main(String[] args){

int a=0,b=1,n=10;

for(int i=1;i<=n;i++){

[Link](a+" ");

int c=a+b; a=b; b=c;

}}

5. Factorial (Loop)

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),fact=1;

for(int i=1;i<=n;i++) fact*=i;

[Link](fact);

}}

6. Factorial (Recursion)

class Main{

static int fact(int n){

if(n==0) return 1;

return n*fact(n-1);

public static void main(String[] args){

[Link](fact(5));

}}

7. Prime Number
import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),count=0;

for(int i=1;i<=n;i++)

if(n%i==0) count++;

[Link](count==2?"Prime":"Not Prime");

}}

8. Armstrong Number

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0,temp=n;

while(n>0){

int d=n%10;

sum+=d*d*d;

n/=10;

[Link](sum==temp?"Armstrong":"Not Armstrong");

}}

9. Perfect Number

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0;

for(int i=1;i<n;i++)
if(n%i==0) sum+=i;

[Link](sum==n?"Perfect":"Not Perfect");

}}

10. Strong Number

import [Link].*;

class Main{

static int fact(int n){

int f=1;

for(int i=1;i<=n;i++) f*=i;

return f;

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0,temp=n;

while(n>0){

int d=n%10;

sum+=fact(d);

n/=10;

[Link](sum==temp?"Strong":"Not Strong");

}}

BASIC (11–40)

11. GCD / HCF

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int a=[Link](),b=[Link]();

while(b!=0){

int t=b;
b=a%b;

a=t;

[Link](a);

}}

12. LCM

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int a=[Link](),b=[Link](),lcm=[Link](a,b);

while(true){

if(lcm%a==0 && lcm%b==0) break;

lcm++;

[Link](lcm);

}}

13. Swap without temp

class Main{

public static void main(String[] args){

int a=5,b=10;

a=a+b;

b=a-b;

a=a-b;

[Link](a+" "+b);

}}

14. Power of number

import [Link].*;
class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int base=[Link](),exp=[Link](),res=1;

for(int i=1;i<=exp;i++) res*=base;

[Link](res);

}}

15. Count digits

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),count=0;

while(n>0){ count++; n/=10; }

[Link](count);

}}

16. Even / Odd

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link]();

[Link](n%2==0?"Even":"Odd");

}}

17. Sum of natural numbers

import [Link].*;

class Main{

public static void main(String[] args){

int n=[Link]();

[Link](n*(n+1)/2);

}}

18. Multiplication table

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link]();

for(int i=1;i<=10;i++)

[Link](n+" x "+i+" = "+(n*i));

}}

19. Sum of squares

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0;

for(int i=1;i<=n;i++) sum+=i*i;

[Link](sum);

}}

20. Decimal → Binary

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link]();
[Link]([Link](n));

}}

21. Binary → Decimal

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

String b=[Link]();

[Link]([Link](b,2));

}}

22. Check leap year

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int y=[Link]();

[Link]((y%400==0 || (y%4==0 && y%100!=0))?"Leap":"Not Leap");

}}

23. Largest of 3 numbers

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int a=[Link](),b=[Link](),c=[Link]();

[Link]([Link](a,[Link](b,c)));

}}

24. Smallest of 3 numbers

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int a=[Link](),b=[Link](),c=[Link]();

[Link]([Link](a,[Link](b,c)));

}}

25. Average of numbers

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int a=[Link](),b=[Link](),c=[Link]();

[Link]((a+b+c)/3.0);

}}

26. Positive / Negative

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link]();

if(n>0) [Link]("Positive");

else if(n<0) [Link]("Negative");

else [Link]("Zero");

}}

27. Reverse using recursion

class Main{

static void rev(int n){

[Link](n%10);

rev(n/10);

public static void main(String[] args){

rev(1234);

}}

28. Print N natural numbers

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link]();

for(int i=1;i<=n;i++) [Link](i+" ");

}}

29. Sum of first N primes

class Main{

static boolean prime(int n){

if(n<2) return false;

for(int i=2;i*i<=n;i++)

if(n%i==0) return false;

return true;

public static void main(String[] args){

int n=5,count=0,sum=0,i=2;

while(count<n){

if(prime(i)){ sum+=i; count++; }

i++;

}
[Link](sum);

}}

30. Perfect square

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link]();

int r=(int)[Link](n);

[Link](r*r==n?"Perfect Square":"Not");

}}

31. Sum of factorial series (1!+2!+...+n!)

import [Link].*;

class Main{

static int fact(int n){

int f=1;

for(int i=1;i<=n;i++) f*=i;

return f;

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0;

for(int i=1;i<=n;i++) sum+=fact(i);

[Link](sum);

}}

32. Automorphic number

import [Link].*;

class Main{
public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link]();

int sq=n*n;

[Link]([Link](sq).endsWith([Link](n))?"Automorphic":"Not");

}}

33. Neon number

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sq=n*n,sum=0;

while(sq>0){ sum+=sq%10; sq/=10; }

[Link](sum==n?"Neon":"Not");

}}

34. Harshad number

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0,temp=n;

while(n>0){ sum+=n%10; n/=10; }

[Link](temp%sum==0?"Harshad":"Not");

}}

35. Abundant number

import [Link].*;

class Main{

public static void main(String[] args){

int n=[Link](),sum=0;

for(int i=1;i<n;i++)

if(n%i==0) sum+=i;

[Link](sum>n?"Abundant":"Not");

}}

36. Spy number

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),sum=0,prod=1;

while(n>0){

int d=n%10;

sum+=d;

prod*=d;

n/=10;

[Link](sum==prod?"Spy":"Not");

}}

37. Magic number

import [Link].*;

class Main{

static int sumDigits(int n){

int s=0;

while(n>0){ s+=n%10; n/=10; }

return s;

public static void main(String[] args){

int n=[Link]();

while(n>9) n=sumDigits(n);

[Link](n==1?"Magic":"Not");

}}

38. Count trailing zeros in factorial

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int n=[Link](),count=0;

for(int i=5;n/i>=1;i*=5) count+=n/i;

[Link](count);

}}

39. Convert seconds → hr:min:sec

import [Link].*;

class Main{

public static void main(String[] args){

Scanner sc=new Scanner([Link]);

int s=[Link]();

int h=s/3600;

int m=(s%3600)/60;

int sec=s%60;

[Link](h+":"+m+":"+sec);

}}

40. Temperature conversion (C → F)

import [Link].*;

class Main{
public static void main(String[] args){

Scanner sc=new Scanner([Link]);

double c=[Link]();

double f=(c*9/5)+32;

[Link](f);

}}

STRING (41–80)

41. Reverse String

class Main{

public static void main(String[] args){

String s="hello";

[Link](new StringBuilder(s).reverse());

}}

42. Palindrome String

class Main{

public static void main(String[] args){

String s="madam";

String r=new StringBuilder(s).reverse().toString();

[Link]([Link](r)?"Palindrome":"Not");

}}

43. Count Vowels & Consonants

class Main{

public static void main(String[] args){

String s="hello";

int v=0,c=0;

for(char ch:[Link]()){

if("aeiouAEIOU".indexOf(ch)>=0) v++;

else if([Link](ch)) c++;

[Link]("Vowels="+v+" Consonants="+c);

}}

44. Remove Spaces

class Main{

public static void main(String[] args){

String s="hello world";

[Link]([Link](" ",""));

}}

45. Remove Duplicates

import [Link].*;

class Main{

public static void main(String[] args){

String s="programming";

Set<Character> set=new LinkedHashSet<>();

for(char ch:[Link]()) [Link](ch);

for(char ch:set) [Link](ch);

}}

46. Count Words

class Main{

public static void main(String[] args){

String s="Java is easy";

String[] w=[Link]().split("\\s+");

[Link]([Link]);

}}

47. Character Frequency

import [Link].*;
class Main{

public static void main(String[] args){

String s="hello";

Map<Character,Integer> m=new HashMap<>();

for(char ch:[Link]())

[Link](ch,[Link](ch,0)+1);

[Link](m);

}}

48. First Non-Repeating Character

class Main{

public static void main(String[] args){

String s="aabbcde";

for(char c:[Link]())

if([Link](c)==[Link](c)){

[Link](c); break;

}}

49. First Repeating Character

import [Link].*;

class Main{

public static void main(String[] args){

String s="abca";

Set<Character> set=new HashSet<>();

for(char c:[Link]()){

if([Link](c)){ [Link](c); break; }

[Link](c);

}}
50. Anagram Check

import [Link].*;

class Main{

public static void main(String[] args){

String a="listen",b="silent";

char[] x=[Link](),y=[Link]();

[Link](x); [Link](y);

[Link]([Link](x,y));

}}

51. String Rotation

class Main{

public static void main(String[] args){

String a="abcd",b="cdab";

[Link]((a+a).contains(b));

}}

52. Longest Word

class Main{

public static void main(String[] args){

String s="Java is very easy";

String max="";

for(String w:[Link](" "))

if([Link]()>[Link]()) max=w;

[Link](max);

}}

53. Replace Character

class Main{

public static void main(String[] args){

String s="banana";
[Link]([Link]('a','o'));

}}

54. Toggle Case

class Main{

public static void main(String[] args){

String s="JaVa";

String r="";

for(char c:[Link]())

r+=[Link](c)?[Link](c):[Link](c);

[Link](r);

}}

55. Count Digits in String

class Main{

public static void main(String[] args){

String s="a1b2c3";

int count=0;

for(char c:[Link]())

if([Link](c)) count++;

[Link](count);

}}

56. Check Substring

class Main{

public static void main(String[] args){

String s="hello world";

[Link]([Link]("world"));

}}

57. Longest Palindrome Substring (simple check)

public static void main(String[] args){

String s="babad",res="";

for(int i=0;i<[Link]();i++)

for(int j=i+1;j<=[Link]();j++){

String sub=[Link](i,j);

String r=new StringBuilder(sub).reverse().toString();

if([Link](r) && [Link]()>[Link]()) res=sub;

[Link](res);

}}

58. Remove Special Characters

class Main{

public static void main(String[] args){

String s="a!b@c#1";

[Link]([Link]("[^a-zA-Z0-9]",""));

}}

59. String → Int

class Main{

public static void main(String[] args){

String s="123";

int n=[Link](s);

[Link](n+10);

}}

60. Int → String

class Main{

public static void main(String[] args){

int n=123;
String s=[Link](n);

[Link](s+"45");

}}

61. Sort Characters

import [Link].*;

class Main{

public static void main(String[] args){

char[] a="dcba".toCharArray();

[Link](a);

[Link](new String(a));

}}

62. Reverse Words

class Main{

public static void main(String[] args){

String s="Java is easy";

String[] w=[Link](" ");

for(int i=[Link]-1;i>=0;i--)

[Link](w[i]+" ");

}}

63. Remove Vowels

class Main{

public static void main(String[] args){

String s="hello";

[Link]([Link]("[aeiouAEIOU]",""));

}}

64. Print Duplicate Characters

class Main{
public static void main(String[] args){

String s="programming";

for(char c:[Link]())

if([Link](c)!=[Link](c))

[Link](c+" ");

}}

65. Most Frequent Character

import [Link].*;

class Main{

public static void main(String[] args){

String s="banana";

Map<Character,Integer> m=new HashMap<>();

for(char c:[Link]())

[Link](c,[Link](c,0)+1);

char maxc=' '; int max=0;

for(char c:[Link]())

if([Link](c)>max){ max=[Link](c); maxc=c; }

[Link](maxc);

}}

66. Count Uppercase & Lowercase

class Main{

public static void main(String[] args){

String s="JaVa";

int u=0,l=0;

for(char c:[Link]()){

if([Link](c)) u++;

if([Link](c)) l++;

[Link]("Upper="+u+" Lower="+l);
}}

67. Remove Consecutive Duplicates

class Main{

public static void main(String[] args){

String s="aaabbc";

String r=""+[Link](0);

for(int i=1;i<[Link]();i++)

if([Link](i)!=[Link](i-1)) r+=[Link](i);

[Link](r);

}}

68. Check Pangram

class Main{

public static void main(String[] args){

String s="the quick brown fox jumps over the lazy dog";

boolean ok=true;

for(char c='a';c<='z';c++)

if(![Link](""+c)) ok=false;

[Link](ok);

}}

69. Isomorphic Strings

import [Link].*;

class Main{

public static void main(String[] args){

String s="egg",t="add";

Map<Character,Character> m=new HashMap<>();

for(int i=0;i<[Link]();i++){

if([Link]([Link](i))){

if([Link]([Link](i))!=[Link](i)){ [Link](false); return;}

[Link](true);

}}

70. Valid Parentheses

import [Link].*;

class Main{

public static void main(String[] args){

String s="()[]{}";

Stack<Character> st=new Stack<>();

for(char c:[Link]()){

if(c=='('||c=='['||c=='{') [Link](c);

else{

if([Link]()){ [Link](false); return;}

char t=[Link]();

if((c==')'&&t!='(')||(c==']'&&t!='[')||(c=='}'&&t!='{')){

[Link](false); return;}

[Link]([Link]());

}}

ARRAY (81–130)

81. Largest element

class Main{

public static void main(String[] args){

int[] a={1,5,3,9};

int max=a[0];

for(int x:a) if(x>max) max=x;

[Link](max);

}}
82. Smallest element

class Main{

public static void main(String[] args){

int[] a={1,5,3,9};

int min=a[0];

for(int x:a) if(x<min) min=x;

[Link](min);

}}

83. Second largest

class Main{

public static void main(String[] args){

int[] a={1,5,3,9};

int max=0,sec=0;

for(int x:a){

if(x>max){ sec=max; max=x; }

else if(x>sec && x!=max) sec=x;

[Link](sec);

}}

84. Reverse array

class Main{

public static void main(String[] args){

int[] a={1,2,3,4};

for(int i=[Link]-1;i>=0;i--)

[Link](a[i]+" ");

}}

85. Sum of array

public static void main(String[] args){

int[] a={1,2,3,4};

int sum=0;

for(int x:a) sum+=x;

[Link](sum);

}}

86. Average of array

class Main{

public static void main(String[] args){

int[] a={1,2,3,4};

int sum=0;

for(int x:a) sum+=x;

[Link](sum/(double)[Link]);

}}

87. Sort array

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={5,1,4,2};

[Link](a);

[Link]([Link](a));

}}

88. Linear search

class Main{

public static void main(String[] args){

int[] a={1,3,5,7};

int key=5;
for(int i=0;i<[Link];i++)

if(a[i]==key){ [Link]("Found"); return; }

[Link]("Not Found");

}}

89. Binary search (array must be sorted)

class Main{

public static void main(String[] args){

int[] a={1,2,3,4,5};

int key=3,l=0,h=[Link]-1;

while(l<=h){

int m=(l+h)/2;

if(a[m]==key){ [Link]("Found"); return; }

else if(a[m]<key) l=m+1;

else h=m-1;

[Link]("Not Found");

}}

90. Count frequency

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={1,2,2,3,3,3};

Map<Integer,Integer> m=new HashMap<>();

for(int x:a) [Link](x,[Link](x,0)+1);

[Link](m);

}}

91. Remove duplicates

import [Link].*;
class Main{

public static void main(String[] args){

int[] a={1,2,2,3};

Set<Integer> s=new LinkedHashSet<>();

for(int x:a) [Link](x);

[Link](s);

}}

92. Rotate left

class Main{

public static void main(String[] args){

int[] a={1,2,3,4};

int first=a[0];

for(int i=0;i<[Link]-1;i++) a[i]=a[i+1];

a[[Link]-1]=first;

for(int x:a) [Link](x+" ");

}}

93. Rotate right

class Main{

public static void main(String[] args){

int[] a={1,2,3,4};

int last=a[[Link]-1];

for(int i=[Link]-1;i>0;i--) a[i]=a[i-1];

a[0]=last;

for(int x:a) [Link](x+" ");

}}

94. Move zeros to end

class Main{

public static void main(String[] args){

int j=0;

for(int i=0;i<[Link];i++)

if(a[i]!=0){ int t=a[i]; a[i]=a[j]; a[j]=t; j++; }

for(int x:a) [Link](x+" ");

}}

95. Merge two arrays

class Main{

public static void main(String[] args){

int[] a={1,2},b={3,4};

int[] c=new int[[Link]+[Link]];

int i=0;

for(int x:a) c[i++]=x;

for(int x:b) c[i++]=x;

for(int x:c) [Link](x+" ");

}}

96. Missing number (1..n)

class Main{

public static void main(String[] args){

int[] a={1,2,4,5};

int n=5,sum=n*(n+1)/2,arr=0;

for(int x:a) arr+=x;

[Link](sum-arr);

}}

97. Find duplicate

import [Link].*;

class Main{

public static void main(String[] args){

Set<Integer> s=new HashSet<>();

for(int x:a){

if(){ [Link](x); break; }

}}

98. Intersection of arrays

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={1,2,3},b={2,3,4};

Set<Integer> s=new HashSet<>();

for(int x:a) [Link](x);

for(int x:b) if([Link](x)) [Link](x+" ");

}}

99. Union of arrays

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={1,2},b={2,3};

Set<Integer> s=new LinkedHashSet<>();

for(int x:a) [Link](x);

for(int x:b) [Link](x);

[Link](s);

}}

100. Pair with given sum

import [Link].*;

class Main{
public static void main(String[] args){

int[] a={1,2,3,4};

int sum=5;

Set<Integer> s=new HashSet<>();

for(int x:a){

if([Link](sum-x)){

[Link]((sum-x)+" "+x);

return;

[Link](x);

}}

ARRAY (101–130)

101. Subarray with given sum (simple)

class Main{

public static void main(String[] args){

int[] a={1,2,3,7,5};

int target=12;

for(int i=0;i<[Link];i++){

int sum=0;

for(int j=i;j<[Link];j++){

sum+=a[j];

if(sum==target){

[Link]("Found from "+i+" to "+j);

return;

[Link]("Not Found");

}}
102. Maximum subarray sum (Kadane)

class Main{

public static void main(String[] args){

int[] a={-2,1,-3,4,-1,2,1,-5,4};

int max=a[0],cur=0;

for(int x:a){

cur=[Link](x,cur+x);

max=[Link](max,cur);

[Link](max);

}}

103. Leaders in array

class Main{

public static void main(String[] args){

int[] a={16,17,4,3,5,2};

int max=a[[Link]-1];

[Link](max+" ");

for(int i=[Link]-2;i>=0;i--){

if(a[i]>max){

max=a[i];

[Link](max+" ");

}}

104. Stock buy sell (max profit)

class Main{

public static void main(String[] args){

int[] price={7,1,5,3,6,4};

int min=price[0],profit=0;
for(int p:price){

if(p<min) min=p;

profit=[Link](profit,p-min);

[Link](profit);

}}

105. Peak element

class Main{

public static void main(String[] args){

int[] a={1,3,20,4,1,0};

for(int i=0;i<[Link];i++){

if((i==0||a[i]>a[i-1]) && (i==[Link]-1||a[i]>a[i+1])){

[Link](a[i]);

break;

}}

106. Majority element (>n/2)

class Main{

public static void main(String[] args){

int[] a={2,2,1,2,3,2,2};

int count=0,cand=0;

for(int x:a){

if(count==0){ cand=x; }

count+=(x==cand)?1:-1;

[Link](cand);

}}
107. Equilibrium index

class Main{

public static void main(String[] args){

int[] a={1,3,5,2,2};

int total=0,left=0;

for(int x:a) total+=x;

for(int i=0;i<[Link];i++){

total-=a[i];

if(left==total){ [Link](i); break; }

left+=a[i];

}}

108. Rearrange positive & negative

class Main{

public static void main(String[] args){

int[] a={-1,2,-3,4,5,-6};

for(int x:a) if(x<0) [Link](x+" ");

for(int x:a) if(x>=0) [Link](x+" ");

}}

109. Sort 0,1,2 (Dutch flag)

class Main{

public static void main(String[] args){

int[] a={0,2,1,2,0,1};

int l=0,m=0,h=[Link]-1;

while(m<=h){

if(a[m]==0){ int t=a[l];a[l]=a[m];a[m]=t; l++;m++; }

else if(a[m]==1) m++;

else{ int t=a[m];a[m]=a[h];a[h]=t; h--; }

}
for(int x:a) [Link](x+" ");

}}

110. Spiral matrix print

class Main{

public static void main(String[] args){

int[][] m={{1,2,3},{4,5,6},{7,8,9}};

int top=0,bot=2,l=0,r=2;

while(top<=bot && l<=r){

for(int i=l;i<=r;i++) [Link](m[top][i]+" ");

top++;

for(int i=top;i<=bot;i++) [Link](m[i][r]+" ");

r--;

for(int i=r;i>=l;i--) [Link](m[bot][i]+" ");

bot--;

for(int i=bot;i>=top;i--) [Link](m[i][l]+" ");

l++;

}}

111. Matrix transpose

class Main{

public static void main(String[] args){

int[][] a={{1,2,3},{4,5,6}};

for(int i=0;i<3;i++){

for(int j=0;j<2;j++)

[Link](a[j][i]+" ");

[Link]();

}}
112. Matrix multiplication

class Main{

public static void main(String[] args){

int[][] a={{1,2},{3,4}},b={{5,6},{7,8}},c=new int[2][2];

for(int i=0;i<2;i++)

for(int j=0;j<2;j++)

for(int k=0;k<2;k++)

c[i][j]+=a[i][k]*b[k][j];

for(int[] r:c){

for(int x:r) [Link](x+" ");

[Link]();

}}

113. Diagonal sum

class Main{

public static void main(String[] args){

int[][] a={{1,2,3},{4,5,6},{7,8,9}};

int sum=0;

for(int i=0;i<3;i++) sum+=a[i][i];

[Link](sum);

}}

114. Rotate matrix 90°

class Main{

public static void main(String[] args){

int[][] a={{1,2,3},{4,5,6},{7,8,9}};

for(int i=0;i<3;i++)

for(int j=i;j<3;j++){

int t=a[i][j]; a[i][j]=a[j][i]; a[j][i]=t;

}
for(int i=0;i<3;i++){

for(int j=2;j>=0;j--)

[Link](a[i][j]+" ");

[Link]();

}}

115. Kth largest

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={3,2,1,5,6,4};

[Link](a);

int k=2;

[Link](a[[Link]-k]);

}}

116. Kth smallest

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={3,2,1,5,6,4};

[Link](a);

int k=2;

[Link](a[k-1]);

}}

117. Longest consecutive sequence

import [Link].*;

class Main{

public static void main(String[] args){

Set<Integer> s=new HashSet<>();

for(int x:a) [Link](x);

int max=0;

for(int x:s){

if(){

int y=x,len=1;

while([Link](y+1)){ y++; len++; }

max=[Link](max,len);

[Link](max);

}}

118. Count inversions (simple)

class Main{

public static void main(String[] args){

int[] a={2,4,1,3,5};

int c=0;

for(int i=0;i<[Link];i++)

for(int j=i+1;j<[Link];j++)

if(a[i]>a[j]) c++;

[Link](c);

}}

119. Minimum swaps to sort

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={4,3,2,1};

int[] b=[Link]();
[Link](b);

int swaps=0;

for(int i=0;i<[Link];i++)

if(a[i]!=b[i]) swaps++;

[Link](swaps/2);

}}

120. Missing positive integer

class Main{

public static void main(String[] args){

int[] a={1,2,0};

int i=1;

while(true){

boolean ok=false;

for(int x:a) if(x==i) ok=true;

if(!ok){ [Link](i); break; }

i++;

}}

121. Subarray with zero sum

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={4,2,-3,1,6};

Set<Integer> s=new HashSet<>();

int sum=0;

for(int x:a){

sum+=x;

if(sum==0 || [Link](sum)){

[Link]("Yes"); return;
}

[Link](sum);

[Link]("No");

}}

122. Count pairs with difference k

import [Link].*;

class Main{

public static void main(String[] args){

int[] a={1,5,3,4,2};

int k=2,count=0;

Set<Integer> s=new HashSet<>();

for(int x:a) [Link](x);

for(int x:a) if([Link](x+k)) count++;

[Link](count);

}}

123. Maximum product subarray

class Main{

public static void main(String[] args){

int[] a={2,3,-2,4};

int max=a[0],min=a[0],res=a[0];

for(int i=1;i<[Link];i++){

if(a[i]<0){ int t=max; max=min; min=t; }

max=[Link](a[i],max*a[i]);

min=[Link](a[i],min*a[i]);

res=[Link](res,max);

[Link](res);

}}
124. Sliding window max (simple)

class Main{

public static void main(String[] args){

int[] a={1,3,-1,-3,5,3,6,7};

int k=3;

for(int i=0;i<=[Link]-k;i++){

int max=a[i];

for(int j=i;j<i+k;j++)

max=[Link](max,a[j]);

[Link](max+" ");

}}

PATTERN (131–150)

131. Star Triangle

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=i;j++)

[Link]("*");

[Link]();

}}

132. Reverse Triangle

class Main{

public static void main(String[] args){

int n=5;

for(int i=n;i>=1;i--){

for(int j=1;j<=i;j++)
[Link]("*");

[Link]();

}}

133. Pyramid

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++) [Link]("*");

[Link]();

}}

134. Inverted Pyramid

class Main{

public static void main(String[] args){

int n=5;

for(int i=n;i>=1;i--){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++) [Link]("*");

[Link]();

}}

135. Diamond Pattern

class Main{

public static void main(String[] args){

int n=5;
for(int i=1;i<=n;i++){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++) [Link]("*");

[Link]();

for(int i=n-1;i>=1;i--){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++) [Link]("*");

[Link]();

}}

136. Hollow Square

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n;j++){

if(i==1||i==n||j==1||j==n) [Link]("*");

else [Link](" ");

[Link]();

}}

137. Hollow Pyramid

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n-i;j++) [Link](" ");

if(j==1||j==2*i-1||i==n) [Link]("*");

else [Link](" ");

[Link]();

}}

138. Floyd Triangle

class Main{

public static void main(String[] args){

int n=5,num=1;

for(int i=1;i<=n;i++){

for(int j=1;j<=i;j++)

[Link](num+++" ");

[Link]();

}}

139. Pascal Triangle

class Main{

public static void main(String[] args){

int n=5;

for(int i=0;i<n;i++){

int num=1;

for(int j=0;j<=i;j++){

[Link](num+" ");

num=num*(i-j)/(j+1);

[Link]();

}
}}

140. Number Triangle

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=i;j++)

[Link](j+" ");

[Link]();

}}

141. Palindrome Pyramid

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=i;j>=1;j--) [Link](j);

for(int j=2;j<=i;j++) [Link](j);

[Link]();

}}

142. Binary Triangle

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=i;j++)
[Link]((i+j)%2+" ");

[Link]();

}}

143. Butterfly Pattern

class Main{

public static void main(String[] args){

int n=4;

for(int i=1;i<=n;i++){

for(int j=1;j<=i;j++) [Link]("*");

for(int j=1;j<=2*(n-i);j++) [Link](" ");

for(int j=1;j<=i;j++) [Link]("*");

[Link]();

for(int i=n;i>=1;i--){

for(int j=1;j<=i;j++) [Link]("*");

for(int j=1;j<=2*(n-i);j++) [Link](" ");

for(int j=1;j<=i;j++) [Link]("*");

[Link]();

}}

144. Sandglass Pattern

class Main{

public static void main(String[] args){

int n=5;

for(int i=n;i>=1;i--){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++) [Link]("*");

[Link]();
}

for(int i=2;i<=n;i++){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++) [Link]("*");

[Link]();

}}

145. X Pattern

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n;j++){

if(i==j||i+j==n+1) [Link]("*");

else [Link](" ");

[Link]();

}}

146. Cross Pattern

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n;j++){

if(i==3||j==3) [Link]("*");

else [Link](" ");

[Link]();
}

}}

147. Zigzag Pattern

class Main{

public static void main(String[] args){

int n=9;

for(int i=1;i<=3;i++){

for(int j=1;j<=n;j++){

if((i+j)%4==0 || (i==2 && j%4==0)) [Link]("*");

else [Link](" ");

[Link]();

}}

148. Right Aligned Triangle

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=i;j++) [Link]("*");

[Link]();

}}

149. Hollow Diamond

class Main{

public static void main(String[] args){

int n=5;
for(int i=1;i<=n;i++){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++){

if(j==1||j==2*i-1) [Link]("*");

else [Link](" ");

[Link]();

for(int i=n-1;i>=1;i--){

for(int j=1;j<=n-i;j++) [Link](" ");

for(int j=1;j<=2*i-1;j++){

if(j==1||j==2*i-1) [Link]("*");

else [Link](" ");

[Link]();

}}

150. Square with diagonals

class Main{

public static void main(String[] args){

int n=5;

for(int i=1;i<=n;i++){

for(int j=1;j<=n;j++){

if(i==1||i==n||j==1||j==n||i==j||i+j==n+1)

[Link]("*");

else [Link](" ");

[Link]();

}}
OOP & JAVA (151–170)

151. Class & Object

class Student{

String name="Puneet";

void show(){ [Link](name); }

public static void main(String[] args){

Student s=new Student();

[Link]();

}}

152. Constructor

class A{

A(){ [Link]("Constructor called"); }

public static void main(String[] args){

new A();

}}

153. Copy Constructor

class A{

int x;

A(int x){ this.x=x; }

A(A o){ this.x=o.x; }

public static void main(String[] args){

A a1=new A(5);

A a2=new A(a1);

[Link](a2.x);

}}

154. Method Overloading

class Test{

void add(int a,int b){ [Link](a+b); }

public static void main(String[] args){

new Test().add(2,3);

}}

155. Method Overriding

class A{ void show(){ [Link]("A"); }}

class B extends A{ void show(){ [Link]("B"); }}

class Main{

public static void main(String[] args){

A obj=new B();

[Link]();

}}

156. Encapsulation

class A{

private int x;

void set(int x){ this.x=x; }

int get(){ return x; }

public static void main(String[] args){

A a=new A();

[Link](10);

[Link]([Link]());

}}

157. Inheritance

class A{ void show(){ [Link]("Parent"); }}

class B extends A{}

class Main{

public static void main(String[] args){

new B().show();
}}

158. Polymorphism

class A{ void show(){ [Link]("A"); }}

class B extends A{ void show(){ [Link]("B"); }}

class Main{

public static void main(String[] args){

A obj=new B();

[Link]();

}}

159. Abstract Class

abstract class A{

abstract void show();

class B extends A{

void show(){ [Link]("Abstract method"); }

public static void main(String[] args){

new B().show();

}}

160. Interface

interface A{ void show(); }

class B implements A{

public void show(){ [Link]("Interface method"); }

public static void main(String[] args){

new B().show();

}}

161. Try-Catch

class Main{
public static void main(String[] args){

try{

int a=5/0;

}catch(Exception e){

[Link]("Exception handled");

}}

162. Custom Exception

class MyEx extends Exception{

MyEx(String s){ super(s); }

class Main{

public static void main(String[] args){

try{

throw new MyEx("Custom Error");

}catch(Exception e){

[Link]([Link]());

}}

163. Multithreading

class A extends Thread{

public void run(){ [Link]("Thread running"); }

public static void main(String[] args){

new A().start();

}}

164. Runnable

class Main implements Runnable{

public void run(){ [Link]("Runnable thread"); }

new Thread(new Main()).start();

}}

165. Synchronization

class A{

synchronized void show(){

for(int i=1;i<=3;i++)

[Link]([Link]().getName());

class Main{

public static void main(String[] args){

A obj=new A();

new Thread(()->[Link]()).start();

new Thread(()->[Link]()).start();

}}

166. Static

class A{

static int x=10;

public static void main(String[] args){

[Link](A.x);

}}

167. Final

class A{

final int x=10;

public static void main(String[] args){

A a=new A();

[Link](a.x);
}}

168. Singleton

class A{

private static A obj=new A();

private A(){}

static A get(){ return obj; }

public static void main(String[] args){

A a=[Link]();

}}

169. Immutable

final class A{

private final int x;

A(int x){ this.x=x; }

int get(){ return x; }

170. Clone Object

class A implements Cloneable{

int x=5;

public static void main(String[] args)throws Exception{

A a=new A();

A b=(A)[Link]();

[Link](b.x);

}}

COLLECTIONS (171–185)

171. ArrayList

import [Link].*;

class Main{
public static void main(String[] args){

ArrayList<Integer> l=new ArrayList<>();

[Link](1); [Link](2);

[Link](l);

}}

172. LinkedList

import [Link].*;

class Main{

public static void main(String[] args){

LinkedList<Integer> l=new LinkedList<>();

[Link](5); [Link](10);

[Link](l);

}}

173. HashSet

import [Link].*;

class Main{

public static void main(String[] args){

HashSet<Integer> s=new HashSet<>();

[Link](1); [Link](1); [Link](2);

[Link](s);

}}

174. TreeSet

import [Link].*;

class Main{

public static void main(String[] args){

TreeSet<Integer> s=new TreeSet<>();

[Link](3); [Link](1); [Link](2);

[Link](s);
}}

175. HashMap

import [Link].*;

class Main{

public static void main(String[] args){

HashMap<Integer,String> m=new HashMap<>();

[Link](1,"A");

[Link](m);

}}

176. TreeMap

import [Link].*;

class Main{

public static void main(String[] args){

TreeMap<Integer,String> m=new TreeMap<>();

[Link](3,"C"); [Link](1,"A");

[Link](m);

}}

177–185 (sorting, frequency, etc.)

import [Link].*;

class Main{

public static void main(String[] args){

ArrayList<Integer> l=new ArrayList<>([Link](3,1,2,2,1));

[Link](l);

[Link](l);

HashMap<Integer,Integer> m=new HashMap<>();

for(int x:l) [Link](x,[Link](x,0)+1);

[Link](m);
HashSet<Integer> s=new HashSet<>(l);

[Link](s);

[Link]([Link](l));

[Link]([Link](l));

}}

DSA (186–200)

186. Stack

import [Link].*;

class Main{

public static void main(String[] args){

Stack<Integer> s=new Stack<>();

[Link](1); [Link](2);

[Link]([Link]());

}}

187. Queue

import [Link].*;

class Main{

public static void main(String[] args){

Queue<Integer> q=new LinkedList<>();

[Link](1); [Link](2);

[Link]([Link]());

}}

188. Balanced Parentheses

import [Link].*;

class Main{

public static void main(String[] args){

Stack<Character> st=new Stack<>();

for(char c:[Link]()){

if(c=='('||c=='['||c=='{') [Link](c);

else{

if([Link]()){ [Link](false); return;}

char t=[Link]();

if((c==')'&&t!='(')||(c==']'&&t!='[')||(c=='}'&&t!='{')){

[Link](false); return;}

[Link]([Link]());

}}

DSA (189–200)

189. Infix → Postfix

import [Link].*;

class Main{

static int prec(char c){

if(c=='+'||c=='-') return 1;

if(c=='*'||c=='/') return 2;

return 0;

public static void main(String[] args){

String s="a+b*c";

Stack<Character> st=new Stack<>();

String res="";

for(char c:[Link]()){

if([Link](c)) res+=c;

else{

while(![Link]() && prec([Link]())>=prec(c))

res+=[Link]();
[Link](c);

while(![Link]()) res+=[Link]();

[Link](res);

}}

190. Postfix Evaluation

import [Link].*;

class Main{

public static void main(String[] args){

String s="23*54*+9-"; // example

Stack<Integer> st=new Stack<>();

for(char c:[Link]()){

if([Link](c)) [Link](c-'0');

else{

int b=[Link](),a=[Link]();

switch(c){

case '+': [Link](a+b); break;

case '-': [Link](a-b); break;

case '*': [Link](a*b); break;

case '/': [Link](a/b); break;

[Link]([Link]());

}}

191. LinkedList Insert

class Node{

int data; Node next;

class Main{

public static void main(String[] args){

Node head=new Node(1);

[Link]=new Node(2);

Node n=new Node(3);

[Link]=head;

head=n;

for(Node t=head;t!=null;t=[Link])

[Link]([Link]+" ");

}}

192. LinkedList Reverse

class Node{

int data; Node next;

Node(int d){ data=d; }

class Main{

public static void main(String[] args){

Node head=new Node(1);

[Link]=new Node(2);

[Link]=new Node(3);

Node prev=null,cur=head;

while(cur!=null){

Node next=[Link];

[Link]=prev;

prev=cur;

cur=next;

for(Node t=prev;t!=null;t=[Link])
[Link]([Link]+" ");

}}

193. Detect Cycle in LinkedList

class Node{

int data; Node next;

Node(int d){ data=d; }

class Main{

public static void main(String[] args){

Node a=new Node(1);

Node b=new Node(2);

Node c=new Node(3);

[Link]=b; [Link]=c; [Link]=b; // cycle

Node slow=a,fast=a;

while(fast!=null && [Link]!=null){

slow=[Link];

fast=[Link];

if(slow==fast){ [Link]("Cycle"); return;}

[Link]("No Cycle");

}}

194. Binary Tree Traversal (Inorder)

class Node{

int data; Node left,right;

Node(int d){ data=d; }

class Main{

static void inorder(Node r){

if(r!=null){
inorder([Link]);

[Link]([Link]+" ");

inorder([Link]);

public static void main(String[] args){

Node r=new Node(1);

[Link]=new Node(2);

[Link]=new Node(3);

inorder(r);

}}

195. Height of Tree

class Node{

int data; Node left,right;

Node(int d){ data=d; }

class Main{

static int height(Node r){

if(r==null) return 0;

return 1+[Link](height([Link]),height([Link]));

public static void main(String[] args){

Node r=new Node(1);

[Link]=new Node(2);

[Link]=new Node(3);

[Link](height(r));

}}

196. BFS (Level Order)

import [Link].*;
class Node{

int data; Node left,right;

Node(int d){ data=d; }

class Main{

public static void main(String[] args){

Node r=new Node(1);

[Link]=new Node(2);

[Link]=new Node(3);

Queue<Node> q=new LinkedList<>();

[Link](r);

while(![Link]()){

Node n=[Link]();

[Link]([Link]+" ");

if([Link]!=null) [Link]([Link]);

if([Link]!=null) [Link]([Link]);

}}

197. DFS (Preorder)

class Node{

int data; Node left,right;

Node(int d){ data=d; }

class Main{

static void dfs(Node r){

if(r!=null){

[Link]([Link]+" ");

dfs([Link]);

dfs([Link]);

}
}

public static void main(String[] args){

Node r=new Node(1);

[Link]=new Node(2);

[Link]=new Node(3);

dfs(r);

}}

198. Binary Search Tree Insert

class Node{

int data; Node left,right;

Node(int d){ data=d; }

class Main{

static Node insert(Node r,int x){

if(r==null) return new Node(x);

if(x<[Link]) [Link]=insert([Link],x);

else [Link]=insert([Link],x);

return r;

static void inorder(Node r){

if(r!=null){

inorder([Link]);

[Link]([Link]+" ");

inorder([Link]);

public static void main(String[] args){

Node r=null;

r=insert(r,5);

r=insert(r,3);
r=insert(r,7);

inorder(r);

}}

199. Heap (Min Heap using PriorityQueue)

import [Link].*;

class Main{

public static void main(String[] args){

PriorityQueue<Integer> h=new PriorityQueue<>();

[Link](5); [Link](1); [Link](3);

while(![Link]())

[Link]([Link]()+" ");

}}

200. Merge Sort

class Main{

static void merge(int[] a,int l,int m,int r){

int n1=m-l+1,n2=r-m;

int[] L=new int[n1],R=new int[n2];

for(int i=0;i<n1;i++) L[i]=a[l+i];

for(int j=0;j<n2;j++) R[j]=a[m+1+j];

int i=0,j=0,k=l;

while(i<n1 && j<n2)

a[k++]=(L[i]<=R[j])?L[i++]:R[j++];

while(i<n1) a[k++]=L[i++];

while(j<n2) a[k++]=R[j++];

static void sort(int[] a,int l,int r){

if(l<r){

int m=(l+r)/2;

sort(a,l,m);
sort(a,m+1,r);

merge(a,l,m,r);

public static void main(String[] args){

int[] a={5,2,4,1,3};

sort(a,0,[Link]-1);

for(int x:a) [Link](x+" ");

}}