← All problemsSign in

1717. Maximum Score From Removing Substrings

LeetCodeStringStackGreedyOpen on judge ↗

You are given a string s and two integers x and y. You can perform two types of operations any number of times. - Remove substring "ab" and gain x points. - For example, when removing "ab" from "cabxbae" it becomes "cxbae". - Remove substring "ba" and gain y points. - For example, when removing "ba" from "cabxbae" it becomes "cabxe". Return the maximum points you can gain after applyin

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