Tcs Coding Questions 2021 ✦ Best Pick

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))

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) Tcs Coding Questions 2021

Good luck. Your TCS career starts with a single System.out.println("Hello World"); — make it count. Keywords integrated: TCS Coding Questions 2021, TCS NQT, TCS Ninja coding, TCS Digital preparation, prime number problems, string manipulation TCS, coin change TCS. def is_prime(n): if n &lt; 2: return False

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. M = 18