# Sequence

- [5. Longest Palindromic Substring](/leetcode/dynamic-programing/sequence/5.-longest-palindromic-substring.md)
- [1155. Number of Dice Rolls With Target Sum](/leetcode/dynamic-programing/sequence/1155.-number-of-dice-rolls-with-target-sum.md)
- [1027. Longest Arithmetic Subsequence](/leetcode/dynamic-programing/sequence/1027.-longest-arithmetic-subsequence.md)
- [1641. Count Sorted Vowel Strings](/leetcode/dynamic-programing/sequence/1641.-count-sorted-vowel-strings.md)
- [718. Maximum Length of Repeated Subarray](/leetcode/dynamic-programing/sequence/718.-maximum-length-of-repeated-subarray.md)
- [983. Minimum Cost For Tickets](/leetcode/dynamic-programing/sequence/983.-minimum-cost-for-tickets.md)
- [740. Delete and Earn](/leetcode/dynamic-programing/sequence/740.-delete-and-earn.md)
- [413. Arithmetic Slices](/leetcode/dynamic-programing/sequence/413.-arithmetic-slices.md)
- [790. Domino and Tromino Tiling](/leetcode/dynamic-programing/sequence/790.-domino-and-tromino-tiling.md)
- [53. Maximum Subarray (1)](/leetcode/dynamic-programing/sequence/53.-maximum-subarray.md)
- [1186. Maximum Subarray Sum with One Deletion](/leetcode/dynamic-programing/sequence/1186.-maximum-subarray-sum-with-one-deletion.md)
- [801. Minimum Swaps To Make Sequences Increasing](/leetcode/dynamic-programing/sequence/801.-minimum-swaps-to-make-sequences-increasing.md)
- [467. Unique Substrings in Wraparound String](/leetcode/dynamic-programing/sequence/467.-unique-substrings-in-wraparound-string.md)
- [787. Cheapest Flights Within K Stops](/leetcode/dynamic-programing/sequence/787.-cheapest-flights-within-k-stops.md)
- [1043. Partition Array for Maximum Sum](/leetcode/dynamic-programing/sequence/1043.-partition-array-for-maximum-sum.md)
- [837. New 21 Game](/leetcode/dynamic-programing/sequence/837.-new-21-game.md)
- [650. 2 Keys Keyboard](/leetcode/dynamic-programing/sequence/650.-2-keys-keyboard.md)
- [877. Stone Game](/leetcode/dynamic-programing/sequence/877.-stone-game.md)
- [1130. Minimum Cost Tree From Leaf Values](/leetcode/dynamic-programing/sequence/1130.-minimum-cost-tree-from-leaf-values.md)
- [813. Largest Sum of Averages](/leetcode/dynamic-programing/sequence/813.-largest-sum-of-averages.md)
- [1024. Video Stitching](/leetcode/dynamic-programing/sequence/1024.-video-stitching.md)
