Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1099 with 12 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1099 # by problem number
lcpy gen -s two_sum_less_than_k # by problem name
nums of integers and integer k, return the maximum sum such that there exists i < j with nums[i] + nums[j] = sum and sum < k. If no i, j exist satisfying this equation, return -1.
Input: nums = [34,23,1,24,75,33,54,8], k = 60
Output: 58
Explanation: We can use 34 and 24 to sum 58 which is less than 60.
Input: nums = [10,20,30], k = 15
Output: -1
Explanation: In this case it is not possible to get a pair sum less that 15.
from bisect import bisect_left
class Solution:
# Time: O(n log n)
# Space: O(1)
def two_sum_less_than_k(self, nums: list[int], k: int) -> int:
nums.sort()
ans = -1
for i, x in enumerate(nums):
j = bisect_left(nums, k - x, lo=i + 1) - 1
if i < j:
ans = max(ans, x + nums[j])
return ans
| Time | Space |
|---|---|
| O(n log n) | O(1) |