Leetcode 1544. Make The String Great

Repeatedly remove adjacent pairs of the same letter in opposite cases (e.g., 'a' and 'A') until no such pairs remain, and return the resulting unique "good" string. This is a stack-like cancellation problem solvable by scanning and cancelling opposite-case neighbors.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1544. Make The String Great

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact