[New Problem] 3Sum #203
Description
📝 New Problem Idea
Problem Title:
3Sum
Brief Statement:
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
- Simple/Beginner
- Medium/Logic
- Hard/Optimized
Topic of this Problem
- Array
- Sorting
- Two Pointers