Tcs Coding Questions 2021 -

Recursion is inefficient for large N. TCS 2021 often asked for logic, not efficiency.

int main() string s; cin >> s; string result = ""; int i = 0; while(i < s.length()) if(i+2 < s.length() && s[i]=='W' && s[i+1]=='W' && s[i+2]=='W') result += 'F'; i += 3; // skip ahead to avoid overlap else result += s[i]; i++; Tcs Coding Questions 2021