First Round:

Q1: Reverse nodes in a linked list in groups of k

Q2: Find the minimum window substring containing all characters of another string.

Second Round:

Q1: Balanced parentheses problem, remove or count invalid ones

Q2: One medium-level string manipulation problem

Question

First Round:

Q1: Reverse nodes in a linked list in groups of k

Q2: Find the minimum window substring containing all characters of another string.

Second Round:

Q1: Balanced parentheses problem, remove or count invalid ones

Q2: One medium-level string manipulation problem

Sigiloso · Accepted Answer

I was able to answer all the questions in both rounds.

For each question, I first explained the brute-force approach.

Then I provided the optimized solution and explained the logic clearly.

Info Edge