TCS nqt -2026

Top 50 Coding Question

Prepared By: Abhishek Rathor

Instagram: @code.abhii07 (SYNTAXERROR)

1. Check Even or 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");
}
}

2. Check Prime Number

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
boolean prime = true;
if(n <= 1) prime = false;
for(int i = 2; i <= [Link](n); i++){
if(n % i == 0){
prime = false;
break;
}
}
[Link](prime ? "Prime" : "Not Prime");
}
}

3. Factorial of a Number
import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
long fact = 1;
 for(int i = 1; i <= n; i++)
fact *= i;
[Link](fact);
}
}

4. Fibonacci Series (First N Terms)

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int a = 0, b = 1;
for(int i = 1; i <= n; i++){
[Link](a + " ");
int c = a + b;
a = b;
b = c;
}
}
}

5. Reverse a Number
import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int rev = 0;
while(n != 0){
rev = rev * 10 + n % 10;
n /= 10;
}
[Link](rev);
}
}

6. Check Palindrome Number

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int temp = n, rev = 0;
while(n != 0){
rev = rev * 10 + n % 10;
n /= 10;
}
[Link](temp == rev ? "Palindrome" : "Not Palindrome");
 }
}

7. Armstrong Number
import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int temp = n, sum = 0;
while(n != 0){
int digit = n % 10;
sum += digit * digit * digit;
n /= 10;
}
[Link](temp == sum ? "Armstrong" : "Not Armstrong");
}
}

8. Sum of Digits
import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int sum = 0;
while(n != 0){
sum += n % 10;
n /= 10;
}
[Link](sum);
}
}

9. Largest of Three Numbers

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int a = [Link](), b = [Link](), c = [Link]();
int max = [Link](a, [Link](b, c));
[Link](max);
}
}

10. GCD of Two Numbers

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int a = [Link](), b = [Link]();
while(b != 0){
int temp = b;
b = a % b;
a = temp;
}
[Link](a);
}
}

11. LCM of Two Numbers

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int a = [Link](), b = [Link]();
int x = a, y = b;
while(y != 0){
int temp = y;
y = x % y;
x = temp;
}
int gcd = x;
int lcm = (a * b) / gcd;
[Link](lcm);
}
}

12. Check Leap Year

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int year = [Link]();
if((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))
[Link]("Leap Year");
else
[Link]("Not Leap Year");
}
}

13. Count Vowels and Consonants

import [Link].*;
class Main{
public static void main(String[] args){
 Scanner sc = new Scanner([Link]);
String str = [Link]().toLowerCase();
int vowels = 0, consonants = 0;
for(char ch : [Link]()){
if([Link](ch)){
if("aeiou".indexOf(ch) != -1)
vowels++;
else
consonants++;
}
}
[Link]("Vowels: " + vowels);
[Link]("Consonants: " + consonants);
}
}

14. Reverse a String

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
String str = [Link]();
String rev = "";
for(int i = [Link]() - 1; i >= 0; i--)
rev += [Link](i);
[Link](rev);
}
}

15. Check Anagram

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
String s1 = [Link]();
String s2 = [Link]();
char[] a = [Link]();
char[] b = [Link]();
[Link](a);
[Link](b);
[Link]([Link](a,b) ? "Anagram" : "Not Anagram");
}
}

16. Remove Duplicates from String

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
 String str = [Link]();
String result = "";
for(char ch : [Link]()){
if([Link](ch) == -1)
result += ch;
}
[Link](result);
}
}

17. Find Second Largest in Array

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = [Link]();
int first = Integer.MIN_VALUE, second = Integer.MIN_VALUE;
for(int num : arr){
if(num > first){
second = first;
first = num;
} else if(num > second && num != first){
second = num;
}
}
[Link](second);
}
}

