Tag: threesum
-
Data Structures and Algorithms in Java – Arrays – Three sum
Problem: Given an array of integers , find out triplets in the array such that their sum is 0. Constraints: There should not be any duplicates. Same number should not be added to itself. Assumptions: The array contains a minimum of 3 elements and maximum 3000 elements Numbers can vary from -100000 to 100000 Input:…