{"id":20208023,"url":"https://github.com/java-aid/leetcodesolutions","last_synced_at":"2025-04-10T12:53:53.543Z","repository":{"id":113439910,"uuid":"116512758","full_name":"Java-aid/LeetCodeSolutions","owner":"Java-aid","description":"This repository contains leetcode problem solutions","archived":false,"fork":false,"pushed_at":"2018-06-17T19:44:15.000Z","size":62,"stargazers_count":75,"open_issues_count":0,"forks_count":64,"subscribers_count":12,"default_branch":"master","last_synced_at":"2025-03-24T11:38:43.545Z","etag":null,"topics":["arrays","easy","github","hard","java","java-aid","javaaid","kanahaiya","kanhaiya","leetcode-java","leetcode-practice","leetcode-solutions","medium","solutions","trees"],"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/Java-aid.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-01-06T20:18:26.000Z","updated_at":"2025-02-28T12:43:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"8cdb748e-a30a-46e7-b3cf-d825a20d0475","html_url":"https://github.com/Java-aid/LeetCodeSolutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Java-aid%2FLeetCodeSolutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Java-aid%2FLeetCodeSolutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Java-aid%2FLeetCodeSolutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Java-aid%2FLeetCodeSolutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Java-aid","download_url":"https://codeload.github.com/Java-aid/LeetCodeSolutions/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248221143,"owners_count":21067474,"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","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":["arrays","easy","github","hard","java","java-aid","javaaid","kanahaiya","kanhaiya","leetcode-java","leetcode-practice","leetcode-solutions","medium","solutions","trees"],"created_at":"2024-11-14T05:33:48.686Z","updated_at":"2025-04-10T12:53:53.536Z","avatar_url":"https://github.com/Java-aid.png","language":"Java","readme":"\u003cp align=\"center\"\u003e\n    \u003ca href=\"https://leetcode.com/kanhaiya/\"\u003e\n        \u003cimg height=85 src=\"https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/src/main/resources/imgs/leetcode.png\"\u003e\n    \u003c/a\u003e\n    \u003cbr\u003eThis repository contains LeetCode problems solutions\n\u003c/p\u003e\n\n\n\n\nCoding environment used- Windows 8.1, Eclipse Oxygen, JAVA 8\n\n\n\n# LeetCodeSolutions\n\n|    #    |   \t\tTags  \t\t|                                                                        Title                                                                          \t\t\t\t\t\t\t\t\t|                                                                                                           Solution                                                                                                                                                        |  Difficulty    |\n|:-------:|:-------------------:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:--------------:|\n|    1    |  \t  Array  \t\t| [Two Sum](https://leetcode.com/problems/two-sum/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/TwoSum.java)                                           \t                  \t  \t \t\t\t\t\t    |   Easy\t\t |\n|   747   |  \t  Array  \t\t| [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/description)                          \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/LargestNumberAtLeastTwiceofOthers.java)                                           \t                  \t    |   Easy\t\t |\n|   746   |  \t  Array  \t\t| [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/MinCostClimbingStairs.java)                                                       \t\t\t\t\t      \t\t|   Easy\t\t |\n|   121   |  \t  Array  \t\t| [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)             \t\t\t\t            \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/BestTimeToBuyAndSellStock.java)                                                   \t\t\t\t\t       \t\t|   Easy\t\t |\n|    53   |  \t  Array  \t\t| [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/MaximumSubarray.java)                                                             \t\t\t\t\t\t   \t\t|   Easy\t\t |\n|   561   |  \t  Array  \t\t| [Array Partition I](https://leetcode.com/problems/array-partition-i/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/ArrayPartitionI.java)                                                             \t\t\t\t\t\t    |   Easy\t\t |\n|    55   |  \t  Array  \t\t| [Jump Game](https://leetcode.com/problems/jump-game/description/)                           \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/arrays/JumpGame.java)                                                                  \t\t\t\t\t\t|\tMedium\t\t |\n|    45   |  \t  Array  \t\t| [Jump Game II](https://leetcode.com/problems/jump-game-ii/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/arrays/JumpGameII.java)                                                                  \t\t\t\t\t  \t\t|   Hard\t\t |\n|   239   |  \t  Heap  \t\t| [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/heaps/SlidingWindowMaximum.java)                                                                 \t\t\t\t\t|   Hard\t\t |\n|   657   |  \t String  \t\t| [Judge Route Circle](https://leetcode.com/problems/judge-route-circle/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/strings/JudgeRouteCircle.java)                                                           \t\t\t\t\t  \t\t|   Easy\t\t |\n|   760   |  \t String  \t\t| [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/hashtables/FindAnagramMappings.java)                                                     \t\t\t\t\t        |   Easy\t\t |\n|   344   |  \t String  \t\t| [Reverse String](https://leetcode.com/problems/reverse-string/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/strings/ReverseString.java)                                                              \t\t\t\t\t\t\t|   Easy\t\t |\n|   226   |  \t  Tree  \t\t| [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/InvertBinaryTree.java)                                                             \t\t\t\t\t\t\t|   Easy\t\t |\n|   617   |  \t  Tree  \t\t| [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/MergeTwoBinaryTrees.java)                                                          \t\t\t\t\t   \t\t|   Easy\t\t |\n|   100   |  \t  Tree  \t\t| [Same Tree](https://leetcode.com/problems/same-tree/description/)                          \t\t\t\t\t\t\t\t\t \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/SameTree.java)                                                                  \t\t\t\t\t\t\t|   Easy\t\t |\n|   111   |  \t  Tree  \t\t| [Minimum Depth of Binary Tree](https://leetcode.com/problems/merge-two-binary-trees/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/MinimumDepthOfBinaryTree.java)                                                     \t\t\t\t\t        |   Easy\t\t |\n|   112   |  \t  Tree  \t\t| [Path Sum](https://leetcode.com/problems/path-sum/description/)                          \t\t\t\t\t\t\t\t\t \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/PathSum.java)                                                                  \t\t\t\t\t\t\t\t|   Easy\t\t |\n|   108   |  \t  Tree  \t\t| [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/)                   \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/ConvertSortedArrayToBinarySearchTree.java)                                         \t\t\t\t\t        |   Easy\t\t |\n|   104   |  \t  Tree  \t\t| [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/MaximumDepthOfBinaryTree.java)                                                     \t        \t\t\t\t|   Easy\t\t |\n|   653   |  \t  Tree  \t\t| [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/description/)                         \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/TwoSumIV.java)                                          \t    \t\t\t\t\t\t\t\t\t\t\t|   Easy\t\t |\n|   94    |  \t  Tree  \t\t| [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeInorderTraversal.java)                                                   \t          \t\t\t|   Medium\t\t |\n|   98    |  \t  Tree  \t\t| [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/ValidateBinarySearchTree.java)                                                     \t        \t\t\t|   Medium\t\t |\n|   102   |  \t  Tree  \t\t| [BinaryTreeLevelOrderTraversal](https://leetcode.com/problems/binary-tree-level-order-traversal/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeLevelOrderTraversal.java)                                                \t             \t\t|   Medium\t\t |\n|   515   |  \t  Tree  \t\t| [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/)                          \t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/FindLargestValueInEachTreeRow.java)                                                \t             \t\t|   Medium\t\t |\n|   199   |  \t  Tree  \t\t| [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/description/)                          \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeRightSideView.java)                                                      \t       \t\t\t\t|   Medium\t\t |\n|   103   |  \t  Tree  \t\t| [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/)                       \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeZigzagLevelOrderTraversal.java)                                          \t                   \t|   Medium\t\t |\n|   106   |  \t  Tree  \t\t| [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/)                       | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/ConstructBinaryTreeFromInorderAndPostorderTraversal.java)                                          \t    |   Medium\t\t |\n|   105   |  \t  Tree  \t\t| [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/)                         | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/ConstructBinaryTreeFromPreorderAndInorderTraversal.java)                                          \t    |   Medium\t\t |\n|   461   |  Bit Manipulation  \t| [Hamming Distance](https://leetcode.com/problems/hamming-distance/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/HammingDistance.java)                                                   \t          \t\t\t\t|   Easy\t\t |\n|   342   |  Bit Manipulation  \t| [Power of Four](https://leetcode.com/problems/power-of-four/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t  \t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/PowerOfFour.java)                                                       \t      \t\t\t\t\t|   Easy\t\t |\n|   231   |  Bit Manipulation  \t| [Power of Two](https://leetcode.com/problems/power-of-two/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t \t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/PowerOfTwo.java)                                                        \t     \t\t\t\t\t|   Easy\t\t |\n|   191   |  Bit Manipulation  \t| [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/NumberOf1Bits.java)                                                     \t        \t\t\t\t|   Easy\t\t |\n|   338   |  Bit Manipulation  \t| [Counting Bits](https://leetcode.com/problems/counting-bits/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/bitmanipulations/CountingBits.java)                                                      \t       \t\t\t\t|   Medium\t\t |\n|   461   |  Bit Manipulation  \t| [Hamming Distance](https://leetcode.com/problems/hamming-distance/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/HammingDistance.java)                                                   \t          \t\t\t\t|   Easy\t\t |\n|   198   | Dynamic Programming | [House Robber](https://leetcode.com/problems/house-robber/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t\t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/HouseRobber.java)                                                                  \t\t\t\t\t\t\t|   Easy\t\t |\n|   303   | Dynamic Programming | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/description/)                          \t\t\t\t\t\t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/RangeSumQueryImmutable.java)                                                          \t   \t\t\t\t\t\t|   Easy\t\t |\n|   70    | Dynamic Programming | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/ClimbingStairs.java)                                                                  \t\t\t\t\t\t\t|   Easy\t\t |\n|   26    |    Two Pointers  \t| [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)                                               \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/twopointers/RemoveDuplicatesFromSortedArray.java)                                        \t             \t\t    |   Easy\t\t |\n|   167   |    Two Pointers  \t| [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/)                                               \t\t \t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/twopointers/TwoSumII.java)                                        \t             \t\t  \t\t\t\t\t\t|   Easy\t\t |\n|   76    |    Two Pointers  \t| [Minimum Window Substring](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/)                                               \t\t \t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/twopointers/MinimumWindowSubstring.java)                                        \t             \t\t  \t\t\t|   Hard\t\t |\n|   728   |  \t   Math  \t\t| [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/description/)                          \t\t\t\t\t\t\t\t\t \t\t\t\t\t\t\t\t\t| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/maths/SelfDividingNumbers.java)                                                          \t   \t\t\t\t\t\t|   Easy\t\t |\n|   595   |  \t   SQL  \t\t| [Big Countries](https://leetcode.com/problems/big-countries/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t\t \t\t\t\t\t\t\t\t\t| [Solution.sql](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/sqls/BigCountries.sql)                                                                  \t\t\t\t\t\t\t\t\t\t\t\t\t|   Easy\t\t |\n|   627   |  \t   SQL  \t\t| [Swap Salary](https://leetcode.com/problems/big-countries/description/)                          \t\t\t\t\t\t\t\t\t\t   \t\t\t \t \t\t\t\t\t\t\t\t\t| [Solution.sql](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/sqls/SwapSalary.sql)                                                                  \t\t\t\t\t\t\t\t\t\t\t\t\t|   Easy\t\t |\n\t\t\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjava-aid%2Fleetcodesolutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjava-aid%2Fleetcodesolutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjava-aid%2Fleetcodesolutions/lists"}