https://github.com/shkvik/nodejs-algorithms

This repository is a collection of various algorithms implemented in Node.js using TypeScript.
https://github.com/shkvik/nodejs-algorithms
algorithms bfs dfs nodejs sorts typescript
Last synced: 9 months ago
JSON representation
This repository is a collection of various algorithms implemented in Node.js using TypeScript.
Host: GitHub
URL: https://github.com/shkvik/nodejs-algorithms
Owner: shkvik
License: apache-2.0
Created: 2024-09-02T13:43:49.000Z (over 1 year ago)
Default Branch: main
Last Pushed: 2025-04-01T12:45:01.000Z (9 months ago)
Last Synced: 2025-04-01T13:26:16.839Z (9 months ago)
Topics: algorithms, bfs, dfs, nodejs, sorts, typescript
Language: TypeScript
Homepage:
Size: 310 KB
Stars: 31
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

          # nodejs-algorithms

This repository is a collection of various algorithms implemented in Node.js using TypeScript.

## LeetCode Problems

| №  | Problem Title 
|----|---------------------- 
| 1  | Two Sum 
| 2  | Longest Substring 
| 3  | Longest Palindromic Substring 
| 4  | Palindrome Number 
| 5  | Valid Parentheses 
| 6  | Generate Parentheses 
| 7  | Merge k Sorted Lists 
| 8  | Remove Element 
| 9  | Find the Index 
| 10 | Search in Rotated Sorted Array 
| 11 | Trapping Rain Water 
| 12 | Group Anagrams 
| 13 | Merge Intervals 
| 14 | Simplify Path 
| 15 | Minimum Window Substring 
| 16 | Merge Sorted Array 
| 17 | Validate Binary Search Tree 
| 18 | Symmetric Tree 
| 19 | Maximum Depth of Binary Tree 
| 20 | Best Time to Buy and Sell Stock 
| 21 | Binary Tree Maximum Path Sum 
| 22 | Valid Palindrome 
| 23 | Single Number 
| 24 | LRU Cache 
| 25 | Evaluate Reverse Polish Notation 
| 26 | Min Stack 
| 27 | One Edit Distance 
| 28 | Majority Element 
| 29 | Binary Tree Right Side View 
| 30 | Number of Islands 
| 31 | Isomorphic Strings 
| 32 | Reverse Linked List 
| 33 | Summary Ranges 
| 34 | Lowest Common 
| 35 | Product of Array Except Self 
| 36 | Meeting Rooms II 
| 37 | Move Zeroes 
| 38 | Longest Increasing Subsequence 
| 39 | Remove Invalid Parentheses 
| 40 | Reconstruct Itinerary 
| 41 | Longest Substring 
| 42 | Flatten Nested List Iterator 
| 43 | Intersection of Two Arrays 
| 44 | Intersection of Two Arrays II 
| 45 | Line Reflection 
| 46 | Design Hit Counter 
| 47 | Insert Delete GetRandom O(1) 
| 48 | Is Subsequence 
| 49 | Find All Anagrams in a String 
| 50 | String Compression 
| 51 | Max Consecutive Ones 
| 52 | Max Consecutive Ones II 
| 53 | Subarray Sum Equals K 
| 54 | Permutation in String 
| 55 | Find Duplicate Subtrees 
| 56 | Robot Return to Origin 
| 57 | Find K Closest Elements 
| 58 | Valid Palindrome II 
| 59 | Maximize Distance 
| 60 | Number of Recent Calls 
| 61 | Squares of a Sorted Array 
| 62 | Interval List Intersections 
| 63 | Max Consecutive Ones III 
| 64 | Sort the Matrix Diagonally 
| 65 | Destination City 
| 66 | Longest Subarray 
| 67 | Design an ATM Machine 
| 68 | Promise Pool 
| 69 | Flatten Deeply Nested Array 
| 70 | Find the Prefix 
| 71 | Event Emitter

