Groww
7 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2998. Minimum Number of Operations to Make X and Y Equal | Medium | 100% | TopicsDynamic ProgrammingBreadth-First SearchMemoization |
| 1799. Maximize Score After N Operations | Hard | 96.9% | TopicsArrayMathDynamic ProgrammingBacktrackingBit ManipulationNumber TheoryBitmask |
| 121. Best Time to Buy and Sell Stock | Easy | 83.8% | TopicsArrayDynamic Programming |
| 3026. Maximum Good Subarray Sum | Medium | 83.8% | TopicsArrayHash TablePrefix Sum |
| 1239. Maximum Length of a Concatenated String with Unique Characters | Medium | 77% | TopicsArrayStringBacktrackingBit Manipulation |
| Best Time to Buy and Sell Stock II | Medium | 67.5% | TopicsArrayDynamic ProgrammingGreedy |
| 1751. Maximum Number of Events That Can Be Attended II | Hard | 67.5% | TopicsArrayBinary SearchDynamic ProgrammingSorting |
