2021 — Tcs Coding Questions

M = 18. Standard greedy uses 10+5+3 = 3 coins. But 18-10=8, and 8 is not divisible by 3, so allowed. If M=20, standard: 10+10 =2 coins, but after first 10, remainder=10 (not divisible by 3) → allowed. If M=15, standard: 10+5=2 coins, but remainder after 10 is 5 (not div by 3) → allowed. Actually this twist made it tricky.

Introduction: The Gatekeeper of an IT Dream Tcs Coding Questions 2021

Input: [11, 23, 41, 29, 56] Output: 3 (Because 11→1+1=2(prime), 23→2+3=5(prime), 41→4+1=5(prime), 29 is prime but 2+9=11(prime) actually also qualifies—so 4? Wait: 56 is not prime. So output is 4). M = 18

By mastering these 5+ patterns, you will solve 80% of TCS NQT coding problems. The remaining 20% is about speed, accuracy, and handling edge cases. If M=20, standard: 10+10 =2 coins, but after