TCS NQT || 07 July 2026 || Shift-2
July 7, 2026 · 0 reads
Summary
I took the TCS NQT coding assessment on 07 July 2026, which included an easy extended Integer‑to‑Roman problem and a medium LeetCode 1331 Rank Transform of an Array.
Full Experience
TCS NQT CODING SECTION :
- Easy Coding Section: A variation of the Integer to Roman problem was asked. Unlike the standard version, the input values extended to lakhs and crores, making it different from the usual LeetCode problem.
- Medium Coding Section: LeetCode 1331 – Rank Transform of an Array was asked.
Hope this helps anyone preparing for upcoming TCS NQT rounds.
Interview Questions (2)
1.
Integer to Roman (Extended Range)
Data Structures & Algorithms·Easy
Convert an integer to its Roman numeral representation. The input range is extended beyond the typical bounds (up to lakhs and crores), requiring handling of much larger values than the standard problem.
2.
Rank Transform of an Array
Data Structures & Algorithms·Medium
Given an integer array arr, replace each element with its rank among the elements. The rank is defined as 1 plus the number of distinct elements less than the element. Elements with the same value receive the same rank.