This project implements the K-Shortest Paths algorithm, which is used to find the k shortest paths between a pair of nodes in a weighted graph . Manacher's Algorithm, which is a linear time algorithm used to find the longest palindromic substring in a given string.