NeetCode #361LC-1209MediumStack
← Back to All Problems#361 · #1209 · Remove All Adjacent Duplicates in String II(删除字符串中的所有相邻重复项 II)
📌 Problem Statement & Constraints
Given a string
s and an integer k, repeatedly delete k adjacent equal characters until no more deletions are possible, and return the final string. Constraints: 1 <= s.length <= 10^5, 1 <= k <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!