LeetCode
Experience
#3507 Minimum Pair Removal to Sort Array I
Interview Experience
LeetCode #3507: Minimum Pair Removal to Sort Array I. Difficulty: Easy. Topics: Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set. Asked at Google in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Hash Table
Arrays
Ordered Set
Simulation
Linked List
Sorting
Heap (Priority Queue)
Queue
Heap
Doubly-Linked List