1 repository
Algorithms that count all palindromic substrings in a string using dynamic programming.
Distinct from Substring Counting: Distinct from general substring counting: specifically counts palindromic substrings.
Explore 1 awesome GitHub repository matching software engineering & architecture · Palindromic Substring Counters. Refine with filters or upvote what's useful.
LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in
Ships a DP algorithm to count all palindromic substrings in a string.