Tcs Coding Questions 2021 _top_ Jun 2026

The compiler in 2021 was very strict about time complexity . If you used nested loops for a problem solvable in O(n), you failed the hidden test cases.

print(remove_consecutive_duplicates("aabbccdde")) # Output: abcde Tcs Coding Questions 2021

Given a string s and integer k , count the number of substrings that contain at most k distinct characters. The compiler in 2021 was very strict about time complexity

public class MissingNumber public static int findMissing(int[] arr, int n) int total = (n + 1) * (n + 2) / 2; int sum = 0; for (int num : arr) sum += num; return total - sum; int sum = 0

def remove_consecutive_duplicates(s): if not s: return "" result = [s[0]] for ch in s[1:]: if ch != result[-1]: result.append(ch) return ''.join(result)