Algorithm · Meta · Hard
Two independent tasks are bundled into this question. The first measures how well you combine several already-ordered sequences into one ordered result while dropping repeated values, together with the cost analysis that goes with it. The second measures string parsing plus a search over possible edits, where the goal is to reach valid parenthesis arrangements using the fewest deletions. Part 1: Merging Three Ordered Lists Without Repetitions Three integer arrays a, b and c…
Checking your access…