TCS Ninja Coding Questions: Top 5 Coding Questions with Solution

9 mins read

TCS Ninja is a highly sought-after entry-level role at Tata Consultancy Services (TCS). As part of the selection process, candidates go through a series of assessments, including a coding round that tests their programming skills. This detailed guide covers the TCS Ninja coding questions, previous year patterns, and tips for preparation.

TCS Ninja Coding Round Overview

The TCS Ninja coding round is designed to assess a candidate’s ability to solve algorithmic and data structure-related problems. The difficulty level ranges from easy to moderate, targeting fundamental concepts that every programmer should know.

Here's an overview of what the coding section typically looks like:

Topics for TCS Ninja Coding Questions

The questions in the TCS Ninja coding section focus on core computer science topics. Below is a breakdown of the most common topics and typical questions asked:

Questions Format for Ninja Coding

TCS Ninja coding questions typically come in different formats. Here's what you can expect:

Top 5 Sample Questions with Solution

Problem Statement 1

Ram and Shyam are two friends belonging to two different cities. They exchange messages weekly. The messages are very crucial so that no third person can see the message. But they sent a message via Jadav, a clever person. He usually reads the given messages. So, Ram and Shyam started talking in codewords. They set a convention for every letter in the English Alphabet.

Like ‘a’ to ‘i’ code is 1 to 9 and ‘j’ to  ‘z’ code is 10# to 26#.

Now suppose, Ram is sending a message to Shyam denoted by String S.

Can you tell me the decoded message that Shyam receives? 

Input Format

The first line of input contains the string S.

Output Format

Return the string which denotes the decoded message that Shyam receives

Constraints

1<=s.length<=10^9

Testcase Input

26#21#13#13#114#97820#

Testcase Output

zummanight

Solution 1: Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

class Main {

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        String s=sc.next();
        StringBuilder sb=new StringBuilder(s);
        int i=0;
        ArrayList<Integer> al=new ArrayList<>();
        for(int k=sb.length()-1;k>=0;k--){
            if(sb.charAt(k)=='#'){
                String str=sb.substring(k-2,k);
                al.add(Integer.parseInt(str));
                k=k-2;
            }
            else
            al.add(sb.charAt(k)-'0');
        }
        Collections.reverse(al);
       for(int x:al)
        System.out.print((char)(x+96));
    }
}

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

string decodeMsg(string s) {

    string ans = "";
    int i = s.length() - 1;
    string temp = "";
    while(i >= 0) {

        if(s[i] == '#') {
            temp = s[i-1];
            temp = s[i-2] + temp;
            int k = stoi(temp);
            ans = char(k - 1 + 'a') + ans;
            temp = "";
            i -= 3;
        } else {

            temp = s[i];
            int k = stoi(temp);
            i--;
            temp = "";
            ans = char(k - 1 + 'a') + ans;

        }
    }
    return ans;
}

int main() {
    
    string s;
    cin>>s;
    string ans = decodeMsg(s);
    cout<<ans<<endl; 
    return 0;
}

s=input()
d,a={},""
for i in range(122,96,-1):
    # print(chr(i))
    if (i-96)>=10:
        d[str(str(i-96)+"#")]= chr(i)
    else:
        d[str(i-96)]= chr(i)
# print(d)
i=0
while(i<len(s)):
    # print(i)
    if  str(s[i:i+3]) in d:
        # print(str(s[i:i+3]),end=" ")
        a+=str(d.get((s[i:i+3])))
        i+=3
        # s=s[i+3:]
    elif  str(s[i:i+2]) in d:
        # print(str(s[i:i+2]),end=" ")
        a+=d.get(str(s[i:i+2]))
        i+=2
    elif  str(s[i]) in d.keys():
        # print(str(s[i]),end=" ")
        a+=d.get(str(s[i]))
        i+=1
print(a)

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n,ans=0;
    cin>>n;
    while(n>1)
    {
        if(n%2==0)
        {
            ans+=n/2;
            n/=2;
            
        }
        else 
        {
            ans+=(n-1)/2;
            n=n/2+1;
            
        }
    }
    cout<<ans<<endl;
    return 0;
}

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

