29 curated coding interview questions directly asked in Paytm technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 100.0% | 6m |
| 264 | Ugly Number II | Medium | Core DSA | Implementation / Reasoning | 49.6% | 100.0% | 6m |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 100.0% | 6m |
| 2903 | Find Indices With Index and Value Difference I | Easy | Core DSA | Implementation / Reasoning | 60.3% | 100.0% | all |
| 2905 | Find Indices With Index and Value Difference II | Medium | Core DSA | Implementation / Reasoning | 32.8% | 100.0% | all |
| 1047 | Remove All Adjacent Duplicates In String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 73.2% | 100.0% | all |
| 2401 | Longest Nice Subarray | Medium | Arrays | Sorting / Prefix / Scan | 64.8% | 100.0% | all |
| 2439 | Minimize Maximum of Array | Medium | Arrays | Sorting / Prefix / Scan | 46.5% | 100.0% | all |
| 2475 | Number of Unequal Triplets in Array | Easy | Arrays | Sorting / Prefix / Scan | 73.4% | 100.0% | all |
| 3711 | Maximum Transactions Without Negative Balance | Medium | Arrays | Sorting / Prefix / Scan | 46.4% | 100.0% | all |
| 3816 | Lexicographically Smallest String After Deleting Duplicate Characters | Hard | Arrays; Strings; Graphs | Sorting / Prefix / Scan; Hashing / Sliding Window; BFS / DFS / Topological Sort | 20.2% | 100.0% | all |
| 142 | Linked List Cycle II | Medium | Linked List | Two Pointers | 57.9% | 87.5% | all |
| 2950 | Number of Divisible Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 74.6% | 87.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 75.0% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 75.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 75.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 75.0% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 62.5% | all |
| 316 | Remove Duplicate Letters | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 53.2% | 62.5% | all |
| 312 | Burst Balloons | Hard | Core DSA | Implementation / Reasoning | 63.5% | 62.5% | all |
| 1094 | Car Pooling | Medium | Core DSA | Implementation / Reasoning | 56.4% | 62.5% | all |
| 2721 | Execute Asynchronous Functions in Parallel | Medium | Core DSA | Implementation / Reasoning | 78.6% | 62.5% | all |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |