Solution: Boats to Save People
Explore the use of greedy algorithms to find the minimum number of boats required to rescue people under weight constraints. Learn sorting and two-pointer techniques to optimize solution 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 ...