Can you maximize the value of items that fit into a knapsack with a limited weight capacity? This classic question is a great introduction to greedy algorithms.

Given a list of activities with start and end times, can you select the maximum number of non-overlapping activities? Time management is key to success!

How can you compress data with minimal loss of information? Huffman coding is a popular technique that uses greedy algorithms to encode text and images.

What's the shortest path between two nodes in a graph? Dijkstra's algorithm is a classic example of a greedy algorithm that solves this problem efficiently.

Given a set of coins and an amount, can you make change with the minimum number of coins? This question tests your ability to think creatively and optimize solutions.

Can you schedule jobs with deadlines and profits to maximize your earnings? Job sequencing is a classic problem that's great for testing your greedy algorithm skills.

Find the minimum cost spanning tree of a weighted graph with Kruskal's algorithm. This question requires you to think carefully about the graph structure & how to optimize its traversal.