Skip to content
/ algorithms Public

Data structures and algorithms in javascript for interview practice

License

MIT license
5 stars 2 forks Branches Tags Activity
Star

jesseokeya/algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1,518 Commits
0005-longest-palindromic-substring
0005-longest-palindromic-substring
 
 
0075-sort-colors
0075-sort-colors
 
 
0098-validate-binary-search-tree
0098-validate-binary-search-tree
 
 
0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-tree
 
 
0142-linked-list-cycle-ii
0142-linked-list-cycle-ii
 
 
0236-lowest-common-ancestor-of-a-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
 
 
0259-3sum-smaller
0259-3sum-smaller
 
 
0380-insert-delete-getrandom-o1
0380-insert-delete-getrandom-o1
 
 
0451-sort-characters-by-frequency
0451-sort-characters-by-frequency
 
 
0543-diameter-of-binary-tree
0543-diameter-of-binary-tree
 
 
0581-shortest-unsorted-continuous-subarray
0581-shortest-unsorted-continuous-subarray
 
 
0713-subarray-product-less-than-k
0713-subarray-product-less-than-k
 
 
0876-middle-of-the-linked-list
0876-middle-of-the-linked-list
 
 
0957-prison-cells-after-n-days
0957-prison-cells-after-n-days
 
 
1-two-sum
1-two-sum
 
 
100-same-tree
100-same-tree
 
 
1004-max-consecutive-ones-iii
1004-max-consecutive-ones-iii
 
 
1009-complement-of-base-10-integer
1009-complement-of-base-10-integer
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 
1022-sum-of-root-to-leaf-binary-numbers
1022-sum-of-root-to-leaf-binary-numbers
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
110-balanced-binary-tree
110-balanced-binary-tree
 
 
1100-find-k-length-substrings-with-no-repeated-characters
1100-find-k-length-substrings-with-no-repeated-characters
 
 
112-path-sum
112-path-sum
 
 
113-path-sum-ii
113-path-sum-ii
 
 
1143-longest-common-subsequence
1143-longest-common-subsequence
 
 
1176-diet-plan-performance
1176-diet-plan-performance
 
 
1207-unique-number-of-occurrences
1207-unique-number-of-occurrences
 
 
121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stock
 
 
124-binary-tree-maximum-path-sum
124-binary-tree-maximum-path-sum
 
 
125-valid-palindrome
125-valid-palindrome
 
 
1268-search-suggestions-system
1268-search-suggestions-system
 
 
128-longest-consecutive-sequence
128-longest-consecutive-sequence
 
 
1291-sequential-digits
1291-sequential-digits
 
 
13-roman-to-integer
13-roman-to-integer
 
 
1305-all-elements-in-two-binary-search-trees
1305-all-elements-in-two-binary-search-trees
 
 
1337-the-k-weakest-rows-in-a-matrix
1337-the-k-weakest-rows-in-a-matrix
 
 
1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
 
 
136-single-number
136-single-number
 
 
138-copy-list-with-random-pointer
138-copy-list-with-random-pointer
 
 
140-word-break-ii
140-word-break-ii
 
 
141-linked-list-cycle
141-linked-list-cycle
 
 
142-linked-list-cycle-ii
142-linked-list-cycle-ii
 
 
1448-count-good-nodes-in-binary-tree
1448-count-good-nodes-in-binary-tree
 
 
146-lru-cache
146-lru-cache
 
 
15-3sum
15-3sum
 
 
150-evaluate-reverse-polish-notation
150-evaluate-reverse-polish-notation
 
 
152-maximum-product-subarray
152-maximum-product-subarray
 
 
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
 
 
1578-minimum-time-to-make-rope-colorful
1578-minimum-time-to-make-rope-colorful
 
 
16-3sum-closest
16-3sum-closest
 
 
160-intersection-of-two-linked-lists
160-intersection-of-two-linked-lists
 
 
1614-maximum-nesting-depth-of-the-parentheses
1614-maximum-nesting-depth-of-the-parentheses
 
 
1644-lowest-common-ancestor-of-a-binary-tree-ii
1644-lowest-common-ancestor-of-a-binary-tree-ii
 
 
1657-determine-if-two-strings-are-close
1657-determine-if-two-strings-are-close
 
 
167-two-sum-ii-input-array-is-sorted
167-two-sum-ii-input-array-is-sorted
 
 
1672-richest-customer-wealth
1672-richest-customer-wealth
 
 
169-majority-element
169-majority-element
 
 
1695-maximum-erasure-value
1695-maximum-erasure-value
 
 
17-letter-combinations-of-a-phone-number
17-letter-combinations-of-a-phone-number
 
 
1704-determine-if-string-halves-are-alike
1704-determine-if-string-halves-are-alike
 
 
173-binary-search-tree-iterator
173-binary-search-tree-iterator
 
 
1763-longest-nice-substring
1763-longest-nice-substring
 
 
1832-check-if-the-sentence-is-pangram
1832-check-if-the-sentence-is-pangram
 
 
1876-substrings-of-size-three-with-distinct-characters
1876-substrings-of-size-three-with-distinct-characters
 
 
189-rotate-array
189-rotate-array
 
 
198-house-robber
198-house-robber
 
 
1984-minimum-difference-between-highest-and-lowest-of-k-scores
1984-minimum-difference-between-highest-and-lowest-of-k-scores
 
 
199-binary-tree-right-side-view
199-binary-tree-right-side-view
 
 
2-add-two-numbers
2-add-two-numbers
 
 
20-valid-parentheses
20-valid-parentheses
 
 
200-number-of-islands
200-number-of-islands
 
 
206-reverse-linked-list
206-reverse-linked-list
 
 
208-implement-trie-prefix-tree
208-implement-trie-prefix-tree
 
 
209-minimum-size-subarray-sum
209-minimum-size-subarray-sum
 
 
21-merge-two-sorted-lists
21-merge-two-sorted-lists
 
 
211-design-add-and-search-words-data-structure
211-design-add-and-search-words-data-structure
 
 
215-kth-largest-element-in-an-array
215-kth-largest-element-in-an-array
 
 
217-contains-duplicate
217-contains-duplicate
 
 
219-contains-duplicate-ii
219-contains-duplicate-ii
 
 
22-generate-parentheses
22-generate-parentheses
 
 
2225-find-players-with-zero-or-one-losses
2225-find-players-with-zero-or-one-losses
 
 
2256-minimum-average-difference
2256-minimum-average-difference
 
 
226-invert-binary-tree
226-invert-binary-tree
 
 
2269-find-the-k-beauty-of-a-number
2269-find-the-k-beauty-of-a-number
 
 
23-merge-k-sorted-lists
23-merge-k-sorted-lists
 
 
232-implement-queue-using-stacks
232-implement-queue-using-stacks
 
 
234-palindrome-linked-list
234-palindrome-linked-list
 
 
235-lowest-common-ancestor-of-a-binary-search-tree
235-lowest-common-ancestor-of-a-binary-search-tree
 
 
236-lowest-common-ancestor-of-a-binary-tree
236-lowest-common-ancestor-of-a-binary-tree
 
 
2379-minimum-recolors-to-get-k-consecutive-black-blocks
2379-minimum-recolors-to-get-k-consecutive-black-blocks
 
 
238-product-of-array-except-self
238-product-of-array-except-self
 
 
24-swap-nodes-in-pairs
24-swap-nodes-in-pairs
 
 
242-valid-anagram
242-valid-anagram
 
 
257-binary-tree-paths
257-binary-tree-paths
 
 
258-add-digits
258-add-digits
 
 
266-palindrome-permutation
266-palindrome-permutation
 
 
268-missing-number
268-missing-number
 
 
278-first-bad-version
278-first-bad-version
 
 
283-move-zeroes
283-move-zeroes
 
 

Repository files navigation

Algorithms

Data structures and algorithms in javascript for interview practice

Install Dependencies

npm install

Run Test Example

npm test anagrams/test.js

About

Data structures and algorithms in javascript for interview practice

Resources

Readme

License

MIT license
Activity

Stars

5 stars

Watchers

0 watching

Forks

2 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages