M=13. Standard greedy: 10+3 = 2 coins. But remainder after 10 =3 (divisible by 3) → forbidden. So you must choose 5+5+3 =3 coins.
def is_prime(n): if n < 2: return False for i in range(2, int(n**0.5)+1): if n % i == 0: return False return True def digit_sum(n): return sum(int(d) for d in str(n)) Tcs Coding Questions 2021
arr = list(map(int, input().split())) count = 0 for num in arr: if num > 10 and is_prime(num) and is_prime(digit_sum(num)): count += 1 print(count) Tcs Coding Questions 2021
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. Tcs Coding Questions 2021
Introduction: The Gatekeeper of an IT Dream