Search
⌘K

Leetcode 2472. Maximum Number of Non-overlapping Palindrome Substrings

Given a string s and integer k, choose the maximum number of non-overlapping substrings each of which is a palindrome of length at least k. This requires identifying all palindromic intervals and optimally selecting disjoint ones (n ≤ 2000), typically solved with interval/DP-style reasoning.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions
System Design Guided Practice
Exclusive content
Learn More
Questions
Meta SWE Interview QuestionsAmazon SWE Interview QuestionsGoogle SWE Interview QuestionsOpenAI SWE Interview QuestionsAnthropic SWE Interview QuestionsEngineering Manager (EM) Interview Questions
Learn
Learn System DesignLearn DSALearn BehavioralLearn ML System DesignLearn Low Level DesignGuided Practice
Links
FAQPricingGift PremiumHello Interview Premium
Legal
Terms and ConditionsPrivacy PolicySecurity
Contact
About UsProduct Support

7511 Greenwood Ave North Unit #4238 Seattle WA 98103

© 2026 Optick Labs Inc. All rights reserved.

Leetcode 2472. Maximum Number of Non-overlapping Palindrome Substrings | Hello Interview