Day-3
Leetcode Coding Journey: Mastering Problem-Solving Techniques
Leetcode #16 3 Sum Closest
📌 Problem Statement
Given an array of integers nums and a target integer target, find three integers in nums such that the sum is closest to target.
Constraints:
Each number in nums can be used only once in a triplet.
Th...
compscigrad.hashnode.dev1 min read