random coding practice
# | Challenge | Solution |
---|---|---|
1 | Curry | Typescript |
2 | Curry with placeholder support | Typescript |
3 | Implement Array.prototype.flat() | |
4 | Implement Basic throttle() | |
5 | Implement throttle() with leading & trailing option | |
6 | Implement basic debounce() | |
7 | Implement debounce() with leading & trailing option | |
8 | Can you shuffle() an array? | |
9 | Decode message | |
10 | First bad version | |
11 | What is Composition? create a pipe | |
12 | Implement Immutability helper | |
13 | Implement a Queue by using Stack | |
14 | Implement a general memoization function - memo() |
|
15 | Implement a simple DOM wrapper to support method chaining like jQuery | |
16 | Create an Event Emitter | |
17 | Create a simple store for DOM element | |
18 | Improve a function | |
19 | Find corresponding node in two identical DOM tree | |
20 | Detect data type in JavaScript | |
21 | Implement JSON.stringify() | |
22 | Implement JSON.parse() | |
23 | Create a sum() | |
24 | Create a Priority Queue in JavaScript | |
25 | Reorder array with new indexes | |
26 | Implement Object.assign() | |
27 | Implement completeAssign() | |
28 | Implement clearAllTimeout() | |
29 | Implement async helper - sequence() |
|
30 | Implement async helper - parallel() |
|
31 | Implement async helper - race() |
|
32 | Implement Promise.all() |
|
33 | Implement Promise.allSettled() |
|
34 | Implement Promise.any() |
|
35 | Implement Promise.race() |
|
36 | Create a fake timer(setTimeout)` | |
37 | Implement Binary Search (unique) | |
38 | Implement jest.spyOn() |
|
39 | Implement range() | |
40 | Implement Bubble Sort | |
41 | Implement Merge Sort | |
42 | Implement Insertion Sort | |
43 | Implement Quick Sort | |
44 | Implement Selection Sort | |
45 | Find the K-th largest element in an unsorted array | |
46 | Implement _.once() |
|
47 | Reverse a linked list | |
48 | Search first index with Binary Search(possible duplicate array) | |
176 | Undefined to null | Typescript |