How this tool computes its result
Compares two text blocks line-by-line using a dynamic-programming longest-common-subsequence (LCS) algorithm. The tool builds an n×m DP table where n and m are the line counts of the two inputs, filling it with suffix match lengths. It then backtracks through this table to classify each line as equal (present in both), added (in version B only), or removed (in version A only). The diff output renders in unified format (lines prefixed with "- ", "+ ", or two spaces for unchanged), and a summary panel tallies counts of added, removed, and unchanged lines across the entire comparison.
