https://github.com/java-aid/leetcodesolutions
This repository contains leetcode problem solutions
https://github.com/java-aid/leetcodesolutions
arrays easy github hard java java-aid javaaid kanahaiya kanhaiya leetcode-java leetcode-practice leetcode-solutions medium solutions trees
Last synced: about 2 months ago
JSON representation
This repository contains leetcode problem solutions
- Host: GitHub
- URL: https://github.com/java-aid/leetcodesolutions
- Owner: Java-aid
- Created: 2018-01-06T20:18:26.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2018-06-17T19:44:15.000Z (almost 7 years ago)
- Last Synced: 2025-03-24T11:38:43.545Z (2 months ago)
- Topics: arrays, easy, github, hard, java, java-aid, javaaid, kanahaiya, kanhaiya, leetcode-java, leetcode-practice, leetcode-solutions, medium, solutions, trees
- Language: Java
- Size: 60.5 KB
- Stars: 75
- Watchers: 12
- Forks: 64
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
This repository contains LeetCode problems solutions
Coding environment used- Windows 8.1, Eclipse Oxygen, JAVA 8
# LeetCodeSolutions
| # | Tags | Title | Solution | Difficulty |
|:-------:|:-------------------:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:--------------:|
| 1 | Array | [Two Sum](https://leetcode.com/problems/two-sum/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/TwoSum.java) | Easy |
| 747 | Array | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/description) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/LargestNumberAtLeastTwiceofOthers.java) | Easy |
| 746 | Array | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/MinCostClimbingStairs.java) | Easy |
| 121 | Array | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/BestTimeToBuyAndSellStock.java) | Easy |
| 53 | Array | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/MaximumSubarray.java) | Easy |
| 561 | Array | [Array Partition I](https://leetcode.com/problems/array-partition-i/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/ArrayPartitionI.java) | Easy |
| 55 | Array | [Jump Game](https://leetcode.com/problems/jump-game/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/arrays/JumpGame.java) | Medium |
| 45 | Array | [Jump Game II](https://leetcode.com/problems/jump-game-ii/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/arrays/JumpGameII.java) | Hard |
| 239 | Heap | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/heaps/SlidingWindowMaximum.java) | Hard |
| 657 | String | [Judge Route Circle](https://leetcode.com/problems/judge-route-circle/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/strings/JudgeRouteCircle.java) | Easy |
| 760 | String | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/hashtables/FindAnagramMappings.java) | Easy |
| 344 | String | [Reverse String](https://leetcode.com/problems/reverse-string/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/strings/ReverseString.java) | Easy |
| 226 | Tree | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/InvertBinaryTree.java) | Easy |
| 617 | Tree | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/MergeTwoBinaryTrees.java) | Easy |
| 100 | Tree | [Same Tree](https://leetcode.com/problems/same-tree/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/SameTree.java) | Easy |
| 111 | Tree | [Minimum Depth of Binary Tree](https://leetcode.com/problems/merge-two-binary-trees/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/MinimumDepthOfBinaryTree.java) | Easy |
| 112 | Tree | [Path Sum](https://leetcode.com/problems/path-sum/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/PathSum.java) | Easy |
| 108 | Tree | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/ConvertSortedArrayToBinarySearchTree.java) | Easy |
| 104 | Tree | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/MaximumDepthOfBinaryTree.java) | Easy |
| 653 | Tree | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/trees/TwoSumIV.java) | Easy |
| 94 | Tree | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeInorderTraversal.java) | Medium |
| 98 | Tree | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/ValidateBinarySearchTree.java) | Medium |
| 102 | Tree | [BinaryTreeLevelOrderTraversal](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeLevelOrderTraversal.java) | Medium |
| 515 | Tree | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/FindLargestValueInEachTreeRow.java) | Medium |
| 199 | Tree | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeRightSideView.java) | Medium |
| 103 | Tree | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/trees/BinaryTreeZigzagLevelOrderTraversal.java) | Medium |
| 106 | Tree | [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) | Medium |
| 105 | Tree | [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) | Medium |
| 461 | Bit Manipulation | [Hamming Distance](https://leetcode.com/problems/hamming-distance/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/HammingDistance.java) | Easy |
| 342 | Bit Manipulation | [Power of Four](https://leetcode.com/problems/power-of-four/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/PowerOfFour.java) | Easy |
| 231 | Bit Manipulation | [Power of Two](https://leetcode.com/problems/power-of-two/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/PowerOfTwo.java) | Easy |
| 191 | Bit Manipulation | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/NumberOf1Bits.java) | Easy |
| 338 | Bit Manipulation | [Counting Bits](https://leetcode.com/problems/counting-bits/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/bitmanipulations/CountingBits.java) | Medium |
| 461 | Bit Manipulation | [Hamming Distance](https://leetcode.com/problems/hamming-distance/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/bitmanipulations/HammingDistance.java) | Easy |
| 198 | Dynamic Programming | [House Robber](https://leetcode.com/problems/house-robber/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/HouseRobber.java) | Easy |
| 303 | Dynamic Programming | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/RangeSumQueryImmutable.java) | Easy |
| 70 | Dynamic Programming | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/ClimbingStairs.java) | Easy |
| 26 | Two Pointers | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/twopointers/RemoveDuplicatesFromSortedArray.java) | Easy |
| 167 | Two Pointers | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/twopointers/TwoSumII.java) | Easy |
| 76 | Two Pointers | [Minimum Window Substring](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/twopointers/MinimumWindowSubstring.java) | Hard |
| 728 | Math | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/maths/SelfDividingNumbers.java) | Easy |
| 595 | SQL | [Big Countries](https://leetcode.com/problems/big-countries/description/) | [Solution.sql](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/sqls/BigCountries.sql) | Easy |
| 627 | SQL | [Swap Salary](https://leetcode.com/problems/big-countries/description/) | [Solution.sql](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/sqls/SwapSalary.sql) | Easy |