We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 66ed8fa commit 7be34d3Copy full SHA for 7be34d3
README.md
@@ -1,7 +1,13 @@
1
-# LeetCode-In-JS
+# LeetCode with JavaScript
2
Solve [LeetCode](https://leetcode.com) problems using JavaScript By Topic wise with Test-cases(Jest).
3
4
---
5
6
+### Test
7
+```
8
+npm test
9
10
+
11
## Array Problems Solution -
-1. [Two Sum](https://leetcode.com/problems/two-sum/) - [Solution](https://github.com/ManiruzzamanAkash/LeetCode-In-JS/blob/main/two-sum/)
12
+1. [Two Sum](https://leetcode.com/problems/two-sum/) - [Solution](https://github.com/ManiruzzamanAkash/LeetCode-In-JS/blob/main/two-sum/)
13
+1. [Remove duplicates from sorted array]() - [Solution](https://github.com/ManiruzzamanAkash/LeetCode-In-JS/tree/main/remove-duplicates-from-sorted-array)
0 commit comments