Levenshtein distance is a metric for the distance between two strings. It is defined by three different types of edits: substitution, insertion, and deletion. The Levenshtein distance between two strings is the minimum number of edits to get from one string to the other. AdvertisementsRead more "Using Dynamic Programming to Calculate Levenshtein Distance in Java"
I’m starting to learn some Machine Learning (just learned Python). My first project is a simple machine learning addition program.Read more "Addition! (Python + Machine Learning)"
The Knapsack problem is a Dynamic Programming problem. We have to maximize the total value of the items, while making sure the total weight of the items is lower than a specific value. There are two variations to this problem:Read more "Recursive Memoization Knapsack in Java"
2D maze solver written in Java. Has a Swing GUI and it contains eight methods for solving mazes: BFS, DFS, Best-First BFS, Dijkstra’s, Bellman-Ford, Floyd-Warshall, A*, and simulate hand on right wall.Read more "Maze Solver"
Simple Sudoku solver written in Java and it has a Swing GUI.Read more "Sudoku Solver"