LeetCode 0647 - Palindromic Substrings

Parent index: LeetCode 500 Problem Index MOC

Problem Metadata

• LeetCode URL: https://leetcode.com/problems/palindromic-substrings/
• Frontend ID: 647
• Difficulty: Medium
• Primary category: Dynamic Programming
• Source lists: NeetCode Practice, NeetCode Blind 75, NeetCode 150, NeetCode 250, Sean Prashad LeetCode Patterns

Related Algorithms

• Dynamic Programming
• DP State Identification
• Memoization vs Tabulation
• Two Pointers
• Sliding Window

Research Status

• Problem statement and constraints verified against the LeetCode page.
• Core algorithm explained in paper-style prose.
• Worked examples, edge cases, complexity proof, and pitfalls added.
• Solution variants linked back to the relevant algorithm notes.

See Also

• LeetCode 500 Problem Index MOC
• SWE Interview Preparation MOC