Coding ninja questions

Please Star the repo if you like it. This will have solutions to all the problems that are included in Coding Ninja's Java Course.

Notifications Mark All Read. TCS Ninja coding questions answers is available here. Also, you will find TCS ninja coding questions with solved papers. Mike has arranged a small party for the inauguration of his new startup. He has invited all of his fellow employees who are N in number. These employees are indexed with an array starting from 1 to N.

Coding ninja questions

.

ArrayList; import java. Updated Feb 19, Java. People who want to travel from city A to city B or vice versa have to pass through coding ninja questions ring road which is a huge waste of time and money.

.

Notifications Mark All Read. Below you will get similar pattern previous year questions, sample questions that were asked in TCS Ninja online test You can check Syllabus here and check the eligibility here. You can read more about the TCS ninja Pattern here on this page. There will be questions from various different logical topics, most of the important topics are listed below Important- TCS Ninja Reasoning Ability is a mandatory section for the exam, and it is the latest added section for the new Ninja exam pattern. Foundation Round exam pattern. Good Job! Did you know?

Coding ninja questions

Notifications Mark All Read. The questions asked in this round will be different from the types of questions asked in TCS Ninja Coding Round and will also be with higher difficulty level. You will be given 2 coding questions with high difficulty and you will have to solve those in definite time limit of 60 mins. If you are be able to clear the test then you will get the opportunity to go for TCS Digital Interview. The task is to cyclically rotate the array clockwise by K. There is the number 11, which has repeated digits, but 12, 13, 14 and 15 have no repeated digits. So, the output is 4. Question 3. The numbers in the series should be used to create a Pyramid. The base of the Pyramid will be the widest and will start converging towards the top where there will only be one element.

Accuweather imphal

Hence, we can have this multiplication of -1 only once. Multiply -1, 2 times to S[2] : [1, 2, 3]. Binary representation of 10 is This is a very simple game but becomes challenging when more expert players are playing. Course List. Not the same question but the pattern was same. Reload to refresh your session. Hence the answer is 4. Green cells are the cells that need to be captured. Jill has to derive a string C from A, by deleting elements from string A, such that string C does not contain any element of string B. The output is a sorted array from 0 to 2 based on risk severity. All Interview Exp. Hence the cells captured by Suresh will be 0. The minimum value greater than 0 which is not present here in the sequence is 4.

Also, they offer scholarships that definitely make it worth it. Dedicated Doubt Support to ensure you clear all your doubts.

Reload to refresh your session. Add a description, image, and links to the coding-ninjas-solution topic page so that developers can more easily learn about it. The input format for testing First Input — Accept value for N positive integer number. Updated Dec 15, Java. Jack has given Jill two strings A and B. Here, the risk severity of the items represents an array[] of N number of integer values. Also, you will find TCS ninja coding questions with solved papers. N-1], where each value is separated by a new line. First Input — Accept value for N positive integer number. Below is the operation: Pick exactly one element from the sequence and multiply it with Second input : Accept value for C Positive integer number ,. These 3 empty packets represented as O should be pushed towards the end of the array Example 1: Input: 7 — Value of N [4,5,0,1,0,0,5] — Element of arr[O] to arr[N-1],While input each element is separated by newline Output: 4 5 1 9 5 0 0 Example 2: Input: 6 — Value of N. Given N gold wires, each wire has a length associated with it. Below is the description of the game and rules: The game is played by 2 players.