How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Groww interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
G
Groww Coding Interview Questions
8 problems · 1 Easy, 5 Medium, 2 Hard · Ranked #177 of 458
Difficulty breakdown
1 Easy
13% · avg 23%
5 Medium
63% · avg 59%
2 Hard
25% · avg 18%
Top topics
array
75%
dynamic-programming
62.5%3.2x
two-pointers
25%1.8x
hash-table
25%
breadth-first-search
12.5%1.5x
memoization
12.5%7.7x
Interview profile
Based on 8 reported problems, Groww interviews are slightly harder than average - 25% Hard vs 18% across all companies. The majority (63%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Groww puts unusual emphasis on dynamic-programming (62.5% of problems, 3.2x the industry average), two-pointers (25% of problems, 1.8x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (75%), dynamic-programming (62.5%), two-pointers (25%), hash-table (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 8 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Minimum Number of Operations to Make X and Y Equal You are given two positive integers x and y. | Medium | Very Likely | dynamic-programmingbreadth-first-searchmemoization | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Sort Colors Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order... | Medium | Likely | arraytwo-pointerssorting | Solve |
Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. | Medium | Likely | arraydynamic-programminggreedy | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Maximum Good Subarray Sum You are given an array nums of length n and a positive integer k. | Medium | Likely | arrayhash-tableprefix-sum | Solve |
Best Time to Buy and Sell Stock III You are given an array prices where prices[i] is the price of a given stock on the ith day. | Hard | Likely | arraydynamic-programming | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
Minimum Number of Operations to Make X and Y Equal
SolveYou are given two positive integers x and y.
MediumVery Likely
dynamic-programmingbreadth-first-searchmemoization
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
EasyLikely
arraydynamic-programming
Sort Colors
SolveGiven an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order...
MediumLikely
arraytwo-pointerssorting
Best Time to Buy and Sell Stock II
SolveYou are given an integer array prices where prices[i] is the price of a given stock on the ith day.
MediumLikely
arraydynamic-programminggreedy
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
MediumLikely
hash-tablelinked-listdesign
Maximum Good Subarray Sum
SolveYou are given an array nums of length n and a positive integer k.
MediumLikely
arrayhash-tableprefix-sum
Best Time to Buy and Sell Stock III
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
HardLikely
arraydynamic-programming
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
HardLikely
arraytwo-pointersdynamic-programming
Preparing for your Groww coding interview
Groww interviews focus heavily on array, dynamic-programming, two-pointers problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Groww interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Frequently Asked Questions
What coding problems does Groww ask in interviews?add
Groww has been reported to ask 8 distinct coding problems. The most common topics are array, dynamic-programming, two-pointers. 1 are Easy difficulty, 5 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Groww coding interviews?add
Based on 8 reported problems, Groww interviews are slightly harder than average - 25% Hard vs 18% across all companies. 63% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Groww coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, two-pointers. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your Groww interview?
Simulate a real Groww coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Groww interview with AIarrow_forward