Wait—The actual TCS 2021 version was simpler: Replace all non-overlapping "WWW" with "F". But overlapping should remain.
Input: "1100111001" Output: 3 (groups: "11", "111", "1") Tcs Coding Questions 2021
For millions of engineering graduates in India, Tata Consultancy Services (TCS) represents more than just a job—it is a career launchpad. As the largest private-sector employer in the country, TCS conducts its National Qualifier Test (NQT) yearly. While the exam pattern evolves, the coding section remains the highest-scoring and most decisive part. Wait—The actual TCS 2021 version was simpler: Replace
def sieve(n): is_prime = [True]*(n+1) is_prime[0]=is_prime[1]=False for i in range(2,int(n**0.5)+1): if is_prime[i]: for j in range(i*i, n+1, i): is_prime[j]=False return is_prime L, R = map(int, input().split()) prime_flags = sieve(R) total = sum(i for i in range(L, R+1) if prime_flags[i]) print(total) As the largest private-sector employer in the country,
TCS loved problems that mix string indexing and array frequency. Question 4: "Minimum Coins" (Greedy Algorithm – Modified) Problem Statement: In a foreign country, the currency denominations are [1, 3, 5, 10, 25, 50] . Given an amount M (≤ 1000), find the minimum number of coins needed. But with a twist: You cannot use the 10-rupee coin if the remaining amount after using other coins is divisible by 3.
"1001" → Choose substring indices 1 to 3 ("001")? Actually original: 1 0 0 1. Pick substring positions 2-4 (0,0,1) has only one '1'. Not allowed. This was so tricky that TCS 2021 actually had a simpler version: Count the number of groups of consecutive '1's.
