Remove All Adjacent Duplicates in String II: coding question

Available question text

Given a string s and integer k, repeatedly remove any run of k equal adjacent characters until no more removals are possible and return the final string. The core challenge is to handle cascading deletions efficiently by tracking consecutive character counts (often via a stack of character-count pairs) rather than rescanning the string.

Continue with questions that share topics or the same question type.

Decode String
Coding · Recursion · Stack · String
Minimum Insertions to Balance a Parentheses String
Coding · Bracket Sequences · Greedy · Stack
Remove Duplicate Letters
Coding · Greedy · Monotonic Stack · Stack
Using a Robot to Print the Lexicographically Smallest String
Coding · Greedy · Hash Table · Stack

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 5 records

Amazon
Leetcode 1209. Remove All Adjacent Duplicates in String II
Reported Jun 25, 2026 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source
Apple
Leetcode 1209. Remove All Adjacent Duplicates in String II
Reported Oct 28, 2025 · 2 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 1209. Remove All Adjacent Duplicates in String II
Reported Sep 29, 2025 · 5 source reports
MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source
Salesforce
Leetcode 1209. Remove All Adjacent Duplicates in String II
Reported Nov 16, 2025 · 1 source report

Available question text

Remove All Adjacent Duplicates in String II

Available question text

Related questions

Remove All Adjacent Duplicates in String II

Available question text

Related questions