Solution: Boats to Save People
Explore how to apply a greedy algorithm to pair the lightest and heaviest people effectively to minimize boats needed. Understand sorting and two-pointer techniques to solve this optimization problem with time and space complexity in mind.
Statement
A big ship with numerous passengers is sinking, and there is a need to evacuate these people with the minimum number of life-saving boats. Each boat can carry, at most, two persons however, the weight of the people cannot exceed the carrying weight limit of the boat.
We are given an array, people, where people[i] is the weight of the ...