Skip to content

Commit df76f8c

Browse files
kanahaiyakanahaiya
authored
Update README.md
Added more solutions & updated links
1 parent 9c1d763 commit df76f8c

File tree

1 file changed

+7
-3
lines changed

1 file changed

+7
-3
lines changed

‎README.md

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

1717
| # | Tags | Title | Solution | Difficulty |
1818
|:-------:|:-------------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:--------------:|
19-
| 26 | Array | [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/arrays/RemoveDuplicatesFromSortedArray.java) | Easy |
20-
| 226 | Array | [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 |
2119
| 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/arrays/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 |
2224
| 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/trees/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 | [Hamming Distance](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 |
2327
| 595 | SQL | [Big Countries](https://leetcode.com/problems/big-countries/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/BigCountries.sql) | Easy |
24-
| 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/arrays/JudgeRouteCircle.java) | Easy |
28+
| 627 | SQL | [Swap Salary](https://leetcode.com/problems/big-countries/description/) | [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/SwapSalary.sql) | Easy |

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy