Groww LeetCode Questions
5 questions all-time · 1 easy · 4 medium · 0 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Minimum Number of Operations to Make X and Y Equal Dynamic Programming, Breadth-First Search, Memoization | Medium | 100 | 0.5% |
| 2 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 80 | 0.6% |
| 3 | Maximum Good Subarray Sum Array, Hash Table, Prefix Sum | Medium | 74 | 0.2% |
| 4 | Container With Most Water Array, Two Pointers, Greedy | Medium | 65 | 0.6% |
| 5 | Maximum Length of a Concatenated String with Unique Characters Array, String, Backtracking, Bit Manipulation | Medium | 65 | 0.5% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.