Font size:
Background:
Kerning:
Images:
Refresh:
| Component | Details | |-----------|---------| | | 1 or 2 coding problems | | Time Allotted | 15–20 minutes (for coding) | | Languages Allowed | C, C++, Java, Python, Perl | | Difficulty | Easy to Medium | | Topics Covered | Arrays, Strings, Loops, Conditionals, Basic Math, Recursion |
Easy-Medium Marks: 12
Write a program to remove duplicate characters from a string without using an extra data structure (like set). Print the resulting string. Test case: "programming" → "progamin" Tcs Coding Questions 2021
Input: 9875 → 9+8+7+5=29 → 2+9=11 → 1+1=2. Recursion or formula 1 + (num-1)%9 . | Component | Details | |-----------|---------| | |
Total Ways equals open paren Even sub cap A cross Even sub cap B close paren plus open paren Even sub cap A cross Odd sub cap B close paren plus open paren Odd sub cap A cross Even sub cap B close paren Alternatively: Total Ways Recursion or formula 1 + (num-1)%9
An autobiographical number is an integer N such that the first digit (from left) counts how many zeros are in N, the second digit counts how many ones, and so on. Given a number (as a string), verify if it's autobiographical.