In this video we are solving Leetcode Problem # 1047: Remove Adjacent Duplicates in String II. This is a follow up from the first question in which we are allowed K characters in a row.
The solution is basically the same except we now have to track the # of characters in a row that we have used. The set up is very similar and is quite easy to follow if you understand the solution to the first problem.