## 3 Sums and 3 Sums Closest

Let's continue... Problem Statement: 3 Sums 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… Continue reading 3 Sums and 3 Sums Closest

## Container with Most Water and Longest Common Prefix

Problem Statement: Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the… Continue reading Container with Most Water and Longest Common Prefix

## Regular_Expression _Matching

Let me continue.... Problem Statement: Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). Note: s could be empty and contains only… Continue reading Regular_Expression _Matching

## ZigZag && ATOI

OK, Let's continue.... ZIGZAG Problem Statement: The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R And then read line… Continue reading ZigZag && ATOI

## Longest_Palindromic_ Sub_String

OK, Let's continue.... Problem Statement: Given a string s, find the longest palindromic sub string in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: "bab" Note: "aba" is also a valid answer. Example 2: Input: "cbbd" Output: "bb" Solution One: Brute Force Simple but not efficient.… Continue reading Longest_Palindromic_ Sub_String

## Median_of_Two_ Sorted_Arrays

Median of Two Sorted Arrays Problem Statement: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assume nums1 and nums2 cannot be both empty. Example 1: nums1 = [1, 3] nums2 =… Continue reading Median_of_Two_ Sorted_Arrays