Solution: Boats to Save People
Explore how to use a greedy algorithm to solve the problem of evacuating people with boats having weight limits. Learn to pair the heaviest and lightest individuals to minimize the number of boats and understand the time and space efficiency of this approach.
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 ...