Coach note
Coding questions test whether you can carry a problem from a vague spec to a working solution while talking through your decisions. Interviewers watch the process at least as much as the answer.
Coding · Data Structures
Implement a min-heap that supports standard operations plus a decreaseKey function in O(log n) time. Explain where this data structure is essential and why a balanced BST wouldn't suffice.
Type your answer
0of ~150 wordsAbout a minute spoken
Voice isn’t supported in this browser — type your answer in the box.
Create a free account to get more critiques.
Your answer appears here as you speak.