18. Linear Search

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = [Link]();
int key = [Link]();
boolean found = false;
for(int num : arr){
if(num == key){
found = true;
break;
}
}
[Link](found ? "Found" : "Not Found");
}
}
19. Binary Search (Sorted Array)
import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = [Link]();
int key = [Link]();
int low = 0, high = n - 1;
boolean found = false;
while(low <= high){
int mid = (low + high) / 2;
if(arr[mid] == key){
found = true;
break;
}
else if(arr[mid] < key)
low = mid + 1;
else
high = mid - 1;
}
[Link](found ? "Found" : "Not Found");
}
}

20. Bubble Sort

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = [Link]();
for(int i = 0; i < n-1; i++){
for(int j = 0; j < n-i-1; j++){
if(arr[j] > arr[j+1]){
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
for(int num : arr)
[Link](num + " ");
}
}

21. Selection Sort

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int[] arr = new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

for(int i=0;i<n-1;i++){
int minIndex=i;
for(int j=i+1;j<n;j++){
if(arr[j]<arr[minIndex])
minIndex=j;
}
int temp=arr[i];
arr[i]=arr[minIndex];
arr[minIndex]=temp;
}

for(int num:arr)
[Link](num+" ");
}
}

22. Insertion Sort

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

for(int i=1;i<n;i++){
int key=arr[i];
int j=i-1;
while(j>=0 && arr[j]>key){
arr[j+1]=arr[j];
j--;
}
arr[j+1]=key;
}

for(int num:arr)
[Link](num+" ");
}
}

23. Matrix Addition

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
 int r=[Link](), c=[Link]();
int[][] a=new int[r][c];
int[][] b=new int[r][c];
int[][] sum=new int[r][c];

for(int i=0;i<r;i++)
for(int j=0;j<c;j++)
a[i][j]=[Link]();

for(int i=0;i<r;i++)
for(int j=0;j<c;j++)
b[i][j]=[Link]();

for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
sum[i][j]=a[i][j]+b[i][j];
[Link](sum[i][j]+" ");
}
[Link]();
}
}
}

24. Transpose of Matrix

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int r=[Link](), c=[Link]();
int[][] a=new int[r][c];

for(int i=0;i<r;i++)
for(int j=0;j<c;j++)
a[i][j]=[Link]();

for(int j=0;j<c;j++){
for(int i=0;i<r;i++){
[Link](a[i][j]+" ");
}
[Link]();
}
}
}

25. Count Frequency of Element in Array

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();
int key=[Link]();
 int count=0;
for(int num:arr){
if(num==key) count++;
}
[Link](count);
}
}

26. Check if Array is Sorted

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

boolean sorted=true;
for(int i=0;i<n-1;i++){
if(arr[i]>arr[i+1]){
sorted=false;
break;
}
}
[Link](sorted ? "Sorted" : "Not Sorted");
}
}

27. Merge Two Arrays

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n1=[Link]();
int[] a=new int[n1];
for(int i=0;i<n1;i++) a[i]=[Link]();

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

int[] merged=new int[n1+n2];

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

for(int i=0;i<n2;i++)
merged[n1+i]=b[i];

for(int num:merged)
[Link](num+" ");
}
}

28. Find Missing Number (1 to N)

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n-1];
for(int i=0;i<n-1;i++) arr[i]=[Link]();

int total=n*(n+1)/2;
int sum=0;
for(int num:arr) sum+=num;

[Link](total-sum);
}
}

29. Count Words in a String

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
String str=[Link]().trim();
if([Link]()){
[Link](0);
} else {
String[] words=[Link]("\\s+");
[Link]([Link]);
}
}
}

30. Remove All Spaces from String

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
String str=[Link]();
str=[Link](" ","");
[Link](str);
}
}

31. Find Duplicate Elements in Array

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int[] arr = new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(arr[i]==arr[j]){
[Link](arr[i]+" ");
break;
}
}
}
}
}

32. Move All Zeros to End

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

int index=0;
for(int i=0;i<n;i++){
if(arr[i]!=0){
arr[index++]=arr[i];
}
}
while(index<n){
arr[index++]=0;
}

for(int num:arr)
[Link](num+" ");
}
}

33. Rotate Array Right by 1 Position

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

