1750. Minimum Length of String After Deleting Similar Ends

LeetCodeTwo PointersStringOpen on judge ↗

Given a string s consisting only of characters 'a', 'b', and 'c'. You are asked to apply the following algorithm on the string any number of times: - Pick a non-empty prefix from the string s where all the characters in the prefix are equal. - Pick a non-empty suffix from the string s where all the characters in this suffix are equal. - The prefix and the suffix should not intersect at any inde

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