This is a collection of interview questions that I saw.
- prime-check
- roman-numeral
- Three-number-sum
- Smallest-difference
- BST-construction
- validate-BST
- BST-traversal
- Invert-binary-tree
- Max-subset-sum-no-adjacent
- Number-of-ways-to-make-change
- min-number-of-coins-for-change
- levenshtein-distance
- kadane-algorithm
- single-cycle-check
- breadth-first-search
- river-sizes
- youngest-common-ancestor
- min-heap-construction
- remove-kth-node-from-end
- permutations
- powerset
- search-in-sorted-matrix
- balandec-brackets
- longest-palindromic-substring
- btoa-64-encryption
- island-numbers
- four-number-sum
- subarray-sort
- largest-range
- min-reward
- max-path-sum-binary-tree
- max-sum-increasing-subsequence
- longest-common-subsequence
- min-number-of-jumps
- water-area
- disk-stacking
- topological-sort
- boggle-board
- continuous-median
- find-loop
- lowest-common-manager
- shifted-binary-search
- search-for-range
- quick-select
- quick-sort
- heap-sort
- longest-substring-without-duplication
- underscorify-substring
- pattern-matches
- multi-string-search
- .