Solution: Boats to Save People
Understand how to solve the boat rescue problem by pairing the heaviest and lightest people efficiently. Learn to implement a greedy algorithm using sorting and two pointers to minimize the number of boats required while respecting weight limits.
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 ...