LeetCode Experience

#2344 Minimum Deletions to Make Array Divisible

Interview Experience

LeetCode #2344: Minimum Deletions to Make Array Divisible. Difficulty: Hard. Topics: Array, Math, Sorting, Heap (Priority Queue), Number Theory. 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

Heap (Priority Queue) Number Theory Arrays Heap Math Queue Sorting