https://github.com/anishLearnsToCode/leetcode-algorithms
Solution to LeetCode 💻 Algorithms problems.
https://github.com/anishLearnsToCode/leetcode-algorithms
algorithms code data-structures data-structures-and-algorithms dsa java leetcode leetcode-algorithms programming python python3 solutions sql
Last synced: about 1 year ago
JSON representation
Solution to LeetCode 💻 Algorithms problems.
- Host: GitHub
- URL: https://github.com/anishLearnsToCode/leetcode-algorithms
- Owner: anishLearnsToCode
- License: mit
- Created: 2020-06-11T12:25:11.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2024-11-05T14:27:03.000Z (over 1 year ago)
- Last Synced: 2025-03-30T03:03:32.541Z (about 1 year ago)
- Topics: algorithms, code, data-structures, data-structures-and-algorithms, dsa, java, leetcode, leetcode-algorithms, programming, python, python3, solutions, sql
- Language: Java
- Homepage: https://leetcode.com/problemset/algorithms
- Size: 2.25 MB
- Stars: 90
- Watchers: 2
- Forks: 16
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
Awesome Lists containing this project
- python-workshop-wac-5 - solutions repository
- python-workshop-7 - solutions repository
- python-workshop-8 - solutions repository
README
# LeetCode Algorithms
[](CONTRIBUTING.md)
[](https://github.com/anishLearnsToCode/competitive-programming)
🔒 = Subscription Content
## Problems
| # | Name | Solution | Youtube |
|:----:|------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [](src/TwoSum.java) [](python/two_sum.py) | [](https://youtu.be/9wSL_7NN-A8) [](https://youtu.be/N5FXCTg0TDE) |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [](src/AddTwoNumbers.java) [](javascript/AddTwoNumbers.js) | |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [](src/LongestSubstringWithoutRepeatingCharacters.java) | |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [](src/LongestPalindromicSubstring.java) | |
| 6 | [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion) | [](src/ZigZagConversion.java) | |
| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [](src/ReverseInteger.java) [](python/reverse_integer.py) [](javascript/ReverseInteger.js) | [](https://youtu.be/7bOhyl5lWjI) [](https://youtu.be/lmLG30TLcSg) |
| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [](src/StringToIntegerAtoi.java) | |
| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [](src/PalindromeNumber.java) [](python/palindrome_number.py) [](javascript/PalindromeNumber.js) | |
| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [](src/ContainerWitMostWater.java) | |
| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [](src/IntegerToRoman.java) | |
| 13 | [Roman To Integer](https://leetcode.com/problems/roman-to-integer/) | [](src/RomanToInteger.java) [](python/roman_to_integer.py) | [](https://youtu.be/BCue_mO_81A) [](https://youtu.be/8h_yGTNvKMA) |
| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [](src/LongestCommonPrefix.java) [](python/longest_common_prefix.py) | |
| 15 | [3Sum](https://leetcode.com/problems/3sum) | [](src/ThreeSum.java) | |
| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [](src/ThreeSumClosest.java) | |
| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [](src/LetterCombinationsOfAPhoneNumber.java) | |
| 18 | [4Sum](https://leetcode.com/problems/4sum) | [](src/FourSum.java) | |
| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [](src/RemoveNthNodeFromEndOfList.java) | |
| 20 | [ValidParentheses](https://leetcode.com/problems/valid-parentheses/) | [](src/ValidParentheses.java) [](python/valid_parentheses.py) | |
| 21 | [Merge 2 Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [](src/Merge2SortedLists.java) [](python/merge_2_sorted_lists.py) | |
| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [](src/GenerateParentheses.java) | |
| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [](src/SwapNodesInPairs.java) | |
| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [](src/ReverseNodesInKGroup.java) | |
| 26 | [Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [](src/RemoveDuplicatesFromSortedArray.java) [](python/remove_duplicates_from_sorted_array.py) [](javascript/RemoveDuplicatesFromSortedArray.js) | |
| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [](src/RemoveElement.java) [](python/remove_element.py) | |
| 28 | [Needle in Haystack](https://leetcode.com/problems/implement-strstr) | [](src/NeedleInHaystack.java) [](python/needle_in_haystack.py) | |
| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [](src/DivideTwoIntegers.java) | |
| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [](src/SubstringWithConcatenationOfAllWords.java) | |
| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [](src/NextPermutation.java) | |
| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [](src/SearchInRotatedSortedArray.java) | |
| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [](src/FindFirstAndLastPositionOfElementInSortedArray.java) | |
| 35 | [Search Inserted Position](https://leetcode.com/problems/search-insert-position/) | [](src/SearchInsertPosition.java) [](python/search_insert_position.py) | |
| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [](src/ValidSudoku.java) | |
| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [](src/SudokuSolver.java) | |
| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [](src/CountAndSay.java) [](python/count_and_say.py) | |
| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [](src/CombinationSum.java) | |
| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [](src/CombinationSumII.java) | |
| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [](src/FirstMissingPositive.java) | |
| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [](src/TrappingRainwater.java) | |
| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [](src/MultiplyStrings.java) | |
| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [](src/JumpGameII.java) | |
| 46 | [Permutations](https://leetcode.com/problems/permutations) | [](src/Permutations.java) | |
| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [](src/PermutationsII.java) | |
| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [](src/RotateImage.java) | |
| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [](src/GroupAnagrams.java) | |
| 50 | [Pow(x,n)](https://leetcode.com/problems/powx-n) | [](src/Powxn.java) | |
| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [](src/NQueens.java) | |
| 51 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [](src/NQueensII.java) | |
| 53 | [Maximum SubArray](https://leetcode.com/problems/maximum-subarray) | [](src/MaximumSubArray.java) [](python/maximum_sum_subarray.py) | |
| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [](src/SpiralMatrix.java) | |
| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [](src/JumpGame.java) | |
| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [](src/MergeIntervals.java) | |
| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [](src/InsertInterval.java) | |
| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [](src/LengthOfLastWord.java) [](python/length_of_last_word.py) | |
| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [](src/SpiralMatrixII.java) | |
| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [](src/RotateList.java) | |
| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [](src/UniquePaths.java) | |
| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [](src/UniquePathII.java) | |
| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [](src/MinimumPathSum.java) [](python/minimum_path_sum.py) | |
| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [](src/PlusOne.java) [](python/plus_one.py) | |
| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [](src/AddBinary.java) [](python/add_binary.py) | |
| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [](src/AddBinary.java) | |
| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [](src/Sqrtx.java) [](python/sqrt.py) | |
| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [](src/ClimbingStairs.java) [](python/climbing_stairs.py) | |
| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [](src/SimplifyPath.java) | |
| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [](src/EditDistance.java) | |
| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [](src/SetMatrixZeroes.java) | |
| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [](src/SearchA2DMatrix.java) | |
| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [](src/SortColors.java) | |
| 77 | [Combinations](https://leetcode.com/problems/combinations) | [](src/Combinations.java) | |
| 78 | [Subsets](https://leetcode.com/problems/subsets) | [](src/Subsets.java) | |
| 79 | [Word Search](https://leetcode.com/problems/word-search) | [](src/WordSearch.java) | |
| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [](src/RemoveDuplicatesFromSortedArrayII.java) | |
| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [](src/SearchInRotatedSortedArrayII.java) | |
| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [](src/RemoveDuplicatesFromSortedListII.java) | |
| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [](src/RemoveDuplicatesFromSortedList.java) [](python/remove_duplicates_from_linked_list.py) | |
| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [](src/PartitionList.java) | |
| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [](python/scramble_strings.py) | |
| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [](src/MergeSortedArray.java) [](python/merge_sorted_array.py) | |
| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [](src/GrayCode.java) | |
| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [](src/SubsetsII.java) | |
| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [](src/DecodeWays.java) | |
| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [](src/ReverseLinkedListII.java) | |
| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [](src/RestoreIPAddresses.java) | |
| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [](src/BinaryTreeInorderTraversal.java) [](python/binary_tree_inorder_traversal.py) | |
| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [](src/UniqueBinarySearchTreesII.java) | |
| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [](src/UniqueBinarySearchTrees.java) | |
| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [](src/InterleavingString.java) | |
| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [](src/ValidateBinarySearchTree.java) | |
| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [](src/RecoverBinarySearchTree.java) | |
| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [](src/SameTree.java) [](python/same_tree.py) | |
| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [](src/SymmetricTree.java) [](python/symmetric_tree.py) | |
| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [](src/BinaryTreeLevelOrderTraversal.java) | |
| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [](src/BinaryTreeZigzagLevelOrderTraversal.java) | |
| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [](src/MaximumDepthOfBinaryTree.java) [](python/maximum_depth_of_binary_tree.py) | |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [](src/ConstructBinaryTreeFromPreorderAndInorderTraversal.java) | |
| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [](src/ConstructBinaryTreeFromInorderAndPostorderTraversal.java) | |
| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [](src/BinaryTreeLevelOrderTraversalII.java) [](python/binary_tree_level_order_traversal_ii.py) | |
| 108 | [Convert Sorted Array To Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [](src/ConvertSortedArrayToBinarySearchTree.java) [](python/converted_sorted_array_to_binary_search_tree.py) | |
| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [](src/ConvertSortedListToBinarySearchTree.java) | |
| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [](src/BalancedBinaryTree.java) [](python/balanced_binary_tree.py) | |
| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [](src/MinimumDepthOfBinaryTree.java) [](python/minimum_depth_of_binary_tree.py) | |
| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [](src/PathSum.java) [](python/path_sum.py) | |
| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [](src/PathSumII.java) | |
| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [](src/FlattenBinaryTreeToLinkedList.java) | |
| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [](src/PopulatingNextRightPointersInEachNode.java) | |
| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [](src/PopulatingNextRightPointersInEachNodeII.java) | |
| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [](src/PascalsTriangle.java) [](python/pascals_triangle.py) | |
| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [](src/PascalsTriangleII.java) [](python/pascals_triangle_ii.py) | |
| 120 | [Triangle](https://leetcode.com/problems/triangle) | [](src/Triangle.java) | |
| 121 | [Best Time to Buy and Sell Stocks](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [](src/BestTimeToBuyAndSellStock.java) [](python/best_time_to_buy_and_sell_stock.py) | |
| 122 | [Best Time to Buy and Sell Stocks II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [](src/BestTimeToBuyAndSellStockII.java) [](python/best_time_to_buy_and_sell_stock_ii.py) | |
| 123 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [](src/BinaryTreeMaximumPathSum.java) | |
| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [](src/ValidPalindrome.java) [](python/valid_palindrome.py) | |
| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [](src/WordLadder.java) | |
| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [](src/LongestConsecutiveSequence.java) | |
| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [](src/SumRootToLeafNumbers.java) | |
| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [](src/SurroundedRegions.java) | |
| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [](src/PalindromePartitioning.java) | |
| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [](src/CloneGraph.java) [](python/clone_graph.py) | |
| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [](src/GasStation.java) | |
| 135 | [Candy](https://leetcode.com/problems/candy) | [](src/Candy.java) | |
| 136 | [Single Number](https://leetcode.com/problems/single-number) | [](src/SingleNumber.java) [](python/single_number.py) | |
| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [](src/SingleNumberII.java) | |
| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [](src/CopyListWithRandomPointer.java) | |
| 139 | [Word Break](https://leetcode.com/problems/word-break) | [](src/WordBreak.java) | |
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [](src/LinkedListCycle.java) [](python/linked_list_cycle.py) | |
| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [](src/LinkedListCycleII.java) | |
| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [](src/ReorderList.java) | |
| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [](src/BinaryTreePreOrderTraversal.java) [](python/binary_tree_preorder_traversal.py) | |
| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [](src/BinaryTreePostorderTraversal.java) [](python/binary_tree_postorder_traversal.py) | |
| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [](src/LRUCache.java) | |
| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [](src/InsertionSortList.java) | |
| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [](src/SortList.java) | |
| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [](src/EvaluateReversePolishNotation.java) | |
| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [](src/ReverseWordsInAString.java) | |
| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [](src/MaximumProductSubarray.java) | |
| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [](src/FindMinimumInRotatedSortedArray.java) | |
| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [](src/MinStack.java) [](python/min_stack.py) | |
| 156 | 🔒 [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | | |
| 157 | 🔒 [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | [](src/ReadNCharactersGivenRead4java) | |
| 159 | 🔒 [Longest Substring With At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) | | |
| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [](src/IntersectionOf2LinkedLists.java) [](python/intersecction_of_two_linked_lists.py) | |
| 161 | 🔒 [One Edit Distance](https://leetcode.com/problems/one-edit-distance) | | |
| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [](src/FindPeakElement.java) | |
| 163 | [Missing Ranges](https://leetcode.com/problems/missing-ranges) | [](src/MissingRanges.java) | |
| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | | |
| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [](src/CompareVersionNumbers.java) | |
| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [](src/FractionToRecurringDecimal.java) | |
| 167 | [Two Sum II - Input Array is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [](src/TwoSumIIInputArrayIsSorted.java) [](python/two_sum_ii.py) | |
| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [](src/ExcelSheetColumnTitle.java) [](python/excel_sheet_column_title.py) | |
| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [](src/MajorityElement.java) [](python/majority_element.py) | |
| 170 | 🔒 [Two Sum III - Data Structure Design](https://leetcode.com/problems/two-sum-iii-data-structure-design) | [](src/TwoSumIIIDataStructureDesign.java) | |
| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [](src/ExcelSheetColumnNumber.java) [](python/excel_sheet_column_number.py) | |
| 172 | [Factoring Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [](src/FactorialTrailingZeros.java) [](python/factorial_trailing_zeroes.py) | |
| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [](src/BinarySearchTreeIterator.java) | |
| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [](src/LargestNumber.java) | |
| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [](src/RepeatedDNASequences.java) | |
| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [](src/RotateArray.java) [](python/rotate_array.py) | |
| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [](src/ReverseBits.java) [](python/reverse_bits.py) | |
| 191 | [Number of One Bits](https://leetcode.com/problems/number-of-1-bits) | [](src/NumberOf1Bit.java) [](python/number_of_1_bits.py) | |
| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [](src/HouseRobber.java) [](python/house_robber.py) | |
| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [](src/BinaryTreeRightSideView.java) | |
| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [](src/NumberOfIslands.java) [](python/number_of_islands.py) | |
| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [](src/BitwiseANDOfNumbersRange.java) | |
| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [](src/HappyNumber.java) [](python/happy_number.py) | |
| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [](src/RemoveLinkedListElements.java) [](python/remove_linked_list_elements.py) | |
| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [](src/CountPrimes.java) [](python/count_primes.py) | |
| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [](src/IsomorphicStrings.java) [](python/isomorphic_strings.py) | |
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [](src/ReverseLinkedList.java) [](python/reverse_linked_list.py) | |
| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [](src/CourseSchedule.java) | |
| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [](src/Trie.java) [](python/trie.py) | |
| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [](src/MinimumSizeSubarraySum.java) | |
| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [](src/CourseScheduleII.java) | |
| 211 | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | [](src/DesignAddAndSearchWordsDataStructure.java) [](python/design_add_and_search_words_data_structure.py) | |
| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [](src/HouseRobberII.java) | |
| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [](src/KthLargestElementInAnArray.java) | |
| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [](src/CombinationSumIII.java) | |
| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [](src/ContainsDuplicate.java) [](python/contains_duplicate.py) | |
| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [](python/the_skyline_problem.py) | |
| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [](src/ContainsDuplicateII.java) [](python/contains_duplicate_ii.py) | |
| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [](src/ContainsDuplicateIII.java) | |
| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [](src/MaximalSquare.java) | |
| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [](src/CountCompleteTreeNodes.java) | |
| 2