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.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.