Problem statement Given an array nums of n integers, are there elements a , b , c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. Example : Given array nums = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ] this problem is medium but I think it is much harder especially with the condition of non duplicate, I'll write two solutions
LeetCode Problem #11 Container With Most Water Given n non-negative integers a 1 , a 2 , ..., a n , where each represents a point at coordinate ( i , a i ). n vertical lines are drawn such that the two endpoints of line i is at ( i , a i ) and ( i , 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. Note: You may not slant the container and n is at least 2. The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49. Problem Link Solution Number One O(n^2) Brute Force : Try all valid combinations outer loop start from i = 0 to length of array inner loop start from j = i+1 to length of array compare current area with new area and choose max. return max area. Solution Number Two O(n) : Linear Solution greedy algorithm: calculating area it is rectangle width = rightIndex - leftIndex height = min (height[ rightIndex]