Skip to content

Navigation Menu

Sign in

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Commit 40b59f9

Browse filesBrowse files
kanahaiyakanahaiya
committed
2 parents bad1653 + aa0ca27 commit 40b59f9
Copy full SHA for 40b59f9

File tree

1 file changed

+9
-5
lines changed
Filter options

1 file changed

+9
-5
lines changed

‎README.md

Copy file name to clipboardExpand all lines: README.md
+9-5
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 |
22-
| 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 |
23-
| 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 |
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 |
27+
| 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 |
28+
| 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 |

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.