#Greedy

Minimize the array sum using repeated halving operations. Solved using a Max Heap where the largest element is repeatedly chosen and reduced.

Given a collection of intervals representing the vertical lines of balloons, determine the minimum number of arrows required to burst all the balloons. Use a greedy approach for your solution.

In the Mice and Cheese problem, you need to calculate the maximum amount of cheese that can be eaten by two mice given their starting points and the positions of the cheese. Formulate a plan and provide a solution algorithm to address this problem.

Solve the Gas Station problem where you need to determine the starting gas station's index from which you can travel around the circuit once without running out of gas. A circuit is represented as an array of gas stations with their respective gas amounts and an array of distances to the next station. Consider the constraints and provide a brief explanation of your approach.

Describe a medium level greedy problem that can be solved using a line sweep algorithm. Explain your thought process and the steps involved.