class Main {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int sum = 0;
        while (n > 1) {
            if (n % 2 == 0) {
                sum += n / 2;
                n = n / 2;
            } else {
                sum += (n - 1) / 2;
                n = (n - 1) / 2 + 1;
            }
        }
        System.out.println(sum);
    }
}

# Enter your code here. Read input from STDIN. Print output to STDOUT
a=int(input())
c=a-1
print(c)

from collections import Counter
from math import comb

def count_sock_sets(n, sock_colors):
    color_count = Counter(sock_colors)
    total_sets = 0
    for count in color_count.values():
        if count >= 3:
            total_sets += comb(count, 3)
    
    return total_sets

n = int(input()) 
sock_colors = list(map(int, input().split()))
print(count_sock_sets(n, sock_colors))

#include <bits/stdc++.h>
using namespace std;

// Function to compute nC3
int combinations(int n) {
    if (n < 3) {
        return 0; // nC3 is 0 if n < 3
    }
    return (n * (n - 1) * (n - 2)) / 6;
}

int main() {
    int n;
    cin >> n;

    unordered_map<int, int> m;
    int maxe = 0;
    for (int i = 0; i < n; i++) {
        int ele;
        cin >> ele;

        m[ele]++;
        maxe = max(maxe, m[ele]);
    }

    int cnt = 0;
    for (auto itr : m) {
        cnt += combinations(itr.second); // Calculate nC3 for each frequency
    }

    cout << cnt << endl;

    return 0;
}

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] socks = new int[N];
        for (int i = 0; i < N; i++) {
            socks[i] = sc.nextInt();
        }
        sc.close();
        int[] colorCount = new int[1001];
        for (int color : socks) {
            colorCount[color]++;
        }
        int totalSets = 0;
        for (int count : colorCount) {
            if (count >= 3) {
                totalSets += (count * (count - 1) * (count - 2)) / 6;
            }
        }
        System.out.println(totalSets);
    }
}

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Main {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
    LinkedList<Integer> l = new LinkedList<>();
    Scanner in = new Scanner(System.in);
    int n= in.nextInt();
    for(int i=0;i<n;i++){
        l.add(in.nextInt());
    }
    int k=in.nextInt();
    int temp=l.get(k-1);
    l.set(k-1,l.get(n-k));
    l.set(n-k,temp);
    for(int e: l){
        System.out.print(e+" ");
    }
    }
}

#include <list>
#include <iostream>
#include <iterator>
using namespace std;
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int n;
    cin>>n;
    list<int> L1;
    for(int i=0;i<n;i++){
        int dummy;
        cin>>dummy;
        L1.push_back(dummy);
    } 
    int index;
    cin>>index;
    list<int>::iterator itr;
    list<int>::reverse_iterator ptr;
    int counter=0;
    for(itr=L1.begin(),ptr=L1.rbegin();itr!=L1.end() && ptr!=L1.rend();itr++,ptr++){
        if(counter==index-1){
            int temp=*itr;
            *itr=*ptr;
            *ptr=temp;
        }
        counter++;
    }
    for(auto it=L1.begin();it!=L1.end();it++){
        cout<<*it<<" ";
    }
    return 0;
}

# Enter your code here. Read input from STDIN. Print output to STDOUT
n=int(input())
li=list(map(int,input().split()))

k=int(input())
li[k-1],li[-k]=li[-k],li[k-1]

for ele in li:
    print(ele,end=" ")

# Enter your code here. Read input from STDIN. Print output to STDOUT
def count_fleets(n, k, position, speed):
    # Step 1: Calculate the time for each spaceship to reach the target
    time = [(k - position[i]) / speed[i] for i in range(n)]
    
    # Step 2: Sort spaceships by their position from farthest to closest
    ships = sorted(zip(position, time), reverse=True)
    
    # Step 3: Count the number of distinct fleets
    fleets = 0
    current_time = 0
    
    for _, t in ships:
        if t > current_time:
            fleets += 1
            current_time = t
    
    return fleets

# Input
n = int(input())  # Number of spaceships
k = int(input())  # Target distance
position = list(map(int, input().split()))  # Current positions of the spaceships
speed = list(map(int, input().split()))  # Speeds of the spaceships

