Solution: Boats to Save People
Explore how to apply greedy techniques to optimize evacuation by pairing the heaviest and lightest individuals within a weight limit. Understand the approach using two pointers and sorting to efficiently determine the minimum number of boats required to rescue all people while analyzing time and space complexity.
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 ...