0 day streak

Groww coding interview questions

FintechProduct India Machine coding / LLD

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.

0%ready
ProgressTitleDifficultyTopicHow often hereAlso asked atNext step
Best Time to Buy and Sell StockState Machine DP - Stock Problems Easy Dynamic Programming Amazon, Microsoft, Apple +38 Solve
Container With Most WaterTwo Pointer Medium Arrays & Hashing Google, Microsoft, Apple +31 Solve
Maximum Length of a Concatenated String with Unique CharactersPick / Not-Pick Medium Recursion & Backtracking Tesla Solve
Best Time to Buy and Sell Stock IIState Machine DP - Stock Problems Medium Dynamic Programming ServiceNow, JPMorgan Chase, Meesho Solve
Maximum Number of Events That Can Be Attended II2D DP Hard Dynamic Programming Snowflake Solve
Single Element in a Sorted ArrayUnique 1-D Binary Search Medium Binary Search Snowflake, IBM, Zomato +2 Solve
Lowest Common Ancestor of a Binary TreeLCA Medium Trees & BST Google, Microsoft, Meta +19 Solve
Linked List CycleSlow Fast Pointers Easy Linked List Microsoft, Apple, Goldman Sachs +16 Solve
Next Greater Element IMonotonic Stack Easy Monotonic Stack Oracle, Adobe, Morgan Stanley +8 Solve
Minimum Knight MovesBFS for shortest path Medium Graphs Microsoft, Databricks, Myntra Solve
Minimum Cost For Tickets1D DP Medium Dynamic Programming Zepto Solve
Word Break1D DP Medium Dynamic Programming Google, Amazon, Microsoft +10 Solve
Binary Tree Right Side ViewViews Medium Trees & BST Meta, Oracle, ServiceNow +1 Solve
Left View of Binary TreeViews Easy Trees & BST Qualcomm Solve
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.