# Output the number of fleets
print(count_fleets(n, k, position, speed))

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int countFleets(int n, int k, vector<int>& position, vector<int>& speed) {
    vector<pair<int, double>> ships(n); // To store positions and corresponding times to reach the target
    
    // Calculate the time for each spaceship to reach the target
    for (int i = 0; i < n; i++) {
        double time = (double)(k - position[i]) / speed[i];
        ships[i] = {position[i], time};
    }
    
    // Sort ships based on their starting positions (farthest first)
    sort(ships.begin(), ships.end(), greater<pair<int, double>>());
    
    int fleets = 0;
    double lastFleetTime = 0.0;
    
    // Iterate over sorted ships to count fleets
    for (int i = 0; i < n; i++) {
        if (ships[i].second > lastFleetTime) {
            fleets++;
            lastFleetTime = ships[i].second; // Update the latest fleet's time
        }
    }
    
    return fleets;
}

int main() {
    int n, k;
    cin >> n >> k;
    
    vector<int> position(n), speed(n);
    for (int i = 0; i < n; i++) {
        cin >> position[i];
    }
    
    for (int i = 0; i < n; i++) {
        cin >> speed[i];
    }
    
    // Output the number of distinct fleets
    cout << countFleets(n, k, position, speed) << endl;
    
    return 0;
}

import java.util.*;

public class Main {
    public static int countFleets(int n, int target, int[] position, int[] speed) {
        List<Pair> sorted = new ArrayList<>(); // Store position and time to reach target

        // Calculate time taken by each spacecraft to reach target
        for (int i = 0; i < n; ++i) {
            sorted.add(new Pair(position[i], (double)(target - position[i]) / speed[i]));
        }

        // Sort spacecraft by position in descending order
        Collections.sort(sorted, (a, b) -> b.position - a.position);

        int fleets = 0;
        double maxTime = 0;

        // Iterate over sorted spacecraft
        for (Pair p : sorted) {
            if (p.time > maxTime) {
                maxTime = p.time;
                fleets++; // Increment fleet count if spacecraft takes more time to reach target
            }
        }

        return fleets;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int n = sc.nextInt();
        int target = sc.nextInt();
        
        int[] position = new int[n];
        int[] speed = new int[n];

        for (int i = 0; i < n; ++i) {
            position[i] = sc.nextInt();
        }

        for (int i = 0; i < n; ++i) {
            speed[i] = sc.nextInt();
        }

        int result = countFleets(n, target, position, speed);
        System.out.println(result);
    }

    static class Pair {
        int position;
        double time;

        Pair(int position, double time) {
            this.position = position;
            this.time = time;
        }
    }
}

Enhance your coding skills by practicing coding questions across various levels. Click here to start your coding journey and master programming!

Preparation Tips

Here are some tips to ace the TCS Ninja coding round:

Conclusion

The TCS Ninja coding round is a critical part of the recruitment process, testing your problem-solving ability and programming knowledge. Whether you’re a fresher or have some experience, consistent practice in algorithms, data structures, and coding problems will help you excel. Focus on solving previous year's questions, improve your speed, and keep practising to enhance your coding skills.

Disclaimer: While we have gathered as much information from Deloitte's official website as possible, we have also included sources gathered from available online sources. Therefore, readers are advised to check and stay updated with the official website.

Frequently Asked Questions (FAQs)

1. What is the difficulty level of the coding questions in TCS Ninja?

The coding questions in the TCS Ninja exam are generally of easy to moderate difficulty, focusing on fundamental concepts like arrays, strings, and basic algorithms.

2. How many coding questions are asked in the TCS Ninja exam?

Typically, the exam includes 1-2 coding questions that need to be solved within 30 to 45 minutes.

3. Which programming languages can be used in the TCS Ninja coding round?

You can use programming languages such as C, C++, Java, Python, or Perl, depending on the platform.

4. What topics should I focus on for TCS Ninja coding questions?

Key topics include arrays, strings, recursion, sorting and searching algorithms, and basic dynamic programming problems.

Suggested reads:

• Deloitte Coding Questions: Top 5 Coding Questions for Freshers

• TCS Digital Recruitment Process: Latest Updates & Tips for Freshers

• HCL Logical Reasoning Questions and Answers: Top 5 Sample MCQs

• HCL Aptitude Test: Top 5 Questions and Answers for Freshers (MCQs)

• TCS Digital Aptitude Questions and Answers: Top 5 Sample MCQs