Question d’entretien chez MathWorks

The second LeetCode-style question focused on a priority queue (heap).