Longest Common Subsequence DP table animated: diagonal extensions on matches, max-of-neighbors otherwise, then the traceback that spells out the LCS.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
LCS Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Longest Common Subsequence DP table animated: diagonal extensions on matches, max-of-neighbors otherwise, then the traceback that spells out the LCS. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
0/1 Knapsack Visualizer: The 0/1 knapsack DP table animated cell by cell: skip-or-take decisions with the exact cells each value reads from, ending at the optimal bottom-right answer.
Open toolMatrix Chain Multiplication Visualizer: Interval DP animated: every split point k tried for every chain window, the cost table fills diagonal by diagonal, and the optimal parenthesization emerges.
Open tool| ∅ | A | B | A | B | C | |
|---|---|---|---|---|---|---|
| ∅ | 0 | 0 | 0 | 0 | 0 | 0 |
| A | 0 | 0 | 0 | 0 | 0 | 0 |
| B | 0 | 0 | 0 | 0 | 0 | 0 |
| A | 0 | 0 | 0 | 0 | 0 | 0 |
| B | 0 | 0 | 0 | 0 | 0 | 0 |
| D | 0 | 0 | 0 | 0 | 0 | 0 |
| A | 0 | 0 | 0 | 0 | 0 | 0 |
| B | 0 | 0 | 0 | 0 | 0 | 0 |
| A | 0 | 0 | 0 | 0 | 0 | 0 |
| C | 0 | 0 | 0 | 0 | 0 | 0 |
1LCS of "ABABDABAC" and "ABABC": dp[i][j] = longest common subsequence length of the first i chars vs first j chars. Row/column 0 are empty-string bases (0).
dp[0][*] = dp[*][0] = 0for i, j over both strings:if s[i] == t[j]:dp[i][j] = dp[i-1][j-1] + 1else:dp[i][j] = max(dp[i-1][j], dp[i][j-1])trace back for the sequence
The diff algorithm's heart: chars match → extend the diagonal; else take the best of skipping either side.
