PhonePe Greedy Questions
14 greedy problems asked at PhonePe interviews
Medium (9)Hard (5)
Questions
| Title | Difficulty |
|---|---|
| Smallest Range Covering Elements from K Lists | Hard |
| Maximum Tastiness of Candy Basket | Medium |
| Remove K Digits | Medium |
| Frequency of the Most Frequent Element | Medium |
| Split Array Largest Sum | Hard |
| Candy | Hard |
| IPO | Hard |
| Jump Game II | Medium |
| Split Array into Consecutive Subsequences | Medium |
| Maximum Performance of a Team | Hard |
| Minimum Cost Tree From Leaf Values | Medium |
| Best Time to Buy and Sell Stock II | Medium |
| Gas Station | Medium |
| Jump Game | Medium |
Showing 14 questions