These are the greedy and interval problems that appear again and again in placement tests. For each one, say the rule in one sentence, look for a counterexample, then write the code and its cost.
0 /20 solved Easy 0/7 Medium 0/8 Hard 0/5
All Unsolved 20 Solved 0
Any level Easy Medium Hard
1. Fewest notes for a payment Easy 2. Students and laptops Easy 3. Can one person attend every meeting? Easy 4. Most non-overlapping bookings Easy 5. Can you reach the last cell? Easy 6. Best single trade Easy 7. Largest sum after k sign flips Easy 8. Merge overlapping bookings Medium 9. Insert a booking into a calendar Medium 10. Meeting rooms needed Medium 11. Fewest jumps to the end Medium 12. Start of the delivery loop Medium 13. Jobs with deadlines for the most profit Medium 14. Cancel the fewest bookings Medium 15. Fewest arrows for the balloons Medium 16. Smallest number after removing k digits Hard 17. Most events attended Hard 18. Fair reward points Hard 19. Shortest schedule with cooldown Hard 20. Fewest refuel stops Hard 