Interview Prep

DS/Algo:

Topics:

Dynamic programming:

1. Edit distance: https://leetcode.com/problems/edit-distance/
2. Word Break 2: https://leetcode.com/problems/word-break-ii/
3. Word Break: https://leetcode.com/problems/word-break/
4. Longest increasing path in matrix: https://leetcode.com/problems/longest-increasing-path-in-a-matrix/
5. Regular expression matching: https://leetcode.com/problems/regular-expression-matching/
6. Minimum cost for tickets: https://leetcode.com/problems/minimum-cost-for-tickets/
7. Knight Dialer: https://leetcode.com/problems/knight-dialer/

Hashtables:

1. Verifying Alien dict: https://leetcode.com/problems/verifying-an-alien-dictionary/
2. Group shifted strings: https://leetcode.com/problems/group-shifted-strings/
3. LRU cache: https://leetcode.com/problems/lru-cache/

Stack:

1. Min remove for valid paranthesis: https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/
2. Buildings with Ocean view: https://leetcode.com/problems/buildings-with-an-ocean-view/
3. Min Add to make paranthesis valid: https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
4. Simplify path: https://leetcode.com/problems/simplify-path/
5. Remove adj characters in a string: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/
6. Remove adj characters in a string 2: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/

Binary search:

1. Left most col with at least one: https://leetcode.com/problems/leftmost-column-with-at-least-a-one/
2. Random pick by weight: https://leetcode.com/problems/random-pick-with-weight/
3. Pow(x, n): https://leetcode.com/problems/powx-n/
4. Find peak element: https://leetcode.com/problems/find-peak-element/
5. Kth missing positive num: https://leetcode.com/problems/kth-missing-positive-number/
6. First and last position in sorted array: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
7. Find k closest elements: https://leetcode.com/problems/find-k-closest-elements/
8. Balance Binary search tree: https://leetcode.com/problems/balance-a-binary-search-tree/

Heaps:

1. Find k closest points to origin: https://leetcode.com/problems/k-closest-points-to-origin/
2. Kth Largest elements: https://leetcode.com/problems/kth-largest-element-in-an-array/
3. Merge K sorted lists: https://leetcode.com/problems/merge-k-sorted-lists/
4. Top K freq elements: https://leetcode.com/problems/top-k-frequent-elements/

Arrays:

1. Add Strings: https://leetcode.com/problems/add-strings/
2. Product of Array Except Self:
3. Valid palindrome: https://leetcode.com/problems/valid-palindrome/
4. Valid palindrome II: https://leetcode.com/problems/valid-palindrome-ii/
5. Next permutation: https://leetcode.com/problems/next-permutation/
6. Interval list intersection: https://leetcode.com/problems/interval-list-intersections/
7. Merge sorted array: https://leetcode.com/problems/merge-sorted-array/
8. Trapping rain water: https://leetcode.com/problems/trapping-rain-water/
9. Add binary: https://leetcode.com/problems/add-binary/
10. Monotnic array: https://leetcode.com/problems/monotonic-array/
11. Sub array sum equals k: https://leetcode.com/problems/subarray-sum-equals-k/
12. K-diff pairs in an array: https://leetcode.com/problems/k-diff-pairs-in-an-array/
13. Split array with equal sums: https://leetcode.com/problems/split-array-with-equal-sum/

Strings:

1. Valid word abbreviation: https://leetcode.com/problems/valid-word-abbreviation/
2. Custom sort string: https://leetcode.com/problems/custom-sort-string/
3. Valid anagram: https://leetcode.com/problems/valid-anagram/
4. Palindome permute: https://leetcode.com/problems/palindrome-permutation/
5. Add bold tag in string: https://leetcode.com/problems/add-bold-tag-in-string/
6. Permutation in a string: https://leetcode.com/problems/permutation-in-string/
7. Minimum window substring: https://leetcode.com/problems/minimum-window-substring/

Trees:

1. Range Sum BST: https://leetcode.com/problems/range-sum-of-bst/
2. Right side view of B-Tree: https://leetcode.com/problems/binary-tree-right-side-view/
3. Convert Binary tree to DLL: https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/
4. B-Tree Vertical order traversal: https://leetcode.com/problems/binary-tree-vertical-order-traversal/
5. Diameter of B-tree: https://leetcode.com/problems/diameter-of-binary-tree/
6. B-Tree max path sum: https://leetcode.com/problems/binary-tree-maximum-path-sum/
7. BST iterator: https://leetcode.com/problems/binary-search-tree-iterator/
8. Closest BST value: https://leetcode.com/problems/closest-binary-search-tree-value/
9. Serialize and Deserialize B-Tree: https://leetcode.com/problems/serialize-and-deserialize-binary-tree/
10. Construct B-Tree from string: https://leetcode.com/problems/construct-binary-tree-from-string/
11. Lowest common ancestor in B-tree: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
12. Maximum difference between nodes and ancestors: https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/
13. All nodes distance k in B-tree: https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/
14. Balance BST: https://leetcode.com/problems/balance-a-binary-search-tree/
15. Smallest subtree with all deepest nodes: https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/

Algo:

1. Integer to english words: https://leetcode.com/problems/integer-to-english-words/
2. Valid Number: https://leetcode.com/problems/valid-number/
3. Expression Add operators: https://leetcode.com/problems/expression-add-operators/
4. Task scheduler: https://leetcode.com/problems/task-scheduler/
5. Maximum swap: https://leetcode.com/problems/maximum-swap/
6. Basic calc 2: https://leetcode.com/problems/basic-calculator-ii/
7. Strobogrammatic number: https://leetcode.com/problems/strobogrammatic-number/

Linked List:

1. Insert into sorted circular linked list: https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/
2. Copy list randome pointer: https://leetcode.com/problems/copy-list-with-random-pointer/
3. Swap nodes in pairs: https://leetcode.com/problems/swap-nodes-in-pairs/

Graphs/BFS/DFS:

1. Making a large island: https://leetcode.com/problems/making-a-large-island/
2. Remove invalid paranthesis: https://leetcode.com/problems/remove-invalid-parentheses/
3. Graph Bipartite: https://leetcode.com/problems/is-graph-bipartite/
4. Clone graph: https://leetcode.com/problems/clone-graph/
5. Walls and gates: https://leetcode.com/problems/walls-and-gates/
6. Course Schedule: https://leetcode.com/problems/course-schedule/
7. Min moves to move a box to target: https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/
8. Battleships in a board: https://leetcode.com/problems/battleships-in-a-board/
9. Robot room cleaner: https://leetcode.com/problems/robot-room-cleaner/
10. Shortest bridge: https://leetcode.com/problems/shortest-bridge/
11. Swim rising water: https://leetcode.com/problems/swim-in-rising-water/

Matrices

1. Diagonal traverse: https://leetcode.com/problems/diagonal-traverse/
2. Teoplitz matrix: https://leetcode.com/problems/toeplitz-matrix/
3. Maximal rectangle: https://leetcode.com/problems/maximal-rectangle/

Framework:

1. Repeat the question
2. Ask questions/assumptions
3. Explain the approach
4. Optimisation
5. Code
6. Test

Behavioral: data communication customer