Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 366 Bytes

README.md

File metadata and controls

5 lines (3 loc) · 366 Bytes

README

This is a proof of concept for how to use a problem I've seen referred to as "longest common substring" to display the diff between two different strings.

I was inspired to play around with this idea when I watched this video about how to use an academic CS concept called dynamic programming in real life.