In the Iterative with full matrix version of Levenshtein distance[5] we can avoid a lot of work if we can process the words in order, so we never need to repeat a row for the same prefix of letters[4] ...

I've had this assignment over my head for months. I didn't finish it on time for one of my classes, so I pretty much abandoned it- planning to come back to it after the semester and get things working ...

This repository contains my implementation of Trie (Prefix Tree) based problems in Java as part of my Data Structures & Algorithms practice. Trie is a powerful data structure used for efficient string ...