LeetCode

LeetCode Problems (https://leetcode.com/)

• [x] 0001 Two Sum
• [x] 0002 Add Two Numbers
• [x] 0003 Longest Substring Without Repeating Characters
• [x] 0004 Median of Two Sorted Arrays
• [x] 0005 Longest Palindromic Substring
• [x] 0006 ZigZag Conversion
• [x] 0009 Palindrome Number
• [x] 0011 Container With Most Water
• [x] 0012 Integer to Roman
• [x] 0013 Roman to Integer
• [x] 0014 Longest Common Prefix
• [x] 0017 Letter Combination of a Phone Number
• [x] 0019 Remove Nth Node From End of List
• [x] 0020 Valid Parentheses
• [x] 0021 Merge Two Sorted Lists
• [x] 0022 Generate Parentheses
• [x] 0023 Merge k Sorted Lists
• [x] 0024 Swap Nodes in Pairs
• [x] 0026 Remove Duplicates from Sorted Array
• [x] 0027 Remove Element
• [x] 0029 Divide Two Integers
• [x] 0031 Next Permutation
• [x] 0033 Search in Rotated Sorted Array
• [x] 0034 Find First and Last Position of Element in Sorted Array
• [x] 0035 Search Insert Position
• [x] 0038 Count and Say
• [x] 0039 Combination Sum
• [x] 0046 Permutations
• [x] 0048 Rotate Image
• [x] 0049 Group Anagrams
• [x] 0053 Maximum Subarray
• [x] 0055 Jump Game
• [x] 0056 Merge Intervals
• [x] 0066 Plus One
• [x] 0067 Add Binary
• [x] 0069 Sqrt(x)
• [x] 0070 Climbing Stairs
• [x] 0072 Edit Distance
• [x] 0074 Search a 2D Matrix
• [x] 0075 Sort Colors
• [x] 0078 Subsets
• [x] 0079 Word Search
• [x] 0088 Merge Sorted Array
• [x] 0091 Decode Ways
• [x] 0094 Binary Tree Inorder Traversal
• [x] 0100 Same Tree
• [x] 0102 Binary Tree Level Order Traversal
• [x] 0107 Binary Tree Level Order Traversal II
• [x] 0118 Pascal's Triangle
• [x] 0121 Best Time to Buy and Sell Stock
• [x] 0122 Best Time to Buy and Sell Stock II
• [x] 0125 Valid Palindrome
• [x] 0131 Palindrome Positioning
• [x] 0136 Single Number
• [x] 0138 Copy List with Random Pointer
• [x] 0141 Linked List Cycle
• [x] 0143 Reorder List
• [x] 0144 Binary Tree Preorder Traversal
• [x] 0145 Binary Tree Postorder Traverlsal
• [x] 0151 Reverse Words in a String
• [x] 0152 Maximum Product Subarray
• [x] 0153 Find Minimum in Rotated Sorted Array
• [x] 0155 Min Stack
• [x] 0160 Intersection of Two Linked Lists
• [x] 0169 Majority Element
• [x] 0172 Factorial Trailing Zeroes
• [x] 0189 Rotate Array
• [x] 0191 Number of 1 Bits
• [x] 0198 House Robber
• [x] 0202 Happy Number
• [x] 0203 Remove Linked List Elements
• [x] 0204 Count Primes
• [x] 0205 Isomorphic Strings
• [x] 0206 Reverse Linked List
• [x] 0208 Implement Trie (Prefix Tree)
• [x] 0217 Contains Duplicate
• [x] 0219 Contains Duplicate II
• [x] 0225 Implement Stack using Queues
• [x] 0226 Invert Binary Tree
• [x] 0227 Basic Calculator II
• [x] 0230 Kth Smallest Element in a BST
• [x] 0231 Power of Two
• [x] 0232 Implement Queue using Stacks
• [x] 0234 Palindrome Linked List
• [x] 0237 Delete Node in a Linked List
• [x] 0238 Product of Array Except Self
• [x] 0242 Valid Anagram
• [x] 0258 Add Digits
• [x] 0268 Missing Number
• [x] 0278 First Bad Version
• [x] 0283 Move Zeroes
• [x] 0287 Find the Duplicate Number
• [x] 0292 Nim Game
• [x] 0322 Coin Change
• [x] 0328 Odd Even Linked List
• [x] 0344 Reverse String
• [x] 0345 Reverse Vowels of a String
• [x] 0347 Top K Frequent Elements
• [x] 0349 Intersection of Two Arrays
• [x] 0350 Intersection of Two Arrays II
• [x] 0367 Valid Perfect Square
• [x] 0371 Sum of Two Integers
• [x] 0373 Find K Pairs with Smallers Sums
• [x] 0383 Ransom Note
• [x] 0385 Mini Parser
• [x] 0387 First Unique Character in a String
• [x] 0392 Is Subsequence
• [x] 0402 Remove K Digits
• [x] 0412 Fizz Buzz
• [x] 0443 String Compression
• [x] 0448 Find All Numbers Disappeared in an Array
• [x] 0451 Sort Characters By Frequency
• [x] 0463 Island Perimeter
• [x] 0476 Number Complement
• [x] 0496 Next Greater Element I
• [x] 0500 Keyboard Row
• [x] 0503 Next Greater Element II
• [x] 0525 Contiguous Array
• [x] 0540 Single Element in a Sorted Array
• [x] 0543 Diameter of Binary Tree
• [x] 0557 Reverse Words in a String III
• [x] 0560 Subarray Sum Equals K
• [x] 0605 Can Place Flowers
• [x] 0617 Merge Two Binary Trees
• [x] 0657 Robot Return to Origin
• [x] 0665 Non Decreasing Array
• [x] 0674 Longest Continuous Increasing Subsequence
• [x] 0678 Valid Parenthesis String
• [x] 0692 Top K Frequent Words
• [x] 0700 Search in a Binary Search Tree
• [x] 0704 Binary Search
• [x] 0705 Design Hash Set
• [x] 0707 Design Linked List
• [x] 0709 To Lower Case
• [x] [0724 Find Pivot Index](0724- Find-Pivot-Index.py)
• [x] 0733 Flood Fill
• [x] 0739 Daily Temperatures
• [x] 0771 Jewels and Stones
• [x] 0844 Backspace String Compare
• [x] 0849 Maximize Distance to Closest Person
• [x] 0852 Peak Index in a Mountain Array
• [x] 0856 Score of Parentheses
• [x] 0872 Leaf-Similar Trees
• [x] 0876 Middle of the Linked List
• [x] 0881 Boats to Save People
• [x] 0890 Find and Replace Pattern
• [x] 0929 Unique Email Addresses
• [x] 0941 Valid Mountain Array
• [x] 0961 N-Repeated Element in Size 2N Array
• [x] 0981 Time Based Key-Value Store
• [x] 0993 Cousins in Binary Tree
• [x] 0997 Find the Town Judge
• [x] 1014 Best Sightseeing Pair
• [x] 1021 Remove Outermost Parentheses
• [x] 1029 Two City Scheduling
• [x] 1046 Last Stone Weight
• [x] 1047 Remove All Adjacent Duplicates In String
• [x] 1051 Height Checker
• [x] 1108 Defanging an IP Address
• [x] 1137 N-th Tribonacci Number
• [x] 1160 Find Words That Can Be Formed by Characters
• [x] 1189 Maximum Number of Balloons
• [x] 1207 Unique Number of Occurrences
• [x] 1281 Subtract the Product and Sum of Digits of an Integer
• [x] 1317 Convert Integer to the Sum of Two No-Zero Integers
• [x] 1356 Sort Integers by The Number of 1 Bits
• [x] 1360 Number of Days Between Two Dates
• [x] 1362 Closest Divisors
• [x] 1366 Rank Team by Votes
• [x] 1370 Increasing Decreasing String
• [x] 1374 Generate a String With Characters That Have Odd Counts
• [x] 1380 Lucky Numbers in a Matrix
• [x] 1399 Count Largest Group
• [x] 1400 Construct K Palindrome Strings
• [x] 1401 Circle and Rectangle Overlapping
• [x] 1426 Counting Elements
• [x] 1427 Perform String Shifts
• [x] 1431 Kids With the Greatest Number of Candies
• [x] 1432 Max Difference You Can Get From Changing an Integer
• [x] 1433 Check If a String Can Break Another String
• [x] 1480 Running Sum of 1d Array
• [x] 1991 Find the Middle Index in Array