NeetCode #217LC-259MediumTwo Pointers
← Back to All Problems#217 · #259 · 3Sum Smaller(较小的三数之和)
📌 Problem Statement & Constraints
Given an array of integers
nums and an integer target, return the number of index triplets i < j < k such that nums[i] + nums[j] + nums[k] < target. Constraints: 0 <= nums.length <= 3500, -100 <= nums[i] <= 100, -100 <= target <= 100.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!