Concept and algorithm deep-dives — the techniques and ideas behind the problems. 5 videos and counting.
Compute linear recurrences like Fibonacci in O(log n) by raising a transformation matrix to a power.
Preprocess a tree to answer ancestor and LCA queries in O(log n) using the binary lifting technique.
Time Limit Exceeded vs Memory Limit Exceeded — what causes each, and how to diagnose and fix them.
An honest look at what actually matters for landing engineering roles beyond grinding LeetCode.
Set up a clean, recruiter-friendly GitHub profile — no coding required.