int last=arr[n-1];
 for(int i=n-1;i>0;i--){
arr[i]=arr[i-1];
}
arr[0]=last;

for(int num:arr)
[Link](num+" ");
}
}

34. Check Palindrome String

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
String str=[Link]();
String rev="";
for(int i=[Link]()-1;i>=0;i--)
rev+=[Link](i);

[Link]([Link](rev) ? "Palindrome" : "Not

Palindrome");
}
}

35. Count Number of Digits

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int count=0;
while(n!=0){
n/=10;
count++;
}
[Link](count);
}
}

36. Sum of Elements in Array

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
int sum=0;
for(int i=0;i<n;i++){
 arr[i]=[Link]();
sum+=arr[i];
}
[Link](sum);
}
}

37. Find Minimum Element in Array

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();

int min=arr[0];
for(int i=1;i<n;i++){
if(arr[i]<min)
min=arr[i];
}
[Link](min);
}
}

38. Pattern Printing (Right Triangle)

Input: 4
Output:
*
**
***
****
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++){
for(int j=1;j<=i;j++){
[Link]("*");
}
[Link]();
}
}
}

39. Power of a Number

import [Link].*;
class Main{
 public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int base=[Link]();
int exp=[Link]();
int result=1;
for(int i=1;i<=exp;i++)
result*=base;
[Link](result);
}
}

40. Decimal to Binary

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
String binary="";
while(n>0){
binary=(n%2)+binary;
n/=2;
}
[Link](binary);
}
}

41. Binary to Decimal

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
String binary = [Link]();
int decimal = 0;
int power = 0;

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

if([Link](i) == '1'){
decimal += [Link](2, power);
}
power++;
}
[Link](decimal);
}
}

42. Check Perfect Number

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int sum = 0;

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

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

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

}
}

43. Strong Number

import [Link].*;
class Main{
public static int factorial(int n){
int fact = 1;
for(int i = 1; i <= n; i++)
fact *= i;
return fact;
}

public static void main(String[] args){

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

while(n != 0){
int digit = n % 10;
sum += factorial(digit);
n /= 10;
}

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

}
}

44. Count Even and Odd Numbers in Array

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
int n = [Link]();
int[] arr = new int[n];
int even = 0, odd = 0;

for(int i=0;i<n;i++){
arr[i]=[Link]();
if(arr[i]%2==0)
even++;
 else
odd++;
}

[Link]("Even: " + even);

[Link]("Odd: " + odd);
}
}

45. Find Intersection of Two Arrays

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n1=[Link]();
int[] a=new int[n1];
for(int i=0;i<n1;i++) a[i]=[Link]();

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

for(int i=0;i<n1;i++){
for(int j=0;j<n2;j++){
if(a[i]==b[j]){
[Link](a[i]+" ");
break;
}
}
}
}
}

46. Check Substring

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
String str=[Link]();
String sub=[Link]();

if([Link](sub))
[Link]("Substring Present");
else
[Link]("Substring Not Present");
}
}

47. Remove Specific Character from String

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
String str=[Link]();
char ch=[Link]().charAt(0);

str=[Link]([Link](ch),"");
[Link](str);
}
}

48. Sum of Prime Numbers up to N

import [Link].*;
class Main{
public static boolean isPrime(int n){
if(n<=1) return false;
for(int i=2;i<=[Link](n);i++){
if(n%i==0) return false;
}
return true;
}

public static void main(String[] args){

Scanner sc=new Scanner([Link]);
int n=[Link]();
int sum=0;

for(int i=2;i<=n;i++){
if(isPrime(i))
sum+=i;
}

[Link](sum);
}
}

49. Reverse Words in a Sentence

import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
String str=[Link]();
String[] words=[Link](" ");

for(int i=[Link]-1;i>=0;i--){
[Link](words[i]+" ");
}
}
}
50. Two Sum Problem
import [Link].*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int[] arr=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();
int target=[Link]();

for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(arr[i]+arr[j]==target){
[Link](i+" "+j);
return;
}
}
}
[Link]("No Pair Found");
}
}