Given an array of integers where adjacent elements may be identical, your task is to remove these adjacent pairs. If removing one pair creates a new pair, continue removing pairs until no more adjacent identical elements remain.
For example, in the array [1,2,2,1,3], the adjacent pair is (2,2). After removing this pair, the resulting array is [1,1,3]. A new pair appears, (1,1). After removing this pair, the resulting array is [3].
Examples:
- Input: [1,2,3,3,2,4,3] Expected Output: [1,4,3]
- Input: [1,2,3,3,2,1] Expected Output: []
- Input: [2,2,2] Expected Output: [2]
- Input: [1,1,2,2,3,3,4,4,5,5] Expected Output: []
- Input: [1,1,1,2,2,3,3,4,4,5,5] Expected Output: [1]
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers11
Suggested Problems
-
Return the 3n+1 sequence for n
8528 Solvers
-
The Goldbach Conjecture, Part 2
2418 Solvers
-
Number of 1s in the Binary Representation of a Number
484 Solvers
-
Detect a number and replace with two NaN's
200 Solvers
-
393 Solvers
More from this Author53
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Excellent problem again. Please keep 'em coming!