✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1.1\nTime complexity: O(nlog(n)). Space 
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1.1\nTime complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def numRescueBoats(self, p: List[int], l: int) -> int:\n        return reduce(lambda j,i:j-(i<j and p[i]+p[j]<=l),range(n:=len(p:=sorted(p)[::-1])),n-1)+1\n```\n\n# Code #1.2 - Unwrapped\n```\nclass Solution:\n    def numRescueBoats(self, p: List[int], l: int) -> int:\n        p = sorted(p)[::-1]\n        n = len(p)\n        j = n-1\n        for i in range(n):\n            j -= i < j and p[i]+p[j] <= l\n\n        return j+1\n```\n\n# Code #2\nTime complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def numRescueBoats(self, p: List[int], l: int) -> int:\n        return (j:=len(p:=sorted(p)[::-1])-1) and next(i for i in count() if i>j or (j:=j-(p[i]+p[j]<=l))*0)\n```\n\n(Disclaimer 2: all code above is just a product of fantasy, it is not claimed to be pure impeccable oneliners - please, remind about drawbacks only if you know how to make it better. PEP 8 is violated intentionally)
['Two Pointers', 'Greedy', 'Sorting', 'Python', 'Python3']