I have created a Typescript file for each Leetcode question I have solved and placed them in different folders.
Each folder is named after the type of the common solution that the questions in the folder have, although not every question solution I provided is solved with this common solution. The classification of these common solutions is mainly from some learning plans provided by the Leetcode platform.
I have listed my solutions below according to different solution types. You can search directly on them by name to find their locations if you are interested in some of the solutions.
(Folder name: dynamicProgramming)
dynamicProgramming/509-fibonacci-number.ts
dynamicProgramming/1137-tribonacci-number.ts
dynamicProgramming/70-climbing-stairs.ts
dynamicProgramming/746-min-cost-climbing-stairs.ts
dynamicProgramming/198-house-robber.ts
dynamicProgramming/213-house-robber-ii.ts
dynamicProgramming/740-delete-and-earn.ts
dynamicProgramming/55-jump-game.ts
dynamicProgramming/45-jump-game-ii.ts
dynamicProgramming/53-maximum-subarray.ts
dynamicProgramming/918-maximum-sum-circular-subarray.ts
dynamicProgramming/152-maximum-product-subarray.ts
dynamicProgramming/1567-maximum-length-of-subarray-with-positive-product.ts
dynamicProgramming/1014-best-sightseeing-pair.ts
dynamicProgramming/121-best-time-to-buy-and-sell-stock.ts
dynamicProgramming/122-best-time-to-buy-and-sell-stock-ii.ts
dynamicProgramming/309-best-time-to-buy-and-sell-stock-with-cooldown.ts
dynamicProgramming/714-best-time-to-buy-and-sell-stock-with-transaction-fee.ts
dynamicProgramming/139-word-break.ts
dynamicProgramming/42-trapping-rain-water.ts
dynamicProgramming/413-arithmetic-slices.ts
dynamicProgramming/91-decode-ways.ts
dynamicProgramming/264-ugly-number-ii.ts
dynamicProgramming/96-unique-binary-search-trees.ts
dynamicProgramming/118-pascals-triangle.ts
dynamicProgramming/119-pascals-triangle-ii.ts
dynamicProgramming/931-minimum-falling-path-sum.ts
dynamicProgramming/120-triangle.ts
dynamicProgramming/1314.matrix-block-sum.ts
dynamicProgramming/304-range-sum-query-2d-immutable.ts
dynamicProgramming/62-unique-paths.ts
dynamicProgramming/63-unique-paths-ii.ts
dynamicProgramming/64-minimum-path-sum.ts
dynamicProgramming/221-maximal-square.ts
dynamicProgramming/5-longest-palindromic-substring.ts
dynamicProgramming/516-longest-palindromic-subsequence.ts
dynamicProgramming/300.longest-increasing-subsequence.ts
dynamicProgramming/376-wiggle-subsequence.ts
dynamicProgramming/392-is-subsequence.ts
dynamicProgramming/1143-longest-common-subsequence.ts
dynamicProgramming/72-edit-distance.ts
dynamicProgramming/322-coin-change.ts
dynamicProgramming/279-perfect-squares.ts
The following problems might be related to the knapsack problem.
dynamicProgramming/518-coin-change.ts *
dynamicProgramming/377-combination-sum-iv.ts
dynamicProgramming/343-integer-break.ts
dynamicProgramming/279-perfect-squares.ts
(Folder name: dataStructure)
dataStructure/217-contains-duplicate.ts
dataStructure/1-two-sum.ts
dataStructure/88-merge-sorted-array.ts
dataStructure/350-intersection-of-two-arrays-ii.ts
dynamicProgramming/121-best-time-to-buy-and-sell-stock.ts
dataStructure/566-reshape-the-matrix
dynamicProgramming/118-pascals-triangle.ts
dataStructure/36-valid-sudoku.ts
dataStructure/73-set-matrix-zeroes.ts
dataStructure/383-ransom-note.ts
dataStructure/242-valid-anagram.ts
dataStructure/141-linked-list-cycle.ts
dataStructure/21-merge-two-sorted-lists.ts
dataStructure/203-remove-linked-list-elements.ts
dataStructure/206-reverse-linked-list.ts
dataSttructure/20-valid-parenthese.ts
dataStructure/144-binary-tree-preorder-traversal.ts
dataStructure/94-binary-tree-inorder-traversal.ts
dataStructure/145-binary-tree-postorder-traversal.ts
dataStructure/102-binary-tree-level-order-traversal.ts
dataStructure/104-maximum-depth-of-binary-tree.ts
dataStructure/101-symmetric-tree.ts
dataStructure/226-invert-binary-tree.ts
dataStructure/112-path-sum.ts
dataStructure/700-search-in-a-binary-search-tree.ts
dataStructure/701-insert-into-a-binary-search-tree.ts
dataStructure/702-validate-binary-search-tree
dataStructure/653-two-sum-iv-input-is-a-bst.ts
dataStructure/235-lowest-common-ancestor-of-a-binary-search-tree.ts
dataStructure/387-first-unique-character-in-a-string.ts
dataStructure/136-single-number.ts
dataStructure/169-majority-element.ts
dataStructure/15-3sum.ts
dataStructure/75-sort-colors.ts
dataStructure/56-merge-intervals.ts
(Folder name: unclassified)
unclassified/189-rotate-array.ts
unclassified/977-square-of-a-sorted-array.ts