Groww coding interview questions
Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
| Progress | Title | Difficulty | Next step |
|---|---|---|---|
| Best Time to Buy and Sell StockState Machine DP - Stock Problems | Easy | Solve | |
| Container With Most WaterTwo Pointer | Medium | Solve | |
| Maximum Length of a Concatenated String with Unique CharactersPick / Not-Pick | Medium | Solve | |
| Best Time to Buy and Sell Stock IIState Machine DP - Stock Problems | Medium | Solve | |
| Maximum Number of Events That Can Be Attended II2D DP | Hard | Solve | |
| Single Element in a Sorted ArrayUnique 1-D Binary Search | Medium | Solve | |
| Lowest Common Ancestor of a Binary TreeLCA | Medium | Solve | |
| Linked List CycleSlow Fast Pointers | Easy | Solve | |
| Next Greater Element IMonotonic Stack | Easy | Solve | |
| Minimum Knight MovesBFS for shortest path | Medium | Solve | |
| Minimum Cost For Tickets1D DP | Medium | Solve | |
| Word Break1D DP | Medium | Solve | |
| Binary Tree Right Side ViewViews | Medium | Solve | |
| Left View of Binary TreeViews | Easy | Solve |
No questions match these filters.
Also reported, being added to AlgoRung (5)
Minimum Number of Operations to Make X and Y Equal · Maximize Score After N Operations · Maximum Good Subarray Sum · Delete the Middle Node of a Linked List · Rank Transform of an Array
Questions people ask
What coding questions does Groww ask most?
Best Time to Buy and Sell Stock, Container With Most Water, Maximum Length of a Concatenated String with Unique Characters, Best Time to Buy and Sell Stock II, Maximum Number of Events That Can Be Attended II, Single Element in a Sorted Array, Lowest Common Ancestor of a Binary Tree, Linked List Cycle.
Which topics come up in Groww coding rounds?
graphs, dynamic programming, arrays, linked list, trees, bit manipulation.
How hard are Groww coding questions?
Of the reported questions, 4 are easy, 9 medium and 1 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.