Skip to content

Commit a963809

Browse files
aadil42aadil42
authored
Merge branch 'main' into patch-55
2 parents c259074 + 6e9bbd9 commit a963809

File tree

47 files changed

+1129
-120
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

47 files changed

+1129
-120
lines changed

‎README.md

+34-34
Large diffs are not rendered by default.

‎go/0912-sort-an-array.go

+4
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
func sortArray(nums []int) []int {
2+
sort.Ints(nums)
3+
return nums
4+
}

‎go/1929-concatenation-of-array.go

+11
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
func getConcatenation(nums []int) []int {
2+
n := len(nums)
3+
ans := make([]int, 2*n) //lets make an array of int type and 2*n size
4+
i := 0
5+
for i < n { //implementing for loop for the given condition
6+
ans[i] = nums[i]
7+
ans[i+n] = nums[i]
8+
i++
9+
}
10+
return ans
11+
}

‎java/0091-decode-ways.java

-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,6 @@
22
class Solution {
33

44
public int numDecodings(String s) {
5-
int[] dp = new int[s.length() + 1];
65
int twoBack = 1; // empty string
76
int oneBack = s.charAt(0) == '0' ? 0 : 1;
87
int current = oneBack;

‎javascript/0022-generate-parentheses.js

+23-24
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,15 @@
11
/**
2-
* https://leetcode.com/problems/generate-parentheses
2+
* DFS
33
* Time O(((4^N) / (N * SQRT(N)))) | Space O(((4^N) / (N * SQRT(N))))
44
* Time O(2^N) | Space O(2^N)
5+
* https://leetcode.com/problems/generate-parentheses
56
* @param {number} n
67
* @return {string[]}
78
*/
8-
var generateParenthesis = (n) => dfs(n);/* Time O(2^N) | Space O(2^N) */
9+
var generateParenthesis = (n) => dfs(n);
910

1011
const dfs = (n, combos = [], open = 0, close = 0, path = []) => {
11-
const isBaseCase = path.length === (n * 2);
12+
const isBaseCase = (path.length === (n * 2));
1213
if (isBaseCase) {
1314
combos.push(path.join(''));/* Space O(N + N) */
1415

@@ -25,35 +26,36 @@ const dfs = (n, combos = [], open = 0, close = 0, path = []) => {
2526
}
2627

2728
const backTrackOpen = (n, combos, open, close, path) => {
28-
path.push('('); /* | Space O(N) */
29+
path.push('(');/* Space O(N) */
2930
dfs(n, combos, (open + 1), close, path);/* Time O(2^N) | Space O(2^N) */
3031
path.pop();
3132
}
3233

3334
const backTrackClose = (n, combos, open, close, path) => {
34-
path.push(')'); /* | Space O(N) */
35+
path.push(')');/* Space O(N) */
3536
dfs(n, combos, open, (close + 1), path);/* Time O(2^N) | Space O(2^N) */
3637
path.pop();
3738
}
3839

3940
/**
40-
* https://leetcode.com/problems/generate-parentheses
41+
* BFS
4142
* Time O(((4^N) / (N * SQRT(N)))) | Space O(((4^N) / (N * SQRT(N))))
4243
* Time O(2^N) | Space O(2^N)
44+
* https://leetcode.com/problems/generate-parentheses
4345
* @param {number} n
4446
* @return {string[]}
4547
*/
46-
var generateParenthesis = (n) => bfs(n);/* Time O(2^N) | Space O(2^N) */
48+
var generateParenthesis = (n) => bfs(n);
4749

48-
const bfs = (n, queue, combos = []) => {
50+
const bfs = (n, combos = []) => {
4951
const queue = new Queue([ ['', 0, 0] ]);
5052

5153
while (!queue.isEmpty()) {/* Time O(2^N) */
5254
const [ str, open, close ] = queue.dequeue();
53-
54-
const isBaseCase = (open === n) && (close === n);
55+
56+
const isBaseCase = ((open === n) && (close === n));
5557
if (isBaseCase) {
56-
combos.push(str); /* Space O(N) */
58+
combos.push(str); /* Space O(N) */
5759

5860
continue;
5961
}
@@ -69,31 +71,28 @@ const bfs = (n, queue, combos = []) => {
6971
}
7072

7173
/**
72-
* https://leetcode.com/problems/generate-parentheses
74+
* DFS
7375
* Time O(((4^N) / (N * SQRT(N)))) | Space O(((4^N) / (N * SQRT(N))))
7476
* Time O(2^N) | Space O(2^N)
77+
* https://leetcode.com/problems/generate-parentheses
7578
* @param {number} n
7679
* @return {string[]}
7780
*/
7881
var generateParenthesis = (n, combos = []) => {
79-
const isBaseCase = n === 0;
82+
const isBaseCase = (n === 0);
8083
if (isBaseCase) {
81-
combos.push(''); /* | Space O(N) */
84+
combos.push('');
8285

83-
return combos;
86+
return combos
8487
}
8588

86-
return closureNumber(n, combos);/* Time O(2^N) | Space O(2^N) */
87-
}
88-
89-
const closureNumber = (n, combos) => {
90-
for (let c = 0; c < n; c++) {/* Time O(N) */
91-
for (const left of generateParenthesis(c)) { /* Time O(2^N) | Space O(2^N) */
92-
for (const right of generateParenthesis(((n - 1) - c))) {/* Time O(2^N) | Space O(2^N) */
93-
combos.push(`(${left})${right}`); /* | Space O(N) */
89+
for (let c = 0; (c < n); c++) {
90+
for (const left of generateParenthesis(c)) {
91+
for (const right of generateParenthesis(((n - 1) - c))) {
92+
combos.push(`(${left})${right}`);
9493
}
9594
}
9695
}
9796

9897
return combos
99-
}
98+
}

‎javascript/0036-valid-sudoku.js

+5-5
Original file line numberDiff line numberDiff line change
@@ -33,12 +33,12 @@ var searchGrid = (board, boxes, cols, rows) => {
3333
const isEmpty = char === '.';
3434
if (isEmpty) continue;
3535

36-
const hasMoved = boxes[index][char] || cols[col][char] || rows[row][char];
36+
const hasMoved = boxes[index][(char - 1)] || cols[col][(char - 1)] || rows[row][(char - 1)];
3737
if (hasMoved) return false;
3838

39-
rows[row][char] = true; /* Space O(ROWS * COLS)*/
40-
cols[col][char] = true; /* Space O(ROWS * COLS)*/
41-
boxes[index][char] = true; /* Space O(ROWS * COLS)*/
39+
rows[row][(char - 1)] = true; /* Space O(ROWS * COLS)*/
40+
cols[col][(char - 1)] = true; /* Space O(ROWS * COLS)*/
41+
boxes[index][(char - 1)] = true; /* Space O(ROWS * COLS)*/
4242
}
4343
}
4444

@@ -84,4 +84,4 @@ var searchGrid = (board, boxes, rows, cols) => {
8484
}
8585

8686
return true;
87-
}
87+
}

‎javascript/0080-remove-duplicates-from-sorted-array-ii.js

+49-48
Original file line numberDiff line numberDiff line change
@@ -1,60 +1,61 @@
11
/**
2-
* Linear
3-
* https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
4-
* Time O(n) | Space O(1)
5-
* @param {number[]} nums
6-
* @return {number}
7-
*/
2+
* https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
3+
*
4+
* Time O(n) | Space O(1)
5+
* @param {number[]} nums
6+
* @return {number}
7+
*/
88
var removeDuplicates = function(nums) {
9-
let current = nums[0];
10-
let sameElCount = 0;
9+
let current = nums[0];
10+
let sameElCount = 0;
1111

12-
for(let i = 0; i < nums.length; i++) {
13-
if(current === nums[i]) {
14-
sameElCount++;
15-
}
16-
if(current !== nums[i]) {
17-
current = nums[i];
18-
sameElCount = 1;
19-
}
20-
if(sameElCount > 2) {
21-
nums.splice(i,1);
22-
i--;
23-
}
12+
for(let i = 0; i < nums.length; i++) {
13+
if(current === nums[i]) {
14+
sameElCount++;
15+
}
16+
if(current !== nums[i]) {
17+
current = nums[i];
18+
sameElCount = 1;
2419
}
20+
if(sameElCount > 2) {
21+
nums.splice(i,1);
22+
i--;
23+
}
24+
}
2525
};
2626

27+
2728
/**
28-
* Two pointer
29-
* Time O(n^2) | Space O(1)
30-
* @param {number[]} nums
31-
* @return {number}
32-
*/
29+
* Two pointer
30+
* Time O(n^2) | Space O(1)
31+
* @param {number[]} nums
32+
* @return {number}
33+
*/
3334
var removeDuplicates2 = function(nums) {
3435

35-
let current = nums[0];
36-
let sameElCount = 0;
36+
let current = nums[0];
37+
let sameElCount = 0;
3738

3839

39-
for(let i = 0; i < nums.length; i++) {
40-
if(current === nums[i]) {
41-
sameElCount++;
42-
}
43-
if(current !== nums[i]) {
44-
current = nums[i];
45-
sameElCount = 1;
46-
}
47-
if(sameElCount > 2) {
48-
let left = i;
49-
let right = i+1;
50-
let count = 1;
51-
while(nums[left] === nums[right]) {
52-
count++;
53-
right++;
54-
}
55-
nums.splice(left, count);
56-
i--;
57-
}
40+
for(let i = 0; i < nums.length; i++) {
41+
if(current === nums[i]) {
42+
sameElCount++;
43+
}
44+
if(current !== nums[i]) {
45+
current = nums[i];
46+
sameElCount = 1;
5847
}
59-
return nums.length;
60-
};
48+
if(sameElCount > 2) {
49+
let left = i;
50+
let right = i+1;
51+
let count = 1;
52+
while(nums[left] === nums[right]) {
53+
count++;
54+
right++;
55+
}
56+
nums.splice(left, count);
57+
i--;
58+
}
59+
}
60+
return nums.length;
61+
};

‎javascript/0116-populating-next-right-pointers-in-each-node.js

+37
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
/**
2+
* BFS
3+
* Time O(n) | Space O(1)
4+
*
5+
* https://leetcode.com/problems/populating-next-right-pointers-in-each-node/
6+
* // Definition for a Node.
7+
* function Node(val, left, right, next) {
8+
* this.val = val === undefined ? null : val;
9+
* this.left = left === undefined ? null : left;
10+
* this.right = right === undefined ? null : right;
11+
* this.next = next === undefined ? null : next;
12+
* };
13+
*/
14+
/**
15+
* @param {Node} root
16+
* @return {Node}
17+
*/
18+
19+
var connect = function(root) {
20+
21+
let currentNode = root;
22+
let nextLevelNode = root && root.left;
23+
24+
while(currentNode && nextLevelNode) {
25+
currentNode.left.next = currentNode.right;
26+
if(currentNode.next) {
27+
currentNode.right.next = currentNode.next.left;
28+
}
29+
currentNode = currentNode.next;
30+
if(!currentNode) {
31+
currentNode = nextLevelNode;
32+
nextLevelNode = currentNode.left;
33+
}
34+
}
35+
36+
return root;
37+
};

‎javascript/0125-valid-palindrome.js

+30
Original file line numberDiff line numberDiff line change
@@ -55,3 +55,33 @@ var isPalindrome = function(s) {
5555
}
5656
return true;
5757
};
58+
59+
/**
60+
* 2 Pointer | Midde Convergence | No RegEx | No Copying
61+
* Time O(N) | Space O(1)
62+
* https://leetcode.com/problems/valid-palindrome/
63+
* @param {string} s
64+
* @return {boolean}
65+
*/
66+
var isPalindrome = function (s) {
67+
const isAlphaNumeric = c => (c.toLowerCase() >= 'a' && c.toLowerCase() <= 'z') || c >= '0' && c <= '9'
68+
69+
let left = 0;
70+
let right = s.length - 1;
71+
let skipLeft, skipRight, endsEqual = false;
72+
73+
while (left < right) {
74+
skipLeft = !isAlphaNumeric(s.charAt(left))
75+
if (skipLeft) { left++; continue; }
76+
77+
skipRight = !isAlphaNumeric(s.charAt(right))
78+
if (skipRight) { right--; continue; }
79+
80+
endsEqual = s.charAt(left).toLowerCase() === s.charAt(right).toLowerCase()
81+
if (!endsEqual) return false
82+
83+
left++
84+
right--
85+
}
86+
return true
87+
};

‎javascript/0143-reorder-list.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -6,9 +6,9 @@
66
*/
77
var reorderList = function(head) {
88
const mid = getMid(head); /* Time O(N) */
9-
const reveredFromMid = reverse(mid);/* Time O(N) */
9+
const reversedFromMid = reverse(mid);/* Time O(N) */
1010

11-
reorder(head, reveredFromMid); /* Time O(N) */
11+
reorder(head, reversedFromMid); /* Time O(N) */
1212
};
1313

1414
const getMid = (head) => {

‎javascript/0162-find-peak-element.js

+22
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
/**
2+
* Time O(log(N)) | Space O(1)
3+
* @param {number[]} nums
4+
* @return {number}
5+
*/
6+
var findPeakElement = function(nums) {
7+
let [l, r] = [0, nums.length - 1];
8+
let mid = null;
9+
while (l <= r){
10+
mid = (l + r) >> 1;
11+
if (mid < nums.length - 1 && nums[mid] < nums[mid+1]){
12+
l = mid + 1;
13+
}
14+
else if (mid > 0 && nums[mid] < nums[mid-1]) {
15+
r = mid - 1;
16+
}
17+
else {
18+
break;
19+
}
20+
}
21+
return mid;
22+
};

‎javascript/0187-repeated-dna-sequences.js

+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
/**
2+
* @param {string} s
3+
* @return {string[]}
4+
*/
5+
var findRepeatedDnaSequences = function (s) {
6+
const seen = new Set();
7+
const res = new Set();
8+
const arr = Array.from(s);
9+
10+
for (let l = 0; l < arr.length - 9; l++) {
11+
const sequence = s.slice(l, l + 10);
12+
13+
if (seen.has(sequence)) {
14+
res.add(sequence);
15+
} else {
16+
seen.add(sequence);
17+
}
18+
}
19+
20+
return Array.from(res);
21+
};

0 commit comments

Comments
 (0)