company prep
TCS
Problems frequently reported at TCS, in course order. Solve the must-dos first.
12 easy7 medium1 hardRecursion on a smaller input ×2Two pointers (opposite ends) ×2Digit peeling (% 10 and / 10) ×2Frequency counting ×2Two pointers (read / write) ×2String parsing ×2
08 · Recursion
- #509Fibonacci NumberEasymust-do
- #344Reverse StringEasy
09 · Math & Number Theory
- #9Palindrome NumberEasy
- #7Reverse IntegerMediummust-do
10 · Arrays & Strings
- #53Maximum SubarrayMediummust-do
- #169Majority ElementEasymust-do
- #242Valid AnagramEasymust-do
- #41First Missing PositiveHardmust-do
12 · Two Pointers
- #11Container With Most WaterMediummust-do
- #26Remove Duplicates from Sorted ArrayEasy
- #283Move ZeroesEasy
- #88Merge Sorted ArrayEasymust-do
- #75Sort ColorsMediummust-do
20 · String Parsing & Expression Evaluation
- #13Roman to IntegerEasymust-do
- #12Integer to RomanMedium
24 · Heaps & Priority Queues
- #621Task SchedulerMedium
34 · Bit Manipulation
- #136Single NumberEasymust-do
35 · Dynamic Programming
- #5Longest Palindromic SubstringMediummust-do
38 · Segment Trees, Fenwick & String Matching
- #28Find the Index of the First Occurrence in a StringEasymust-do
- #459Repeated Substring PatternEasy