There are three rounds for this coding competition. Competition is divided into two zones, I am from the Kolkata zone....
As I stood at the threshold of my future, the weight of anticipation hung heavy in the air. The university’s imposing gates beckoned me forward, each step a testament to the culmination of years of dedication and aspiration. My admission experience was not just a mere administrative process; it was a profound journey of self-discovery and growth....
Given a directed graph of N vertices valued from 0 to N – 1 and array graph[] of size K represents the Adjacency List of the given graph, the task is to count all Hamiltonian Paths in it which start at the 0th vertex and end at the (N – 1)th vertex....
TCS organizes an online coding competition every year, named TCS Codevita. If you qualify in the first round, you will be invited for an interview in their office....
Given an undirected graph consisting of V vertices and a 2d array E[][2] denoting edges between pairs of nodes. Given another array arr[] representing values assigned to each node, the task is to find the maximum GCD among the GCD of all connected components in the graph....
Given a positive integer N denoting the number of astronauts(labelled from 0 from (N – 1))and a matrix mat[][] containing the pairs of astronauts that are from the same country, the task is to count the number of ways to choose two astronauts from different countries....
Given an array arr[] of size N consisting of distinct integers from range [0, N – 1] arranged in a random order. Also given a few pairs where each pair denotes the indices where the elements of the array can be swapped. There is no limit on the number of swaps allowed. The task is to find if it is possible to arrange the array in ascending order using these swaps. If possible then print Yes else print No.Examples:...
Round1: The first round of Code Vita was an online coding round with a duration of 6 hours, a virtual test. 6 coding questions were given. The level of difficulty varied from easy to moderate. Some questions were simple that the basic logic method worked for them and some questions were really tricky, they were regarding the topics like graphs and trees. Even if you get all test cases passed for 1 problem alone you would get a chance to attend the interview for TCS....
CodeVita is the world’s largest online coding contest being organized every year by TCS and to give them an opportunity for a job at TCS. CodeVita is an online coding contest that consists of 3 major rounds:...
Round 1:Codevita Season VIII (TCS Global Coding Contest)...
