Before diving into the questions, let's revisit the structure. The TCS NQT 2021 had two mandatory rounds where coding was tested:
Write a program to find the sum of all prime numbers between two given integers L and R (inclusive). Constraints: 1 ≤ L ≤ R ≤ 10^6. Tcs Coding Questions 2021
Repeatedly sum the digits of a number until a single digit is obtained (e.g., checking if the "digit sum" is 1). Before diving into the questions, let's revisit the
, continuously sum its digits until a single-digit value is obtained. Determine if that final digit is . Result: UNO. 3. Base 17 Conversion The Problem: Before diving into the questions
Before diving into the questions, let's revisit the structure. The TCS NQT 2021 had two mandatory rounds where coding was tested:
Write a program to find the sum of all prime numbers between two given integers L and R (inclusive). Constraints: 1 ≤ L ≤ R ≤ 10^6.
Repeatedly sum the digits of a number until a single digit is obtained (e.g., checking if the "digit sum" is 1).
, continuously sum its digits until a single-digit value is obtained. Determine if that final digit is . Result: UNO. 3. Base 17 Conversion The Problem: