Groww coding interview
questions, leaked.
8 problems reported across recent Groww interviews. Top patterns: array, dynamic programming, two pointers. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Groww's assessment hits you with 8 problems across a tight difficulty spread: one easy, five medium, two hard. You're looking at a fintech company that cares about optimization and state management. Arrays dominate the problem set, but dynamic programming is the real gatekeeper. Five of the eight problems require DP, often combined with arrays or greedy logic. If you walk in unprepared for stock trading variants and rain-water trapping, you'll hit a wall fast. StealthCoder runs invisibly during your assessment, so if you blank on the DP recurrence or the two-pointer trick, you get a working solution in seconds without the proctor seeing a thing.
Top problems at Groww
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Number of Operations to Make X and Y Equal | MEDIUM | 100.0 | 47% | Dynamic Programming · Breadth-First Search · Memoization |
| 02 | Best Time to Buy and Sell Stock | EASY | 73.6 | 55% | Array · Dynamic Programming |
| 03 | Trapping Rain Water | HARD | 64.8 | 65% | Array · Two Pointers · Dynamic Programming |
| 04 | LRU Cache | MEDIUM | 64.8 | 45% | Hash Table · Linked List · Design |
| 05 | Maximum Good Subarray Sum | MEDIUM | 64.8 | 20% | Array · Hash Table · Prefix Sum |
| 06 | Best Time to Buy and Sell Stock II | MEDIUM | 64.8 | 70% | Array · Dynamic Programming · Greedy |
| 07 | Best Time to Buy and Sell Stock III | HARD | 64.8 | 51% | Array · Dynamic Programming |
| 08 | Sort Colors | MEDIUM | 64.8 | 68% | Array · Two Pointers · Sorting |
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 Groww OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- array6 · 75%
- dynamic programming5 · 63%
- two pointers2 · 25%
- hash table2 · 25%
- stack1 · 13%
- monotonic stack1 · 13%
- linked list1 · 13%
- design1 · 13%
- doubly linked list1 · 13%
- breadth first search1 · 13%
The topic distribution tells you exactly what to drill: array manipulation accounts for six problems, and most of those layer in dynamic programming or prefix sums. Stock trading problems appear three times in different guises, getting progressively harder. That's not accidental. Trapping Rain Water and LRU Cache are the real curveballs because they demand both algorithmic insight and clean implementation. Two-pointers shows up twice, often paired with arrays. Hash tables and design patterns are secondary but present. Your strategy: spend 60 percent of prep time on array and DP combinations, especially the stock problems. Get comfortable with prefix sums and monotonic stacks as accelerators. LRU Cache is design-heavy but solvable with a hash table and doubly-linked list. The hard problems are genuinely hard, so StealthCoder is your hedge for whichever one you don't fully internalize under live pressure.
Companies with similar patterns
If you prepped for Groww, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Groww.
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. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Groww interview FAQ
How many array problems should I solve before this assessment?+
Six of eight problems involve arrays. Master the three stock-trading variants first, then Trapping Rain Water. After those four, you've seen most of the array patterns Groww tests. Practice prefix-sum logic and two-pointer sweeps on the remaining array problems. You're looking at 10 to 15 focused reps, not hundreds.
Is dynamic programming required for Groww?+
Yes. Five of eight problems explicitly require DP or benefit from it. Best Time to Buy and Sell Stock I, II, and III all need DP thinking. Trapping Rain Water can be solved with DP. Even Maximum Good Subarray Sum uses prefix sums, which are DP-adjacent. You cannot skip this topic.
Should I study design patterns or just algorithms?+
LRU Cache is design-focused and appears in the top problems. You need to know hash tables and doubly-linked lists to solve it under time pressure. Spend a day on it. The rest of Groww's assessment is pure algorithms, so design is maybe 12 percent of the burden, but it's non-negotiable if you hit that problem.
What's the hardest problem I'll face?+
Trapping Rain Water or Best Time to Buy and Sell Stock III. Trapping Rain Water requires orchestrating arrays, two pointers, stacks, and monotonic-stack logic together. Stock III demands a state machine with four states and careful DP transitions. Both are medium-to-hard edge cases. Drill them explicitly.
How should I approach the medium problems?+
Five of eight are medium. Don't treat them lightly. Most combine two techniques: arrays with DP, or arrays with two pointers. Best Time to Buy and Sell Stock II is deceptively simple if you see the greedy pattern, but Stock III is not. Sort Colors is medium but can trip you up if you haven't practiced the Dutch flag algorithm. Plan 2 to 3 days for all five mediums.