Hi friends, in this video I discussed the actual TCS NQT 2026 coding questions asked on 3rd April (1st shift) and I shared complete solutions in C++, Java, and Python. Overall, the level was quite easy and honestly very repetitive—main thing I want to tell you is: previous year coding questions karke jaiega, because questions are repeating from 2024 and 2025 as well. I also mentioned that this shift didn’t have much compiler/input-related issues as per students’ feedback, so focus more on logic than small formatting differences. The first problem was based on calculating speed in km/h when distance is given in kilometers and time is given in minutes. You simply convert minutes to hours and apply speed = distance/time, with an important edge case: if time is invalid (like 0, or less than 1 / greater than 60 based on the solution), you should print an error. The second problem was maximum sub-array sum along with printing the sub-array itself, where I used Kadane’s algorithm and tracked start/end indices to print the continuous sub-array. If you’re preparing for TCS NQT or any placement exam, practice PYQs and learn Kadane’s properly—this concept helps in many similar problems.