Solution: Boats to Save People
Understand how to apply a greedy algorithm to minimize the number of boats needed to save people with weight limits. Learn to implement sorting and two-pointer techniques to pair passengers optimally, improving time and space efficiency.
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 ...