| LeetCode                                                                             |  Solution                                                                                             | Ideal O(Time)  | Ideal O(Space) ------------------------------------------------|-------------------------------------------------------------------                   |--------------------                                                                                   |--------------  |----------------- | [Link](https://leetcode.com/problems/two-sum)                                        |[Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/two-sum.ts)                     | $O(n)$         | $O(n)$ Without Repeating Characters                       | [Link](https://leetcode.com/problems/longest-substring-without-repeating-characters) |[Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/longest-substring.string.ts)   | $O(n)$         | $O(min(m,n))$ | [Link](https://leetcode.com/problems/longest-palindromic-substring)                       | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/longest-palindromic-substring.ts)| $O(n^2)$       | $O(n)$ | [Link](https://leetcode.com/problems/palindrome-number)                                   | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/math/palindrome-number.ts)            | $O(log_{10}(n))$ | $O(1)$ | [Link](https://leetcode.com/problems/valid-parentheses)                                   | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/stack/valid-parentheses.ts)           | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/generate-parentheses)                                | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/backtracking/generate-parentheses.ts)  | $O(4^n / \sqrt{n})$ | $O(4^n / \sqrt{n})$ | [Link](https://leetcode.com/problems/merge-k-sorted-lists)                                | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/linked-list/merge-k-sorted-lists.ts)  | $O(n \log k)$  | $O(k)$ | [Link](https://leetcode.com/problems/remove-element)                                     | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/remove-element.ts)              | $O(n)$         | $O(1)$ of the First Occurrence in a String                   | [Link](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string)  | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/first-occurrence-in-string.ts)  | $O(n \cdot m)$ | $O(1)$ | [Link](https://leetcode.com/problems/search-in-rotated-sorted-array)                     | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/search-in-rotated-array.ts)     | $O(\log n)$    | $O(1)$ | [Link](https://leetcode.com/problems/trapping-rain-water)                                | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/trapping-rain-water.ts)         | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/group-anagrams)                                     | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/group-anagrams.ts)             | $O(n \cdot k \log k)$ | $O(nk)$ | [Link](https://leetcode.com/problems/merge-intervals)                                    | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/merge-intervals.ts)             | $O(n \log n)$  | $O(n)$ | [Link](https://leetcode.com/problems/simplify-path)                                      | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/stack/simplify-path.ts)               | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/minimum-window-substring)                           | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/minimum-window-substring.ts)    | $O(n)$         | $O(|S| + |T|)$ | [Link](https://leetcode.com/problems/merge-sorted-array)                                 | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/merge-sorted-array.ts)          | $O(n+m)$       | $O(1)$ | [Link](https://leetcode.com/problems/validate-binary-search-tree)                        | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/tree/validate-bst.ts)                 | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/symmetric-tree)                                     | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/tree/symmetric-tree.ts)               | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/maximum-depth-of-binary-tree)                       | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/tree/maximum-depth-binary-tree.ts)    | $O(n)$         | $O(h)$ | [Link](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)                    | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/best-time-to-buy-and-sell.ts)   | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/binary-tree-maximum-path-sum)                       | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/tree/binary-tree-maximum-path-sum.ts) | $O(n)$         | $O(h)$ | [Link](https://leetcode.com/problems/valid-palindrome)                                  | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/valid-palindrome.ts)           | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/single-number)                                     | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/single-number.ts)               | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/lru-cache)                                         | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/linked-list/lru-cache.ts)             | $O(1)$         | $O(n)$ | [Link](https://leetcode.com/problems/evaluate-reverse-polish-notation)                  | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/stack/evaluate-reverse-polish.ts)     | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/min-stack)                                         | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/stack/min-stack.ts)                   | $O(1)$         | $O(n)$ | [Link](https://leetcode.com/problems/one-edit-distance)                                 | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/one-edit-distance.ts)          | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/majority-element)                                  | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/majority-element.ts)            | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/binary-tree-right-side-view)                       | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/tree/binary-tree-right-side-view.ts)  | $O(n)$         | $O(h)$ | [Link](https://leetcode.com/problems/number-of-islands)                                 | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/graph/number-of-islands.ts)           | $O(n \cdot m)$ | $O(n \cdot m)$ | [Link](https://leetcode.com/problems/isomorphic-strings)                                | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/isomorphic-strings.ts)         | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/reverse-linked-list)                               | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/linked-list/reverse-linked-list.ts)   | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/summary-ranges)                                    | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/summary-ranges.ts)              | $O(n)$         | $O(1)$ Ancestor of a Binary Tree                              | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)           | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/tree/lowest-common-ancestor.ts)       | $O(n)$         | $O(h)$ | [Link](https://leetcode.com/problems/product-of-array-except-self)                      | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/product-of-array-except-self.ts) | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/meeting-rooms-ii)                                  | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/heap/meeting-rooms-ii.ts)             | $O(n \log n)$  | $O(n)$ | [Link](https://leetcode.com/problems/move-zeroes)                                       | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/move-zeroes.ts)                 | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/longest-increasing-subsequence)                    | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/longest-increasing-subsequence.ts) | $O(n \log n)$  | $O(n)$ | [Link](https://leetcode.com/problems/remove-invalid-parentheses)                         | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/remove-invalid-parentheses.ts) | $O(2^n)$       | $O(n)$ | [Link](https://leetcode.com/problems/reconstruct-itinerary)                              | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/graph/reconstruct-itinerary.ts)       | $O(E \log E)$  | $O(V + E)$ with At Most K Distinct Characters                 | [Link](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/longest-substring-k-distinct.ts)| $O(n)$         | $O(k)$ | [Link](https://leetcode.com/problems/flatten-nested-list-iterator)                       | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/iterator/flatten-nested-list.ts)      | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/intersection-of-two-arrays)                         | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/intersection-of-two-arrays.ts)  | $O(n \log n)$  | $O(n)$ | [Link](https://leetcode.com/problems/intersection-of-two-arrays-ii)                      | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/intersection-of-two-arrays-ii.ts) | $O(n \log n)$  | $O(n)$ | [Link](https://leetcode.com/problems/line-reflection)                                    | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/geometry/line-reflection.ts)          | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/design-hit-counter)                                 | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/design/design-hit-counter.ts)         | $O(1)$         | $O(w)$ | [Link](https://leetcode.com/problems/insert-delete-getrandom-o1)                         | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/design/insert-delete-getrandom.ts)    | $O(1)$         | $O(n)$ | [Link](https://leetcode.com/problems/is-subsequence)                                     | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/is-subsequence.ts)             | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/find-all-anagrams-in-a-string)                      | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/find-all-anagrams.ts)          | $O(n)$         | $O(k)$ | [Link](https://leetcode.com/problems/string-compression)                                 | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/string-compression.ts)         | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/max-consecutive-ones)                               | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/max-consecutive-ones.ts)        | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/max-consecutive-ones-ii)                            | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/max-consecutive-ones-ii.ts)     | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/subarray-sum-equals-k)                              | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/subarray-sum-equals-k.ts)       | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/permutation-in-string)                              | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/permutation-in-string.ts)      | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/find-duplicate-subtrees)                            | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/tree/find-duplicate-subtrees.ts)      | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/robot-return-to-origin)                             | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/robot-return-to-origin.ts)     | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/find-k-closest-elements)                            | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/find-k-closest-elements.ts)     | $O(\log n + k)$| $O(1)$ | [Link](https://leetcode.com/problems/valid-palindrome-ii)                                | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/string/valid-palindrome-ii.ts)        | $O(n)$         | $O(1)$ to Closest Person                                  | [Link](https://leetcode.com/problems/maximize-distance-to-closest-person)                | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/maximize-distance-to-closest.ts) | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/number-of-recent-calls)                             | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/queue/number-of-recent-calls.ts)      | $O(1)$         | $O(w)$ | [Link](https://leetcode.com/problems/squares-of-a-sorted-array)                          | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/squares-of-a-sorted-array.ts)   | $O(n)$         | $O(n)$ | [Link](https://leetcode.com/problems/interval-list-intersections)                        | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/interval-list-intersections.ts) | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/max-consecutive-ones-iii)                           | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/max-consecutive-ones-iii.ts)    | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/sort-the-matrix-diagonally)                         | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/matrix/sort-matrix-diagonally.ts)     | $O(n \cdot m)$ | $O(n \cdot m)$ | [Link](https://leetcode.com/problems/destination-city)                                   | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/graph/destination-city.ts)            | $O(n)$         | $O(n)$ of 1's After Deleting One Element                   | [Link](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element)  | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/longest-subarray-after-delete.ts) | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/design-an-atm-machine)                              | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/design/design-atm-machine.ts)         | $O(1)$         | $O(n)$ | [Link](https://leetcode.com/problems/promise-pool)                                       | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/concurrency/promise-pool.ts)          | $O(n)$         | $O(k)$ | [Link](https://leetcode.com/problems/flatten-deeply-nested-array)                        | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/flatten-deeply-nested-array.ts) | $O(n)$         | $O(n)$ Common Array of Two Arrays                           | [Link](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays)         | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/array/find-prefix-common-array.ts)    | $O(n)$         | $O(1)$ | [Link](https://leetcode.com/problems/event-emitter)                                      | [Link](https://github.com/shkvik/nodejs-algorithms/blob/main/src/design/event-emitter.ts)              | $O(n)$         | $O(1)$
ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

https://github.com/shkvik/nodejs-algorithms

Awesome Lists containing this project

README
