Compute minimal line diffs with the longest common subsequence, then render them as unified-diff hunks with context, exactly like the tools reviewers already know.
Minimal diff
Split text into lines and compute a minimal edit script from a longest-common-subsequence table.
Unified hunks
Group changes into hunks with context lines and exact @@ headers, including empty ranges.
Big files
The LCS table is O(n·m) memory. Implement Myers' O((n+m)·D) algorithm for large, similar files.
Why building real projects teaches programming faster than tutorials and puzzles, how to choose the right project for your level, and how to structure the work like a job.
What Big-O tells you on the job: the costs of common operations, amortised O(1), inputs that trigger the worst case, memory as a cost, and when to measure instead of guessing.
Bookings, shifts, diff hunks and time slots are intervals. Use half-open ranges, test overlap with one comparison, check clashes in O(log n), merge overlapping intervals and find free gaps.
Dynamic programming explained with the problems it solves in real tools: the longest common subsequence behind diff, edit distance behind 'did you mean', and how to keep memory down.