Sync LeetCode submission Runtime - 3 ms (46.65%), Memory - 17.8 MB (50.89%)

Author: jimit105

1083-two-sum-less-than-k/solution.py

@@ -1,21 +1,20 @@
-# Approach 2 - Two Pointers
+# Approach 2: Two Pointers
 
 # Time: O(n log n)
 
 class Solution:
     def twoSumLessThanK(self, nums: List[int], k: int) -> int:
         nums.sort()
-        
-        result = -1
+        answer = -1
         left, right = 0, len(nums) - 1
-        
+
         while left < right:
             total = nums[left] + nums[right]
             if total < k:
-                result = max(result, total)
+                answer = max(answer, total)
                 left += 1
             else:
                 right -= 1
-                
-        return result
+
+        return answer