TCS NQT Coding Round 2
Three problems with hidden test cases: two sum, balanced brackets and merging sorted arrays. Free.
- Problems
- 3
- Time
- 60 min
- Total marks
- 17
- Pass mark
- 40%
No account needed
Try 5 questions from this test now
Answer a few real questions, then see your score and the correct answers straight away. It takes about 4 minutes.
From start to your result
Here is what to expect, so you can begin with confidence.
Step 1
Start free
Create a free account in a minute, or sign in. No card needed.
Step 2
Write and run code
Code in the browser, run it on sample cases, then submit for the hidden cases.
Step 3
See your score
Your score and pass or fail show the moment you submit.
Step 4
Review, then retry
Go through every question, learn from mistakes, then take the next test.
What you take away
- A score you can compare with your next attempt
- Every question reviewed after you finish
- A clear idea of what to practise next
- The feel of a real online assessment
Your results are private to your account.
What is in this test
- Coding3 questions
More tests like this
TCS NQT Advanced Coding Pack (Premium)
Six harder problems, each with hidden test cases: word break, longest common subsequence, shortest paths, rotated search, longest unique substring and duplicates.
TCS NQT Coding Round 1
Three warm-up problems with hidden test cases: primes, FizzBuzz and maximum and minimum. Free.
TCS NQT Coding Round 3
Two medium problems with hidden test cases: rotating an array and merging intervals. Free.
JusPrep is not affiliated with TCS. This is a practice test in the style of its recruitment process, not the real exam.