Loading the journal
Step 1
Know these before you start
Tick what you already know
Concept videoWatch the concept video if the pattern is new to you.
Step 2
Try it on paper
5–10 minutes, no code yet
ProblemProblem statementGiven an array of integers, sort the array using the Heap Sort algorithm. This algorithm is an in-place comparison-based sort that uses a Binary Heap data structure.ReadHide
Problem Description
Given an array of integers, sort the array using the Heap Sort algorithm. This algorithm is an in-place comparison-based sort that uses a Binary Heap data structure.
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Solve it yourself before you look
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code · optimal solution
Revising this one?
- →Solve it from memory before peeking
- →Say the pattern out loud, not just the code
- →Explain it like you would to a friend
- →Try it again in a different language