Skip to content

Commit 8b28408

Browse files
kanahaiyakanahaiya
committed
2 parents f0f162e + 2ec95e2 commit 8b28408

File tree

1 file changed

+35
-8
lines changed

1 file changed

+35
-8
lines changed

‎README.md

Lines changed: 35 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -16,13 +16,40 @@ Coding environment used- Windows 8.1, Eclipse Oxygen, JAVA 8
1616

1717
| # | Tags | Title | Solution | Difficulty |
1818
|:-------:|:-------------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:--------------:|
19-
| 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 |
20-
| 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 |
21-
| 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 |
22-
| 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 |
23-
| 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 |
24-
| 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 |
25-
| 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 |
26-
| 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 |
19+
| 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 |
20+
| 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/arrays/MinCostClimbingStairs.java) | Easy |
21+
| 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/arrays/BestTimeToBuyAndSellStock.java) | Easy |
22+
| 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/arrays/MaximumSubarray.java) | Easy |
23+
| 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 |
24+
| 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 |
25+
| 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 |
26+
| 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 |
27+
| 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 |
28+
| 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 |
29+
| 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 |
30+
| 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 |
31+
| 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 |
32+
| 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 |
33+
| 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 |
34+
| 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 |
35+
| 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 |
36+
| 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 |
37+
| 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 |
38+
| 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 |
39+
| 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 |
40+
| 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 |
41+
| 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 |
42+
| 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 |
43+
| 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 |
44+
| 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 |
45+
| 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 |
46+
| 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 |
47+
| 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 |
48+
| 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 |
49+
| 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 |
50+
| 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 |
51+
| 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 |
52+
| 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 |
2753
| 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 |
2854
| 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 |
55+

0 commit comments

Comments
 (0)