LeetCode 5. Longest Palindromic Substring
Description https://leetcode.com/problems/longest-palindromic-substring/description/ Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.…
Category: LeetCode
LeetCode 11. Container With Most Water
Description https://leetcode.com/problems/container-with-most-water/ 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…
LeetCode 42. Trapping Rain Water
Description https://leetcode.com/problems/trapping-rain-water/description/ Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water…
LeetCode 90. Subsets II
Description Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The…
LeetCode 78. Subsets
Description https://leetcode.com/problems/subsets/ Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the…
LeetCode 21. Merge Two Sorted Lists
Description Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the…
LeetCode 6. ZigZag Conversion
Description https://leetcode.com/problems/zigzag-conversion/description/ The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want…
LeetCode 39. Combination Sum
Description https://leetcode.com/problems/combination-sum/ Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may…
LeetCode 40. Combination Sum II
Description Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate…
LeetCode 155. Min Stack
Description Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) — Push…