Solution: Boats to Save People
Explore how to apply a greedy algorithm by pairing the lightest and heaviest individuals to minimize the number of boats needed for evacuation. Learn to implement two-pointer technique, analyze time and space complexity, and understand why this approach optimally solves the 'Boats to Save People' problem.
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 ...