Certain problems I like to practice to stay fresh in basic concepts. This document contains problems I like to practice whenever I feel rusty.
- rotate-image #48
- remove-duplicates-from-sorted-array #26
- remove-element #27
- trapping-rain-water #42
- surrounded-regions #130
- add-two-numbers #2
- remove-nth-node-from-end-of-list #19
- merge-two-sorted-lists #21
- rotate-list #61
- linked-list-cycle #141
- sort-list #148
- reverse-linked-list #206
- delete-node-in-a-linked-list #237
- merge-k-sorted-lists #23
- remove-linked-list-elements #203
- binary-tree-inorder-traversal #94
- binary-tree-preorder-traversal #144
- binary-tree-postorder-traversal #145
- binary-tree-level-order-traversal #102
- maximum-depth-of-binary-tree #104
- flatten-binary-tree-to-linked-list #114
- construct-binary-tree-from-preorder-and-inorder-traversal #105
- lowest-common-ancestor-of-a-binary-tree #236
- delete-node-in-a-bst #450
- kth-smallest-element-in-a-bst #230
- delete-node-in-a-bst #450
- validate-binary-search-tree #98
- longest-increasing-subsequence #300
- jump-game #55
- best-time-to-buy-and-sell-stock #121
- climbing-stairs #70
- pascals-triangle #118
- coin-change #322
- house-robber #198
- fibonacci-number #509
- longest-palindromic-substring
- add-binary #67
- reverse-bits #190
- hamming-distance #461
- counting-bits #338
- missing-number #268
- power-of-two #231
- subsets #78
- n-queens #51
- permutations #46
- combinations #77
- generate-parentheses #22
- sudoku-solver #37
- all-paths-from-source-to-target #797
- find-if-path-exists-in-graph #1971
- evaluate-division #399
- flood-fill #733
- number-of-islands #200
- word-ladder #127
- get-watched-videos-by-your-friends #1311
- longest-increasing-path-in-a-matrix #329
- network-time-delay #743
- path-with-maximum-minimum-value #1102
- path-with-minimum-effort #1631
- cheapest-flights-within-k-stops #787
- possible-bipartition #886
- course-schedule-ii #210
- number-of-connected-components-in-an-undirected-graph #323
- graph-valid-tree #261
- number-of-provinces #547
- remove-max-number-of-edges-to-keep-graph-fully-traversable #1579