GitHub - bgsky/leetcode: leetcode for java and python

001 Two Sum Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/001. Two Sum/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/001. Two Sum/Solution.py) [JavaScript](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/001. Two Sum/Solution.js) no 002 Add Two Numbers Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/002. Add Two Numbers/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/002. Add Two Numbers/Solution.py) [JavaScript](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/002. Add Two Numbers/Solution.js) no 003 Longest Substring Without Repeating Characters Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/003. Longest Substring Without Repeating Characters/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/003. Longest Substring Without Repeating Characters/Solution.py) no no 004 Median of Two Sorted Arrays Hard noNote no no no no 005 Longest Palindromic Substring Medium noNote no no no no 006 ZigZag Conversion Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/006. ZigZag Conversion/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/006. ZigZag Conversion/Solution.py) no no 007 Reverse Integer Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/007. Reverse Integer/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/007. Reverse Integer/Solution.py) no no 008 String to Integer (atoi) Easy noNote no no no no 009 Palindrome Number Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/009. Palindrome Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/009. Palindrome Number/Solution.py) no no 010 Regular Expression Matching Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/010. Regular Expression Matching/Solution.java) no no no 011 Container With Most Water Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/011. Container With Most Water/Solution.java) no no no 012 Integer to Roman Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/012. Integer to Roman/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/012. Integer to Roman/Solution.py) no no 013 Roman to Integer Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/013. Roman to Integer/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/013. Roman to Integer/Solution.py) no no 014 Longest Common Prefix Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/014. Longest Common Prefix/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/014. Longest Common Prefix/Solution.py) no no 015 3Sum Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/015. 3Sum/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/015. 3Sum/Solution.py) [JavaScript](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/015. 3Sum/Solution.js) no 016 3Sum Closest Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/016. 3Sum Closest/Solution.java) no no no 017 Letter Combinations of a Phone Number Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/017. Letter Combinations of a Phone Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/017. Letter Combinations of a Phone Number/Solution.py) no no 018 4Sum Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/018. 4Sum/Solution.java) no no no 019 Remove Nth Node From End of List Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/019. Remove Nth Node From End of List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/019. Remove Nth Node From End of List/Solution.py) no no 020 Valid Parentheses Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/020. Valid Parentheses/Solution.java) no no no 021 Merge Two Sorted Lists Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/021. Merge Two Sorted Lists/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/021. Merge Two Sorted Lists/Solution.py) no no 022 Generate Parentheses Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/022. Generate Parentheses/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/022. Generate Parentheses/Solution.py) no no 023 Merge k Sorted Lists Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/023. Merge k Sorted Lists/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/023. Merge k Sorted Lists/Solution.py) no no 024 Swap Nodes in Pairs Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/024. Swap Nodes in Pairs/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/024. Swap Nodes in Pairs/Solution.py) no no 025 Reverse Nodes in k-Group Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/025. Reverse Nodes in k-Group/Solution.java) no no no 026 Remove Duplicates from Sorted Array Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/026. Remove Duplicates from Sorted Array/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/026. Remove Duplicates from Sorted Array/Solution.py) no no 027 Remove Element Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/027. Remove Element/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/027. Remove Element/Solution.py) no no 028 Implement strStr() Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/028. Implement strStr()/Solution.java) no no no 029 Divide Two Integers Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/029. Divide Two Integers/Solution.java) no no no 030 Substring with Concatenation of All Words Hard noNote no no no no 031 Next Permutation Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/031. Next Permutation/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/031. Next Permutation/Solution.py) no no 032 Longest Valid Parentheses Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/032. Longest Valid Parentheses/Solution.java) no no no 033 Search in Rotated Sorted Array Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/033. Search in Rotated Sorted Array/Solution.java) no no no 034 Search for a Range Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/034. Search for a Range/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/034. Search for a Range/Solution.py) no no 035 Search Insert Position Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/035. Search Insert Position/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/035. Search Insert Position/Solution.py) no no 036 Valid Sudoku Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/036. Valid Sudoku/Solution.java) no no no 037 Sudoku Solver Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/037. Sudoku Solver/Solution.java) no no no 038 Count and Say Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/038. Count and Say/Solution.java) no no no 039 Combination Sum Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/039. Combination Sum/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/039. Combination Sum/Solution.py) no no 040 Combination Sum II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/040. Combination Sum II/Solution.java) no no no 041 First Missing Positive Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/041. First Missing Positive/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/041. First Missing Positive/Solution.py) no no 042 Trapping Rain Water Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/042. Trapping Rain Water/Solution.java) no no no 043 Multiply Strings Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/043. Multiply Strings/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/043. Multiply Strings/Solution.py) no no 044 Wildcard Matching Hard noNote no no no no 045 Jump Game II Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/045. Jump Game II/Solution.java) no no no 046 Permutations Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/046. Permutations/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/046. Permutations/Solution.py) no no 047 Permutations II Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/047. Permutations II/Solution.py) no no 048 Rotate Image Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/048. Rotate Image/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/048. Rotate Image/Solution.py) no no 049 Group Anagrams Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/049. Group Anagrams/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/049. Group Anagrams/Solution.py) no no 050 Pow(x, n) Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/050. Pow(x, n)/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/050. Pow(x, n)/Solution.py) no no 051 N-Queens Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/051. N-Queens/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/051. N-Queens/Solution.py) no no 052 N-Queens II Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/052. N-Queens II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/052. N-Queens II/Solution.py) no no 053 Maximum Subarray Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/053. Maximum Subarray/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/053. Maximum Subarray/Solution.py) no no 054 Spiral Matrix Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/054. Spiral Matrix/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/054. Spiral Matrix/Solution.py) no no 055 Jump Game Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/055. Jump Game/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/055. Jump Game/Solution.py) [JavaScript](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/055. Jump Game/Solution.js) no 056 Merge Intervals Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/056. Merge Intervals/Solution.java) no no no 057 Insert Interval Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/057. Insert Interval/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/057. Insert Interval/Solution.py) no no 058 Length of Last Word Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/058. Length of Last Word/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/058. Length of Last Word/Solution.py) no no 059 Spiral Matrix II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/059. Spiral Matrix II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/059. Spiral Matrix II/Solution.py) no no 060 Permutation Sequence Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/060. Permutation Sequence/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/060. Permutation Sequence/Solution.py) no no 061 Rotate List Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/061. Rotate List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/061. Rotate List/Solution.py) no no 062 Unique Paths Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/062. Unique Paths/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/062. Unique Paths/Solution.py) no no 063 Unique Paths II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/063. Unique Paths II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/063. Unique Paths II/Solution.py) no no 064 Minimum Path Sum Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/064. Minimum Path Sum/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/064. Minimum Path Sum/Solution.py) no no 065 Valid Number Hard noNote no no no no 066 Plus One Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/066. Plus One/Solution.java) no no no 067 Add Binary Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/067. Add Binary/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/067. Add Binary/Solution.py) no no 068 Text Justification Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/068. Text Justification/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/068. Text Justification/Solution.py) no no 069 Sqrt(x) Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/069. Sqrt(x)/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/069. Sqrt(x)/Solution.py) no no 070 Climbing Stairs Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/070. Climbing Stairs/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/070. Climbing Stairs/Solution.py) no no 071 Simplify Path Medium noNote no no no no 072 Edit Distance Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/072. Edit Distance/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/072. Edit Distance/Solution.py) no no 073 Set Matrix Zeroes Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/073. Set Matrix Zeroes/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/073. Set Matrix Zeroes/Solution.py) no no 074 Search a 2D Matrix Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/074. Search a 2D Matrix/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/074. Search a 2D Matrix/Solution.py) no no 075 Sort Colors Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/075. Sort Colors/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/075. Sort Colors/Solution.py) no no 076 Minimum Window Substring Hard noNote no no no no 077 Combinations Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/077. Combinations/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/077. Combinations/Solution.py) no no 078 Subsets Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/078. Subsets/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/078. Subsets/Solution.py) no no 079 Word Search Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/079. Word Search/Solution.java) no no no 080 Remove Duplicates from Sorted Array II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/080. Remove Duplicates from Sorted Array II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/080. Remove Duplicates from Sorted Array II/Solution.py) no no 081 Search in Rotated Sorted Array II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/081. Search in Rotated Sorted Array II/Solution.java) no no no 082 Remove Duplicates from Sorted List II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/082. Remove Duplicates from Sorted List II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/082. Remove Duplicates from Sorted List II/Solution.py) no no 083 Remove Duplicates from Sorted List Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/083. Remove Duplicates from Sorted List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/083. Remove Duplicates from Sorted List/Solution.py) no no 084 Largest Rectangle in Histogram Hard noNote no no no no 085 Maximal Rectangle Hard noNote no no no no 086 Partition List Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/086. Partition List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/086. Partition List/Solution.py) no no 087 Scramble String Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/087. Scramble String/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/087. Scramble String/Solution.py) no no 088 Merge Sorted Array Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/088. Merge Sorted Array/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/088. Merge Sorted Array/Solution.py) no no 089 Gray Code Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/089. Gray Code/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/089. Gray Code/Solution.py) no no 090 Subsets II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/090. Subsets II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/090. Subsets II/Solution.py) no no 091 Decode Ways Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/091. Decode Ways/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/091. Decode Ways/Solution.py) no no 092 Reverse Linked List II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/092. Reverse Linked List II/Solution.java) no no no 093 Restore IP Addresses Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/093. Restore IP Addresses/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/093. Restore IP Addresses/Solution.py) no no 094 Binary Tree Inorder Traversal Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/094. Binary Tree Inorder Traversal/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/094. Binary Tree Inorder Traversal/Solution.py) no no 095 Unique Binary Search Trees II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/095. Unique Binary Search Trees II/Solution.java) no no no 096 Unique Binary Search Trees Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/096. Unique Binary Search Trees/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/096. Unique Binary Search Trees/Solution.py) no no 097 Interleaving String Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/097. Interleaving String/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/097. Interleaving String/Solution.py) no no 098 Validate Binary Search Tree Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/098. Validate Binary Search Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/098. Validate Binary Search Tree/Solution.py) no no 099 Recover Binary Search Tree Hard noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/099. Recover Binary Search Tree/Solution.py) no no 100 Same Tree Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/100. Same Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/100. Same Tree/Solution.py) no no 101 Symmetric Tree Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/101. Symmetric Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/101. Symmetric Tree/Solution.py) no no 102 Binary Tree Level Order Traversal Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/102. Binary Tree Level Order Traversal/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/102. Binary Tree Level Order Traversal/Solution.py) no no 103 Binary Tree Zigzag Level Order Traversal Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/103. Binary Tree Zigzag Level Order Traversal/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/103. Binary Tree Zigzag Level Order Traversal/Solution.py) no no 104 Maximum Depth of Binary Tree Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/104. Maximum Depth of Binary Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/104. Maximum Depth of Binary Tree/Solution.py) no no 105 Construct Binary Tree from Preorder and Inorder Traversal Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.py) no no 106 Construct Binary Tree from Inorder and Postorder Traversal Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.py) no no 107 Binary Tree Level Order Traversal II Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/107. Binary Tree Level Order Traversal II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/107. Binary Tree Level Order Traversal II/Solution.py) no no 108 Convert Sorted Array to Binary Search Tree Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/108. Convert Sorted Array to Binary Search Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/108. Convert Sorted Array to Binary Search Tree/Solution.py) no no 109 Convert Sorted List to Binary Search Tree Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/109. Convert Sorted List to Binary Search Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/109. Convert Sorted List to Binary Search Tree/Solution.py) no no 110 Balanced Binary Tree Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/110. Balanced Binary Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/110. Balanced Binary Tree/Solution.py) no no 111 Minimum Depth of Binary Tree Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/111. Minimum Depth of Binary Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/111. Minimum Depth of Binary Tree/Solution.py) no no 112 Path Sum Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/112. Path Sum/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/112. Path Sum/Solution.py) no no 113 Path Sum II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/113. Path Sum II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/113. Path Sum II/Solution.py) no no 114 Flatten Binary Tree to Linked List Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/114. Flatten Binary Tree to Linked List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/114. Flatten Binary Tree to Linked List/Solution.py) no no 115 Distinct Subsequences Hard noNote no no no no 116 Populating Next Right Pointers in Each Node Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/116. Populating Next Right Pointers in Each Node/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/116. Populating Next Right Pointers in Each Node/Solution.py) no no 117 Populating Next Right Pointers in Each Node II Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/117. Populating Next Right Pointers in Each Node II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/117. Populating Next Right Pointers in Each Node II/Solution.py) no no 118 Pascal's Triangle Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/118. Pascal's Triangle/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/118. Pascal's Triangle/Solution.py) no no 119 Pascal's Triangle II Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/119. Pascal's Triangle II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/119. Pascal's Triangle II/Solution.py) no no 120 Triangle Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/120. Triangle/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/120. Triangle/Solution.py) no no 121 Best Time to Buy and Sell Stock Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/121. Best Time to Buy and Sell Stock/Solution.java) no no no 122 Best Time to Buy and Sell Stock II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/122. Best Time to Buy and Sell Stock II/Solution.java) no no no 123 Best Time to Buy and Sell Stock III Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/123. Best Time to Buy and Sell Stock III/Solution.java) no no no 124 Binary Tree Maximum Path Sum Hard noNote no no no no 125 Valid Palindrome Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/125. Valid Palindrome/Solution.java) no no no 126 Word Ladder II Hard noNote no no no no 127 Word Ladder Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/127. Word Ladder/Solution.java) no no no 128 Longest Consecutive Sequence Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/128. Longest Consecutive Sequence/Solution.java) no no no 129 Sum Root to Leaf Numbers Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/129. Sum Root to Leaf Numbers/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/129. Sum Root to Leaf Numbers/Solution.py) no no 130 Surrounded Regions Medium noNote no no no no 131 Palindrome Partitioning Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/131. Palindrome Partitioning/Solution.java) no no no 132 Palindrome Partitioning II Hard noNote no no no no 133 Clone Graph Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/133. Clone Graph/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/133. Clone Graph/Solution.py) no no 134 Gas Station Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/134. Gas Station/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/134. Gas Station/Solution.py) no no 135 Candy Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/135. Candy/Solution.java) no no no 136 Single Number Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/136. Single Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/136. Single Number/Solution.py) no no 137 Single Number II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/137. Single Number II/Solution.java) no no no 138 Copy List with Random Pointer Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/138. Copy List with Random Pointer/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/138. Copy List with Random Pointer/Solution.py) no no 139 Word Break Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/139. Word Break/Solution.java) no no no 140 Word Break II Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/140. Word Break II/Solution.java) no no no 141 Linked List Cycle Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/141. Linked List Cycle/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/141. Linked List Cycle/Solution.py) no no 142 Linked List Cycle II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/142. Linked List Cycle II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/142. Linked List Cycle II/Solution.py) no no 143 Reorder List Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/143. Reorder List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/143. Reorder List/Solution.py) no no 144 Binary Tree Preorder Traversal Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/144. Binary Tree Preorder Traversal/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/144. Binary Tree Preorder Traversal/Solution.py) no no 145 Binary Tree Postorder Traversal Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/145. Binary Tree Postorder Traversal/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/145. Binary Tree Postorder Traversal/Solution.py) no no 146 LRU Cache Hard noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/146. LRU Cache/Solution.py) no no 147 Insertion Sort List Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/147. Insertion Sort List/Solution.java) no no no 148 Sort List Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/148. Sort List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/148. Sort List/Solution.py) no no 149 Max Points on a Line Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/149. Max Points on a Line/Solution.java) no no no 150 Evaluate Reverse Polish Notation Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/150. Evaluate Reverse Polish Notation/Solution.java) no no no 151 Reverse Words in a String Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/151. Reverse Words in a String/Solution.java) no no no 152 Maximum Product Subarray Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/152. Maximum Product Subarray/Solution.java) no no no 153 Find Minimum in Rotated Sorted Array Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/153. Find Minimum in Rotated Sorted Array/Solution.java) no no no 154 Find Minimum in Rotated Sorted Array II Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/154. Find Minimum in Rotated Sorted Array II/Solution.java) no no no 155 Min Stack Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/155. Min Stack/Solution.java) no no no 156 Binary Tree Upside Down Medium noBuy noBuy noBuy noBuy noBuy 157 Read N Characters Given Read4 Easy noBuy noBuy noBuy noBuy noBuy 158 Read N Characters Given Read4 II - Call multiple times Hard noBuy noBuy noBuy noBuy noBuy 159 Longest Substring with At Most Two Distinct Characters Hard noBuy noBuy noBuy noBuy noBuy 160 Intersection of Two Linked Lists Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/160. Intersection of Two Linked Lists/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/160. Intersection of Two Linked Lists/Solution.py) no no 161 One Edit Distance Medium noBuy noBuy noBuy noBuy noBuy 162 Find Peak Element Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/162. Find Peak Element/Solution.java) no no no 163 Missing Ranges Medium noBuy noBuy noBuy noBuy noBuy 164 Maximum Gap Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/164. Maximum Gap/Solution.java) no no no 165 Compare Version Numbers Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/165. Compare Version Numbers/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/165. Compare Version Numbers/Solution.py) no no 166 Fraction to Recurring Decimal Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/166. Fraction to Recurring Decimal/Solution.java) no no no 167 Two Sum II - Input array is sorted Medium noBuy noBuy noBuy noBuy noBuy 168 Excel Sheet Column Title Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/168. Excel Sheet Column Title/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/168. Excel Sheet Column Title/Solution.py) no no 169 Majority Element Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/169. Majority Element/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/169. Majority Element/Solution.py) no no 170 Two Sum III - Data structure design Easy noBuy noBuy noBuy noBuy noBuy 171 Excel Sheet Column Number Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/171. Excel Sheet Column Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/171. Excel Sheet Column Number/Solution.py) no no 172 Factorial Trailing Zeroes Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/172. Factorial Trailing Zeroes/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/172. Factorial Trailing Zeroes/Solution.py) no no 173 Binary Search Tree Iterator Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/173. Binary Search Tree Iterator/Solution.java) no no no 174 Dungeon Game Hard noNote no no no no 179 Largest Number Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/179. Largest Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/179. Largest Number/Solution.py) no no 186 Reverse Words in a String II Medium noBuy noBuy noBuy noBuy noBuy 187 Repeated DNA Sequences Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/187. Repeated DNA Sequences/Solution.java) no no no 188 Best Time to Buy and Sell Stock IV Hard noNote no no no no 189 Rotate Array Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/189. Rotate Array/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/189. Rotate Array/Solution.py) no no 190 Reverse Bits Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/190. Reverse Bits/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/190. Reverse Bits/Solution.py) no no 191 Number of 1 Bits Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/191. Number of 1 Bits/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/191. Number of 1 Bits/Solution.py) no no 198 House Robber Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/198. House Robber/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/198. House Robber/Solution.py) no no 199 Binary Tree Right Side View Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/199. Binary Tree Right Side View/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/199. Binary Tree Right Side View/Solution.py) no no 200 Number of Islands Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/200. Number of Islands/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/200. Number of Islands/Solution.py) no no 201 Bitwise AND of Numbers Range Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/201. Bitwise AND of Numbers Range/Solution.java) no no no 202 Happy Number Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/202. Happy Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/202. Happy Number/Solution.py) no no 203 Remove Linked List Elements Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/203. Remove Linked List Elements/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/203. Remove Linked List Elements/Solution.py) no no 204 Count Primes Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/204. Count Primes/Solution.java) no no no 205 Isomorphic Strings Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/205. Isomorphic Strings/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/205. Isomorphic Strings/Solution.py) no no 206 Reverse Linked List Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/206. Reverse Linked List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/206. Reverse Linked List/Solution.py) no no 207 Course Schedule Medium noNote no no no no 208 Implement Trie (Prefix Tree) Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/208. Implement Trie (Prefix Tree)/Solution.java) no no no 209 Minimum Size Subarray Sum Medium noNote no no no no 210 Course Schedule II Medium noNote no no no no 211 Add and Search Word - Data structure design Medium noNote no no no no 212 Word Search II Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/212. Word Search II/Solution.java) no no no 213 House Robber II Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/213. House Robber II/Solution.py) no no 214 Shortest Palindrome Hard noNote no no no no 215 Kth Largest Element in an Array Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/215. Kth Largest Element in an Array/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/215. Kth Largest Element in an Array/Solution.py) no no 216 Combination Sum III Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/216. Combination Sum III/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/216. Combination Sum III/Solution.py) no no 217 Contains Duplicate Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/217. Contains Duplicate/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/217. Contains Duplicate/Solution.py) no no 218 The Skyline Problem Hard noNote no no no no 219 Contains Duplicate II Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/219. Contains Duplicate II/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/219. Contains Duplicate II/Solution.py) no no 220 Contains Duplicate III Medium noNote no no no no 221 Maximal Square Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/221. Maximal Square/Solution.java) no no no 222 Count Complete Tree Nodes Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/222. Count Complete Tree Nodes/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/222. Count Complete Tree Nodes/Solution.py) no no 223 Rectangle Area Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/223. Rectangle Area/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/223. Rectangle Area/Solution.py) no no 224 Basic Calculator Hard noNote no no no no 225 Implement Stack using Queues Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/225. Implement Stack using Queues/Solution.java) no no no 226 Invert Binary Tree Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/226. Invert Binary Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/226. Invert Binary Tree/Solution.py) no no 227 Basic Calculator II Medium noNote no no no no 228 Summary Ranges Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/228. Summary Ranges/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/228. Summary Ranges/Solution.py) no no 229 Majority Element II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/229. Majority Element II/Solution.java) no no no 230 Kth Smallest Element in a BST Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/230. Kth Smallest Element in a BST/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/230. Kth Smallest Element in a BST/Solution.py) no no 231 Power of Two Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/231. Power of Two/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/231. Power of Two/Solution.py) no no 232 Implement Queue using Stacks Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/232. Implement Queue using Stacks/Solution.java) no no no 233 Number of Digit One Hard noNote no no no no 234 Palindrome Linked List Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/234. Palindrome Linked List/Solution.java) no no no 235 Lowest Common Ancestor of a Binary Search Tree Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/235. Lowest Common Ancestor of a Binary Search Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/235. Lowest Common Ancestor of a Binary Search Tree/Solution.py) no no 236 Lowest Common Ancestor of a Binary Tree Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/236. Lowest Common Ancestor of a Binary Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/236. Lowest Common Ancestor of a Binary Tree/Solution.py) no no 237 Delete Node in a Linked List Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/237. Delete Node in a Linked List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/237. Delete Node in a Linked List/Solution.py) no no 238 Product of Array Except Self Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/238. Product of Array Except Self/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/238. Product of Array Except Self/Solution.py) no no 239 Sliding Window Maximum Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/239. Sliding Window Maximum/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/239. Sliding Window Maximum/Solution.py) no no 240 Search a 2D Matrix II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/240. Search a 2D Matrix II/Solution.java) no no no 241 Different Ways to Add Parentheses Medium noNote no no no no 242 Valid Anagram Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/242. Valid Anagram/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/242. Valid Anagram/Solution.py) no no 243 Shortest Word Distance Easy noBuy noBuy noBuy noBuy noBuy 244 Shortest Word Distance II Medium noBuy noBuy noBuy noBuy noBuy 245 Shortest Word Distance III Medium noBuy noBuy noBuy noBuy noBuy 246 Strobogrammatic Number Easy noBuy noBuy noBuy noBuy noBuy 247 Strobogrammatic Number II Medium noBuy noBuy noBuy noBuy noBuy 248 Strobogrammatic Number III Hard noBuy noBuy noBuy noBuy noBuy 249 Group Shifted Strings Easy noBuy noBuy noBuy noBuy noBuy 250 Count Univalue Subtrees Medium noBuy noBuy noBuy noBuy noBuy 251 Flatten 2D Vector Medium noBuy noBuy noBuy noBuy noBuy 252 Meeting Rooms Easy noBuy noBuy noBuy noBuy noBuy 253 Meeting Rooms II Medium noBuy noBuy noBuy noBuy noBuy 254 Factor Combinations Medium noBuy noBuy noBuy noBuy noBuy 255 Verify Preorder Sequence in Binary Search Tree Medium noBuy noBuy noBuy noBuy noBuy 256 Paint House Medium noBuy noBuy noBuy noBuy noBuy 257 Binary Tree Paths Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/257. Binary Tree Paths/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/257. Binary Tree Paths/Solution.py) no no 258 Add Digits Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/258. Add Digits/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/258. Add Digits/Solution.py) no no 259 3Sum Smaller Medium noBuy noBuy noBuy noBuy noBuy 260 Single Number III Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/260. Single Number III/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/260. Single Number III/Solution.py) no no 261 Graph Valid Tree Medium noBuy noBuy noBuy noBuy noBuy 263 Ugly Number Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/263. Ugly Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/263. Ugly Number/Solution.py) no no 264 Ugly Number II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/264. Ugly Number II/Solution.java) no no no 265 Paint House II Hard noBuy noBuy noBuy noBuy noBuy 266 Palindrome Permutation Easy noBuy noBuy noBuy noBuy noBuy 267 Palindrome Permutation II Medium noBuy noBuy noBuy noBuy noBuy 268 Missing Number Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/268. Missing Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/268. Missing Number/Solution.py) no no 269 Alien Dictionary Hard noBuy noBuy noBuy noBuy noBuy 270 Closest Binary Search Tree Value Easy noBuy noBuy noBuy noBuy noBuy 271 Encode and Decode Strings Medium noBuy noBuy noBuy noBuy noBuy 272 Closest Binary Search Tree Value II Hard noBuy noBuy noBuy noBuy noBuy 273 Integer to English Words Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/273. Integer to English Words/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/273. Integer to English Words/Solution.py) no no 274 H-Index Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/274. H-Index/Solution.java) no no no 275 H-Index II Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/275. H-Index II/Solution.java) no no no 276 Paint Fence Easy noBuy noBuy noBuy noBuy noBuy 277 Find the Celebrity Medium noBuy noBuy noBuy noBuy noBuy 278 First Bad Version Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/278. First Bad Version/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/278. First Bad Version/Solution.py) no no 279 Perfect Squares Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/279. Perfect Squares/Solution.java) no no no 280 Wiggle Sort Medium noBuy noBuy noBuy noBuy noBuy 281 Zigzag Iterator Medium noBuy noBuy noBuy noBuy noBuy 282 Expression Add Operators Hard noNote no no no no 283 Move Zeroes Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/283. Move Zeroes/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/283. Move Zeroes/Solution.py) no no 284 Peeking Iterator Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/284. Peeking Iterator/Solution.java) no no no 285 Inorder Successor in BST Medium noBuy noBuy noBuy noBuy noBuy 286 Walls and Gates Medium noBuy noBuy noBuy noBuy noBuy 287 Find the Duplicate Number Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/287. Find the Duplicate Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/287. Find the Duplicate Number/Solution.py) no no 288 Unique Word Abbreviation Easy noBuy noBuy noBuy noBuy noBuy 289 Game of Life Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/289. Game of Life/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/289. Game of Life/Solution.py) no no 290 Word Pattern Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/290. Word Pattern/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/290. Word Pattern/Solution.py) no no 291 Word Pattern II Hard noBuy noBuy noBuy noBuy noBuy 292 Nim Game Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/292. Nim Game/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/292. Nim Game/Solution.py) no no 293 Flip Game Easy noBuy noBuy noBuy noBuy noBuy 294 Flip Game II Medium noBuy noBuy noBuy noBuy noBuy 295 Find Median from Data Stream Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/295. Find Median from Data Stream/Solution.java) no no no 296 Best Meeting Point Hard noBuy noBuy noBuy noBuy noBuy 297 Serialize and Deserialize Binary Tree Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/297. Serialize and Deserialize Binary Tree/Solution.java) no no no 298 Binary Tree Longest Consecutive Sequence Medium noBuy noBuy noBuy noBuy noBuy 299 Bulls and Cows Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/299. Bulls and Cows/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/299. Bulls and Cows/Solution.py) no no 300 Longest Increasing Subsequence Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/300. Longest Increasing Subsequence/Solution.java) no no no 301 Remove Invalid Parentheses Hard noNote no no no no 302 Smallest Rectangle Enclosing Black Pixels Hard noBuy noBuy noBuy noBuy noBuy 303 Range Sum Query - Immutable Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/303. Range Sum Query - Immutable/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/303. Range Sum Query - Immutable/Solution.py) no no 304 Range Sum Query 2D - Immutable Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/304. Range Sum Query 2D - Immutable/Solution.py) no no 305 Number of Islands II Hard noBuy noBuy noBuy noBuy noBuy 306 Additive Number Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/306. Additive Number/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/306. Additive Number/Solution.py) no no 307 Range Sum Query - Mutable Medium noNote no no no no 308 Range Sum Query 2D - Mutable Hard noBuy noBuy noBuy noBuy noBuy 309 Best Time to Buy and Sell Stock with Cooldown Medium noNote no no no no 310 Minimum Height Trees Medium noNote no no no no 311 Sparse Matrix Multiplication Medium noBuy noBuy noBuy noBuy noBuy 312 Burst Balloons Hard noNote no no no no 313 Super Ugly Number Medium noNote no no no no 314 Binary Tree Vertical Order Traversal Medium noBuy noBuy noBuy noBuy noBuy 315 Count of Smaller Numbers After Self Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/315. Count of Smaller Numbers After Self/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/315. Count of Smaller Numbers After Self/Solution.py) no no 316 Remove Duplicate Letters Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/316. Remove Duplicate Letters/Solution.java) no no no 317 Shortest Distance from All Buildings Hard noBuy noBuy noBuy noBuy noBuy 318 Maximum Product of Word Lengths Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/318. Maximum Product of Word Lengths/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/318. Maximum Product of Word Lengths/Solution.py) no no 319 Bulb Switcher Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/319. Bulb Switcher/Solution.py) no no 320 Generalized Abbreviation Medium noBuy noBuy noBuy noBuy noBuy 321 Create Maximum Number Hard noNote no no no no 322 Coin Change Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/322. Coin Change/Solution.java) no no no 323 Number of Connected Components in an Undirected Graph Medium noBuy noBuy noBuy noBuy noBuy 324 Wiggle Sort II Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/324. Wiggle Sort II/Solution.py) no no 325 Maximum Size Subarray Sum Equals k Easy noBuy noBuy noBuy noBuy noBuy 326 Power of Three Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/326. Power of Three/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/326. Power of Three/Solution.py) no no 327 Count of Range Sum Hard noNote no no no no 328 Odd Even Linked List Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/328. Odd Even Linked List/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/328. Odd Even Linked List/Solution.py) no no 329 Longest Increasing Path in a Matrix Hard noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/329. Longest Increasing Path in a Matrix/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/329. Longest Increasing Path in a Matrix/Solution.py) no no 330 Patching Array Medium noNote no no no no 331 Verify Preorder Serialization of a Binary Tree Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/331. Verify Preorder Serialization of a Binary Tree/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/331. Verify Preorder Serialization of a Binary Tree/Solution.py) no no 332 Reconstruct Itinerary Medium noNote no no no no 333 Largest BST Subtree Medium noBuy noBuy noBuy noBuy noBuy 334 Increasing Triplet Subsequence Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/334. Increasing Triplet Subsequence/Solution.py) no no 335 Self Crossing Hard noNote no no no no 336 Palindrome Pairs Hard noNote no no no no 337 House Robber III Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/337. House Robber III/Solution.py) no no 338 Counting Bits Medium noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/338. Counting Bits/Solution.py) no no 339 Nested List Weight Sum Easy noBuy noBuy noBuy noBuy noBuy 340 Longest Substring with At Most K Distinct Characters Hard noBuy noBuy noBuy noBuy noBuy 341 Flatten Nested List Iterator Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/341. Flatten Nested List Iterator/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/341. Flatten Nested List Iterator/Solution.py) no no 342 Power of Four Easy noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/342. Power of Four/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/342. Power of Four/Solution.py) no no 343 Integer Break Medium noNote [Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/343. Integer Break/Solution.java) [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/343. Integer Break/Solution.py) no no 344 Reverse String Easy noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/344. Reverse String/Solution.py) no no 345 Reverse Vowels of a String Easy noNote no [Python](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/345. Reverse Vowels of a String/Solution.py) no no