{"id":19461459,"url":"https://github.com/b41sh/leetcode","last_synced_at":"2025-10-14T15:05:54.510Z","repository":{"id":84151006,"uuid":"132124839","full_name":"b41sh/leetcode","owner":"b41sh","description":"LeetCode Solutions","archived":false,"fork":false,"pushed_at":"2019-02-25T15:24:52.000Z","size":350,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-14T15:02:22.243Z","etag":null,"topics":["leetcode","leetcode-java"],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/b41sh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-05-04T10:17:49.000Z","updated_at":"2019-02-25T15:24:53.000Z","dependencies_parsed_at":null,"dependency_job_id":"d4d17841-faa6-4517-9e50-41459b9b7e6f","html_url":"https://github.com/b41sh/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/b41sh/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/b41sh%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/b41sh%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/b41sh%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/b41sh%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/b41sh","download_url":"https://codeload.github.com/b41sh/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/b41sh%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279019293,"owners_count":26086709,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["leetcode","leetcode-java"],"created_at":"2024-11-10T17:42:23.614Z","updated_at":"2025-10-14T15:05:54.482Z","avatar_url":"https://github.com/b41sh.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcode\nLeetCode Solutions\n\n\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n|888|[Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap)| [Java](./src/leetcode/array/FairCandySwap.java)|Easy|\n|886|[Possible Bipartition](https://leetcode.com/problems/possible-bipartition)| [Java](./src/leetcode/graph/PossibleBipartition.java)|Medium|\n|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)| [Java](./src/leetcode/tree/KthSmallestElementInAbst.java)|Medium|\n|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [Java](./src/leetcode/tree/InvertBinaryTree.java)|Easy|\n|223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)| [Java](./src/leetcode/math/RectangleArea.java)|Medium|\n|222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)| [Java](./src/leetcode/tree/CountCompleteTreeNodes.java)|Medium|\n|221|[Maximal Square](https://leetcode.com/problems/maximal-square)| [Java](./src/leetcode/dp/MaximalSquare.java)|Medium|\n|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Java](./src/leetcode/array/ContainsDuplicate.java)|Easy|\n|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)| [Java](./src/leetcode/array/KthLargestElementInAnArray.java)|Medium|\n|213|[House Robber II](https://leetcode.com/problems/house-robber-ii/)| [Java](./src/leetcode/dp/HouseRobber.java)|Medium|\n|211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/description/)| [Java](./src/leetcode/design/WordDictionary.java)|Medium|\n|208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)| [Java](./src/leetcode/design/Trie.java)|Medium|\n|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)| [Java](./src/leetcode/list/ReverseLinkedList.java)|Easy|\n|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Java](./src/leetcode/string/IsomorphicStrings.java)|Easy|\n|203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements)| [Java](./src/leetcode/list/RemoveLinkedListElements.java)|Easy|\n|202|[Happy Number](https://leetcode.com/problems/happy-number)| [Java](./src/leetcode/math/HappyNumber.java)|Easy|\n|201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)| [Java](./src/leetcode/bit/BitwiseAndOfNumbersRange.java)|Medium|\n|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)| [Java](./src/leetcode/tree/BinaryTreeRightSideView.java)|Medium|\n|198|[House Robber](https://leetcode.com/problems/house-robber/)| [Java](./src/leetcode/dp/HouseRobber.java)|Medium|\n|191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Java](./src/leetcode/bit/NumberOf1Bits.java)|Easy|\n|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [Java](./src/leetcode/bit/ReverseBits.java)|Easy|\n|189|[Rotate Array](https://leetcode.com/problems/rotate-array/)| [Java](./src/leetcode/array/RotateArray.java)|Easy|\n|187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)| [Java](./src/leetcode/bit/RepeatedDnaSequences.java)|Medium|\n|176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/)| [SQL](./src/leetcode/sql/SecondHighestSalary.sql)|Easy|\n|175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables)| [SQL](./src/leetcode/sql/CombineTwoTables.sql)|Easy|\n|173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)| [Java](./src/leetcode/design/BSTIterator.java)|Medium|\n|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes)| [Java](./src/leetcode/math/FactorialTrailingZeroes.java)|Easy|\n|171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number)| [Java](./src/leetcode/math/ExcelSheetColumnNumber.java)|Easy|\n|169|[Majority Element](https://leetcode.com/problems/majority-element)| [Java](./src/leetcode/math/MajorityElement.java)|Easy|\n|168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title)| [Java](./src/leetcode/math/ExcelSheetColumnTitle.java)|Easy|\n|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)| [Java](./src/leetcode/bs/TwoSumII.java)|Easy|\n|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)| [Java](./src/leetcode/string/CompareVersionNumbers.java)|Medium|\n|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element)| [Java](./src/leetcode/bs/FindPeakElement.java)|Medium|\n|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists)| [Java](./src/leetcode/list/IntersectionOfTwoLinkedLists.java)|Easy|\n|155|[Min Stack](https://leetcode.com/problems/min-stack/)| [Java](./src/leetcode/design/MinStack.java)|Easy|\n|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii)| [Java](./src/leetcode/bs/FindMinimumInRotatedSortedArray.java)|Hard|\n|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)| [Java](./src/leetcode/bs/FindMinimumInRotatedSortedArray.java)|Medium|\n|152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)| [Java](./src/leetcode/dp/MaximumProductSubarray.java)|Medium|\n|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string)| [Java](./src/leetcode/string/ReverseWordsInAString.java)|Medium|\n|150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)| [Java](./src/leetcode/stack/EvaluateReversePolishNotation.java)|Medium|\n|148|[Sort List](https://leetcode.com/problems/sort-list/)| [Java](./src/leetcode/list/SortList.java)|Medium|\n|147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Java](./src/leetcode/list/InsertionSortList.java)|Medium|\n|146|[LRU Cache](https://leetcode.com/problems/lru-cache/)| [Java](./src/leetcode/design/LRUCache.java)|Hard|\n|145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)| [Java](./src/leetcode/tree/BinaryTreePostorderTraversal.java)|Hard|\n|144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)| [Java](./src/leetcode/tree/BinaryTreePreorderTraversal.java)|Medium|\n|143|[Reorder List](https://leetcode.com/problems/reorder-list/)| [Java](./src/leetcode/list/ReorderList.java)|Medium|\n|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Java](./src/leetcode/list/LinkedListCycle.java)|Medium|\n|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Java](./src/leetcode/list/LinkedListCycle.java)|Easy|\n|138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer)| [Java](./src/leetcode/list/CopyListWithRandomPointer.java)|Medium|\n|137|[Single Number II](https://leetcode.com/problems/single-number-ii/)| [Java](./src/leetcode/bit/SingleNumber.java)|Medium|\n|136|[Single Number](https://leetcode.com/problems/single-number/)| [Java](./src/leetcode/bit/SingleNumber.java)|Easy|\n|135|[Candy](https://leetcode.com/problems/candy)| [Java](./src/leetcode/greedy/Candy.java)|Meidum|\n|134|[Gas Station](https://leetcode.com/problems/gas-station)| [Java](./src/leetcode/greedy/GasStation.java)|Meidum|\n|132|[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/)| [Java](./src/leetcode/dp/PalindromePartitioningII.java)|Hard|\n|131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| [Java](./src/leetcode/backtracking/PalindromePartitioning.java)|Medium|\n|129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)| [Java](./src/leetcode/tree/SumRootToLeafNumbers.java)|Medium|\n|127|[Word Ladder](https://leetcode.com/problems/word-ladder/)| [Java](./src/leetcode/bfs/WordLadder.java)|Medium|\n|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)| [Java](./src/leetcode/tp/ValidPalindrome.java)|Easy|\n|124|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)| [Java](./src/leetcode/tree/BinaryTreeMaximumPathSum.java)|Hard|\n|123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii)| [Java](./src/leetcode/dp/BestTimeToBuyAndSellStock.java)|Hard|\n|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)| [Java](./src/leetcode/dp/BestTimeToBuyAndSellStock.java)|Easy|\n|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)| [Java](./src/leetcode/dp/BestTimeToBuyAndSellStock.java)|Easy|\n|120|[Triangle](https://leetcode.com/problems/triangle)| [Java](./src/leetcode/dp/Triangle.java)|Medium|\n|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii)| [Java](./src/leetcode/array/PascalsTriangle.java)|Easy|\n|118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle)| [Java](./src/leetcode/array/PascalsTriangle.java)|Easy|\n|117|[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii)| [Java](./src/leetcode/tree/PopulatingNextRightPointersInEachNode.java)|Medium|\n|116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node)| [Java](./src/leetcode/tree/PopulatingNextRightPointersInEachNode.java)|Medium|\n|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)| [Java](./src/leetcode/tree/FlattenBinaryTreeToLinkedList.java)|Medium|\n|113|[Path Sum II](https://leetcode.com/problems/path-sum-ii)| [Java](./src/leetcode/tree/PathSum.java)|Medium|\n|112|[Path Sum](https://leetcode.com/problems/path-sum)| [Java](./src/leetcode/tree/PathSum.java)|Easy|\n|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)| [Java](./src/leetcode/tree/MinimumDepthOfBinaryTree.java)|Easy|\n|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)| [Java](./src/leetcode/tree/BalancedBinaryTree.java)|Easy|\n|109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree)| [Java](./src/leetcode/tree/ConvertSortedListToBinarySearchTree.java)|Medium|\n|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)| [Java](./src/leetcode/tree/ConvertSortedArrayToBinarySearchTree.java)|Easy|\n|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)| [Java](./src/leetcode/tree/BinaryTreeLevelOrderTraversal.java)|Easy|\n|106|[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal)| [Java](./src/leetcode/tree/ConstructBinaryTree.java)|Medium|\n|105|[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)| [Java](./src/leetcode/tree/ConstructBinaryTree.java)|Medium|\n|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)| [Java](./src/leetcode/tree/MaximumDepthOfBinaryTree.java)|Easy|\n|103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)| [Java](./src/leetcode/tree/BinaryTreeZigzagLevelOrderTraversal.java)|Medium|\n|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Java](./src/leetcode/tree/BinaryTreeLevelOrderTraversal.java)|Medium|\n|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Java](./src/leetcode/tree/SymmetricTree.java)|Easy|\n|100|[Same Tree](https://leetcode.com/problems/same-tree/)| [Java](./src/leetcode/tree/SameTree.java)|Easy|\n|99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree)| [Java](./src/leetcode/tree/RecoverBinarySearchTree.java)|Hard|\n|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)| [Java](./src/leetcode/tree/ValidateBinarySearchTree.java)|Medium|\n|97|[Interleaving String](https://leetcode.com/problems/interleaving-string/)| [Java](./src/leetcode/dp/InterleavingString.java)|Hard|\n|96|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)| [Java](./src/leetcode/tree/UniqueBinarySearchTrees.java)|Medium|\n|95|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii)| [Java](./src/leetcode/tree/UniqueBinarySearchTrees.java)|Medium|\n|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)| [Java](./src/leetcode/tree/BinaryTreeInorderTraversal.java)|Medium|\n|93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses)| [Java](./src/leetcode/backtracking/RestoreIPAddresses.java)|Medium|\n|92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii)| [Java](./src/leetcode/list/ReverseLinkedList.java)|Medium|\n|91|[Decode Ways](https://leetcode.com/problems/decode-ways)| [Java](./src/leetcode/dp/DecodeWays.java)|Medium|\n|90|[Subsets II](https://leetcode.com/problems/subsets-ii)| [Java](./src/leetcode/backtracking/Subsets.java)|Medium|\n|89|[Gray Code](https://leetcode.com/problems/gray-code/)| [Java](./src/leetcode/backtracking/GrayCode.java)|Medium|\n|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)| [Java](./src/leetcode/array/MergeSortedArray.java)|Easy|\n|87|[Scramble String](https://leetcode.com/problems/scramble-string)| [Java](./src/leetcode/dp/ScrambleString.java)|Hard|\n|86|[Partition List](https://leetcode.com/problems/partition-list)| [Java](./src/leetcode/list/PartitionList.java)|Medium|\n|85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle)| [Java](./src/leetcode/stack/MaximalRectangle.java)|Hard|\n|84|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)| [Java](./src/leetcode/stack/LargestRectangleInHistogram.java)|Hard|\n|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)| [Java](./src/leetcode/list/RemoveDuplicatesFromSortedList.java)|Easy|\n|82|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii)| [Java](./src/leetcode/list/RemoveDuplicatesFromSortedList.java)|Medium|\n|81|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii)| [Java](./src/leetcode/bs/SearchInRotatedSortedArray.java)|Medium|\n|80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)| [Java](./src/leetcode/tp/RemoveDuplicatesFromSortedArray.java)|Medium|\n|79|[Word Search](https://leetcode.com/problems/word-search/)| [Java](./src/leetcode/backtracking/WordSearch.java)|Medium|\n|78|[Subsets](https://leetcode.com/problems/subsets/)| [Java](./src/leetcode/backtracking/Subsets.java)|Medium|\n|77|[Combinations](https://leetcode.com/problems/combinations/)| [Java](./src/leetcode/backtracking/Combinations.java)|Medium|\n|76|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)| [Java](./src/leetcode/tp/MinimumWindowSubstring.java)|Hard|\n|75|[Sort Colors](https://leetcode.com/problems/sort-colors/)| [Java](./src/leetcode/tp/SortColors.java)|Medium|\n|74|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix)| [Java](./src/leetcode/bs/SearchA2DMatrix.java)|Medium|\n|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes)| [Java](./src/leetcode/array/SetMatrixZeroes.java)|Medium|\n|72|[Edit Distance](https://leetcode.com/problems/edit-distance/)| [Java](./src/leetcode/dp/EditDistance.java)|Hard|\n|71|[Simplify Path](https://leetcode.com/problems/simplify-path/)| [Java](./src/leetcode/SimplifyPath.java)|Medium|\n|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)| [Java](./src/leetcode/ClimbingStairs.java)|Easy|\n|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx)| [Java](./src/leetcode/Sqrtx.java)|Easy|\n|68|[Text Justification](https://leetcode.com/problems/text-justification)| [Java](./src/leetcode/TextJustification.java)|Hard|\n|67|[Add Binary](https://leetcode.com/problems/add-binary/)| [Java](./src/leetcode/AddBinary.java)|Easy|\n|66|[Plus One](https://leetcode.com/problems/plus-one/)| [Java](./src/leetcode/PlusOne.java)|Easy|\n|65|[Valid Number](https://leetcode.com/problems/valid-number)| [Java](./src/leetcode/ValidNumber.java)|Hard|\n|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)| [Java](./src/leetcode/UniquePaths.java)|Medium|\n|63|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| [Java](./src/leetcode/UniquePaths.java)|Medium|\n|62|[Unique Paths](https://leetcode.com/problems/unique-paths/)| [Java](./src/leetcode/UniquePaths.java)|Medium|\n|61|[Rotate List](https://leetcode.com/problems/rotate-list/)| [Java](./src/leetcode/RotateList.java)|Medium|\n|60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence)| [Java](./src/leetcode/PermutationSequence.java)|Medium|\n|59|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)| [Java](./src/leetcode/SpiralMatrix.java)|Medium|\n|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word)| [Java](./src/leetcode/LengthOfLastWord.java)|Medium|\n|57|[Insert Interval](https://leetcode.com/problems/insert-intervals)| [Java](./src/leetcode/Intervals.java)|Hard|\n|56|[Merge Intervals](https://leetcode.com/problems/merge-intervals)| [Java](./src/leetcode/Intervals.java)|Medium|\n|55|[Jump Game](https://leetcode.com/problems/jump-game)| [Java](./src/leetcode/JumpGame.java)|Medium|\n|54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix)| [Java](./src/leetcode/SpiralMatrix.java)|Medium|\n|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)| [Java](./src/leetcode/MaximumSubarray.java)|Easy|\n|52|[N-Queens II](https://leetcode.com/problems/n-queens-ii)| [Java](./src/leetcode/NQueens.java)|Hard|\n|51|[N-Queens](https://leetcode.com/problems/n-queens)| [Java](./src/leetcode/NQueens.java)|Hard|\n|50|[Pow(x, n)](https://leetcode.com/problems/powx-n)| [Java](./src/leetcode/Powx.java)|Medium|\n|49|[Group Anagrams](https://leetcode.com/problems/group-anagrams)| [Java](./src/leetcode/GroupAnagrams.java)|Medium|\n|48|[Rotate Image](https://leetcode.com/problems/rotate-image)| [Java](./src/leetcode/RotateImage.java)|Medium|\n|47|[Permutations II](https://leetcode.com/problems/permutations-ii)| [Java](./src/leetcode/Permutations.java)|Medium|\n|46|[Permutations](https://leetcode.com/problems/permutations)| [Java](./src/leetcode/Permutations.java)|Medium|\n|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii)| [Java](./src/leetcode/JumpGame.java)|Hard|\n|44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching)| [Java](./src/leetcode/dp/WildcardMatching.java)|Hard|\n|43|[Multiply Strings](https://leetcode.com/problems/multiply-strings)| [Java](./src/leetcode/MultiplyStrings.java)|Medium|\n|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)| [Java](./src/leetcode/TrappingRainWater.java)|Hard|\n|41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive)| [Java](./src/leetcode/FirstMissingPositive.java)|Hard|\n|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii)| [Java](./src/leetcode/CombinationSum.java)|Medium|\n|39|[Combination Sum](https://leetcode.com/problems/combination-sum)| [Java](./src/leetcode/CombinationSum.java)|Medium|\n|38|[Count and Say](https://leetcode.com/problems/count-and-say)| [Java](./src/leetcode/CountAndSay.java)|Easy|\n|37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver)| [Java](./src/leetcode/SudokuSolver.java)|Hard|\n|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku)| [Java](./src/leetcode/ValidSudoku.java)|Medium|\n|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position)| [Java](./src/leetcode/SearchInsertPosition.java)|Easy|\n|34|[Search for a Range](https://leetcode.com/problems/search-for-a-range)| [Java](./src/leetcode/SearchForARange.java)|Medium|\n|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Java](./src/leetcode/bs/SearchInRotatedSortedArray.java)|Medium|\n|32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| [Java](./src/leetcode/LongestValidParentheses.java)|Hard|\n|31|[Next Permutation](https://leetcode.com/problems/next-permutation/)| [Java](./src/leetcode/NextPermutation.java)|Medium|\n|30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)| [Java](./src/leetcode/SubstringWithConcatenationOfAllWords.java)|Hard|\n|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| [Java](./src/leetcode/DivideTwoIntegers.java)|Medium|\n|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Java](./src/leetcode/ImplementStrStr.java)|Easy|\n|27|[Remove Element](https://leetcode.com/problems/remove-element/)| [Java](./src/leetcode/RemoveElement.java)|Easy|\n|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [Java](./src/leetcode/tp/RemoveDuplicatesFromSortedArray.java)|Easy|\n|25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)|[Java](./src/leetcode/ReverseNodesInKgroup.java)|Hard|\n|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Java](./src/leetcode/SwapNodesInPairs.java)|Medium|\n|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Java](./src/leetcode/MergeKSortedLists.java)|Hard|\n|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [Java](./src/leetcode/GenerateParentheses.java)|Medium|\n|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Java](./src/leetcode/MergeTwoSortedLists.java)|Easy|\n|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Java](./src/leetcode/ValidParentheses.java)|Easy|\n|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Java](./src/leetcode/RemoveNthNodeFromEndOfList.java)|Medium|\n|18|[4Sum](https://leetcode.com/problems/4sum/)| [Java](./src/leetcode/FourSum.java)|Medium|\n|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Java](./src/leetcode/LetterCombinations.java)|Medium|\n|16|[3Sum Closest](https://leetcode.com/problems/3sum-closest)| [Java](./src/leetcode/ThreeSumClosest.java)|Medium|\n|15|[3Sum](https://leetcode.com/problems/3sum/)| [Java](./src/leetcode/ThreeSum.java)|Medium|\n|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [Java](./src/leetcode/LongestCommonPrefix.java)|Easy|\n|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [Java](./src/leetcode/RomanToInt.java)|Easy|\n|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [Java](./src/leetcode/IntegerToRoman.java)|Medium|\n|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Java](./src/leetcode/MaxArea.java)|Medium|\n|10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching)| [Java](./src/leetcode/dp/RegularExpressionMatching.java)|Hard|\n|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [Java](./src/leetcode/IsPalindrome.java)|Easy|\n|8|[String to Integer](https://leetcode.com/problems/string-to-integer-atoi/)| [Java](./src/leetcode/StringToInteger.java)|Medium|\n|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [Java](./src/leetcode/Reverse.java)|Easy|\n|6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [Java](./src/leetcode/ZigZagConversion.java)|Medium|\n|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Java](./src/leetcode/LongestPalindrome.java)|Medium|\n|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)| [Java](./src/leetcode/FindMedianSortedArrays.java)|Hard|\n|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Java](./src/leetcode/LengthOfLongestSubstring.java)|Medium|\n|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Java](./src/leetcode/AddTwoNumbers.java)|Medium|\n|1|[Two Sum](https://leetcode.com/problems/two-sum/)| [Java](./src/leetcode/TwoSum.java)|Medium|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fb41sh%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fb41sh%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fb41sh%2Fleetcode/lists"}