Nutanix Greedy Questions
10 greedy problems asked at Nutanix interviews
Easy (1)Medium (8)Hard (1)
Questions
| Title | Difficulty |
|---|---|
| Broken Calculator | Medium |
| Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium |
| Minimum Processing Time | Medium |
| Increasing Triplet Subsequence | Medium |
| Task Scheduler | Medium |
| Minimum Cost to Make All Characters Equal | Medium |
| Jump Game II | Medium |
| Split Array Largest Sum | Hard |
| Meeting Rooms II | Medium |
| Can Place Flowers | Easy |
Showing 10 questions