thekarthikprasad

Data Structures and algorithms

Strings

Levels: Easy, Medium, Hard

Resources: neetcode

Roadmap: https://neetcode.io/roadmap

thekarthikprasad

---

Problem

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.

Notice that the solution set must not contain duplicate triplets.

---

Link: https://leetcode.com/problems/3sum/description/