2565. Subsequence With the Minimum Score

LeetCodeTwo PointersStringBinary SearchOpen on judge ↗

You are given two strings s and t. You are allowed to remove any number of characters from the string t. The score of the string is 0 if no characters are removed from the string t, otherwise: - Let left be the minimum index among all removed characters. - Let right be the maximum index among all removed characters. Then the score of the string is right - left + 1. Return the minimum possibl

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