← All problemsSign in

2430. Maximum Deletions on a String

LeetCodeStringDynamic ProgrammingRolling HashString MatchingHash FunctionOpen on judge ↗

You are given a string s consisting of only lowercase English letters. In one operation, you can: - Delete the entire string s, or - Delete the first i letters of s if the first i letters of s are equal to the following i letters in s, for any i in the range 1 <= i <= s.length / 2. For example, if s = "ababc", then in one operation, you could delete the first two letters of s to get "abc", sinc

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start