Paytm coding interview
questions, leaked.
30 problems reported across recent Paytm interviews. Top patterns: array, two pointers, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Paytm's assessment is array-heavy and two-pointer dependent. You're looking at 18 array problems across 30 total, with two-pointers showing up in a third of them. The difficulty cliff is real: 23 medium, 6 easy, 1 hard. You won't have time to drill everything, so stack the basics first. If you hit a wall mid-assessment and can't remember how to solve Next Permutation or Longest Substring Without Repeating Characters, StealthCoder runs invisibly during your screen share and surfaces a working solution in seconds.
Top problems at Paytm
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Remove All Adjacent Duplicates In String | EASY | 100.0 | 72% | String · Stack |
| 02 | Find Indices With Index and Value Difference I | EASY | 97.6 | 60% | Array · Two Pointers |
| 03 | Longest Nice Subarray | MEDIUM | 97.6 | 65% | Array · Bit Manipulation · Sliding Window |
| 04 | Minimize Maximum of Array | MEDIUM | 97.6 | 46% | Array · Binary Search · Dynamic Programming |
| 05 | Number of Unequal Triplets in Array | EASY | 97.6 | 73% | Array · Hash Table · Sorting |
| 06 | Find Indices With Index and Value Difference II | MEDIUM | 97.6 | 32% | Array · Two Pointers |
| 07 | Min Stack | MEDIUM | 94.9 | 56% | Stack · Design |
| 08 | Number of Divisible Substrings | MEDIUM | 80.2 | 73% | Hash Table · String · Counting |
| 09 | Linked List Cycle II | MEDIUM | 80.2 | 55% | Hash Table · Linked List · Two Pointers |
| 10 | Valid Parentheses | EASY | 74.6 | 42% | String · Stack |
| 11 | Container With Most Water | MEDIUM | 74.6 | 58% | Array · Two Pointers · Greedy |
| 12 | Longest Substring Without Repeating Characters | MEDIUM | 67.3 | 37% | Hash Table · String · Sliding Window |
| 13 | Next Permutation | MEDIUM | 67.3 | 43% | Array · Two Pointers |
| 14 | Reverse Words in a String | MEDIUM | 67.3 | 52% | Two Pointers · String |
| 15 | 3Sum | MEDIUM | 67.3 | 37% | Array · Two Pointers · Sorting |
| 16 | Longest Palindromic Substring | MEDIUM | 67.3 | 36% | Two Pointers · String · Dynamic Programming |
| 17 | Two Sum | EASY | 67.3 | 56% | Array · Hash Table |
| 18 | Best Time to Buy and Sell Stock II | MEDIUM | 57.2 | 70% | Array · Dynamic Programming · Greedy |
| 19 | Second Highest Salary | MEDIUM | 57.2 | 44% | Database |
| 20 | Execute Asynchronous Functions in Parallel | MEDIUM | 57.2 | 78% | |
| 21 | Reverse Linked List | EASY | 57.2 | 79% | Linked List · Recursion |
| 22 | Largest Number | MEDIUM | 57.2 | 41% | Array · String · Greedy |
| 23 | Product of Array Except Self | MEDIUM | 57.2 | 68% | Array · Prefix Sum |
| 24 | Find Minimum in Rotated Sorted Array | MEDIUM | 57.2 | 53% | Array · Binary Search |
| 25 | Longest Consecutive Sequence | MEDIUM | 57.2 | 47% | Array · Hash Table · Union Find |
| 26 | Word Search | MEDIUM | 57.2 | 45% | Array · String · Backtracking |
| 27 | Trapping Rain Water | HARD | 57.2 | 65% | Array · Two Pointers · Dynamic Programming |
| 28 | Search in Rotated Sorted Array | MEDIUM | 57.2 | 43% | Array · Binary Search |
| 29 | String Compression | MEDIUM | 57.2 | 58% | Two Pointers · String |
| 30 | Sum of Subarray Minimums | MEDIUM | 57.2 | 38% | Array · Dynamic Programming · Stack |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Paytm OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array18 · 60%
- two pointers10 · 33%
- string9 · 30%
- hash table6 · 20%
- stack5 · 17%
- dynamic programming5 · 17%
- greedy4 · 13%
- prefix sum3 · 10%
- sorting3 · 10%
- binary search3 · 10%
Arrays and two-pointers are where Paytm lives. These two topics alone account for over half the problem set. String problems cluster around stack and hash-table patterns. Dynamic programming and greedy appear less often but show up in medium-difficulty problems like Minimize Maximum of Array that blend multiple techniques. The real trap is the medium-to-easy ratio: one slip on an easy and you're bleeding time on harder problems. Hash-table and string work together here, so practice sliding-window patterns early. When you're live and blank on a hash-table or prefix-sum angle, StealthCoder is your invisible backstop.
Companies with similar patterns
If you prepped for Paytm, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Paytm.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Paytm interview FAQ
How many array problems should I drill before Paytm?+
18 of 30 problems involve arrays. Aim for 25 to 30 solid array reps, hitting every subtype: two-pointer, sliding window, prefix-sum. Two-pointers especially, since it shows in 10 problems. Skip deep DP for now unless you're breezing through the rest.
Is string practice enough if I skip dynamic programming?+
String appears 9 times, mostly paired with stack or hash-table. You can defer DP drilling. It's only 5 problems and mostly shows in harder medium questions. Nail strings and stacks first, then DP as a buffer.
What's the fastest way to prep if I have one week?+
Focus on arrays (18), two-pointers (10), and strings (9). Those three cover 37 of 30 problems, so there's overlap. Drill Container With Most Water, Longest Substring Without Repeating Characters, Next Permutation, and 3Sum. Then hit the easy batch hard.
Should I worry about the one hard problem on Paytm?+
Not unless you're crushing mediums. Paytm's assessment is 77% medium, 20% easy, 3% hard. Spend your week on the medium band and easy reps. One hard at the end is a bonus, not a priority.
How important is hash-table for Paytm?+
Hash-table appears in 6 problems, mostly paired with string or linked-list work. It's a support skill here, not a main pillar. Master it alongside string patterns. Paytm leans array and two-pointer first.