標籤：Dynamic Programming | Hsing Yu = = We are the dreamers. We make it happen 'cause we can see it.

2026-01-08 Hard

1458. Max Dot Product of Two Subsequences

2026-01-03 Hard

1411. Number of Ways to Paint N 3 Grid

2024-04-25 Medium

2370. Longest Ideal Subsequence

2024-04-25 Easy

1137. N-th Tribonacci Number

2024-02-23 Medium

787. Cheapest Flights Within K Stops

2024-02-08 Medium

279. Perfect Squares

2024-02-03 Medium

1043. Partition Array for Maximum Sum

2024-01-27 Hard

629. K Inverse Pairs Array

2024-01-26 Medium

576. Out of Boundary Paths

2024-01-25 Medium

1143. Longest Common Subsequence