feat(work): add Minimum Path Sum & Longest Common Subsequence solutions; refactor Unique Paths DP implementation

apps/docs/redirects.ts

@@ -17,6 +17,7 @@ export default [
   { from: "/49", to: "/hash-table/group-anagrams" },
   { from: "/54", to: "/matrix-index-math/spiral-matrix" },
   { from: "/62", to: "/multi-d-grid-dp/unique-paths" },
+  { from: "/64", to: "/multi-d-grid-dp/minimum-path-sum" },
   { from: "/70", to: "/1d-dynamic-programming/climbing-stairs" },
   { from: "/73", to: "/matrix-index-math/set-matrix-zeroes" },
   { from: "/74", to: "/binary-search/search-a-2d-matrix" },
@@ -70,6 +71,7 @@ export default [
   { from: "/973", to: "/heap-priority-queue/k-closest-points-to-origin" },
   { from: "/977", to: "/two-pointers/squares-of-a-sorted-array" },
   { from: "/994", to: "/graph-bfs/rotting-oranges" },
+  { from: "/1143", to: "/multi-d-grid-dp/longest-common-subsequence" },
   { from: "/1448", to: "/tree-bfs/count-good-nodes-in-binary-tree" },
   { from: "/1832", to: "/hash-table/check-if-the-sentence-is-pangram" },
 ];