Implementation of some important algorithms

Here are some dynamic programming problem solutions.

No description provided.

All solutions to the problems in "Dynamic Programming I", the LeetCode dynamic programming study plan - I.

Manacher's algorithm

visited algorithms explanation and code

Solution to the "Longest Palindromic Substring" problem on LeetCode.

Python solution to find the longest palindromic substring in a given string. The program efficiently identifies the longest contiguous sequence of characters that reads the same forwards and backwards.