LeetCode Experience

#3510 Minimum Pair Removal to Sort Array II

Interview Experience

LeetCode #3510: Minimum Pair Removal to Sort Array II. Difficulty: Hard. Topics: Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set. Asked at Amazon 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