Voozh

VOOZH

URL: https://www.geeksforgeeks.org/tag/3sum/

⇱ 3Sum Archives - GeeksforGeeks

Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Arrays4.2K+ articles

Amazon1.9K+ articles

Sorting1.1K+ articles

Searching1.0K+ articles

Hash831+ articles

Google398+ articles

two-pointer-algorithm213+ articles

2Sum8+ articles

3 Sum - Count Triplets With Given Sum In Sorted Array

Last Updated: 23 July 2025

Given a sorted arrayarr[]and a target value, the task is to find the count of triplets present in the given array having sum equal to the given target.More specifically, t...read more

two-pointer-algorithm

3 Sum - Count all triplets with given sum

Last Updated: 23 July 2025

Given an arrayarr[]and a target value, the task is to find the count of triplets present in the given array having sum equal to the given target.Examples:Input: arr[] = [0...read more

3Sum - Complete Tutorial

Last Updated: 23 July 2025

The 3-Sum problem is a classic algorithmic problem where the objective is to find all unique triplets in an array that sum up to a specific target value, usually zero. Thi...read more

two-pointer-algorithm

4 Sum - Count quadruplets with given sum in an array

Last Updated: 23 July 2025

Given an array arr[] and a target value, the task is to find the count of quadruplets present in the given array having sum equal to the given target.Examples:Input: arr[]...read more

interview-preparation

cpp-unordered_map

3 Sum - Find All Triplets with Zero Sum

Last Updated: 29 January 2026

Given an array arr[], the task is to find all possible indices {i, j, k} of triplet {arr[i], arr[j], arr[k]} such that their sum is equal to zero and all indices in a trip...read more

two-pointer-algorithm

4 Sum - All Distinct Quadruplets with given Sum in an Array

Last Updated: 13 August 2025

Given an array arr[], and an integer target, find all possible unique quadruplets in an array whose sum is equal to the given target value. We can return quadruplets in an...read more

two-pointer-algorithm

3 Sum - Triplet Sum in Array

Last Updated: 13 August 2025

Given an array arr[] and an integer sum, check if there is a triplet in the array which sums up to the given target sum.Examples:Input: arr[] = [1, 4, 45, 6, 10, 8], targe...read more

two-pointer-algorithm