Blog
Technical writing on security, development, and infrastructure.
7 posts- Understanding Heaps: Trees, Arrays, and Priority Queues
A ground-up tour of the heap data structure — from binary tree rules and array indexing to insertion, deletion, heapify, and heap sort — based on Abdul Bari's lectures.
- The Backend Developer's Edge in Security
Building servers teaches you exactly where they break. Backend development and security testing are the same skill set viewed from opposite directions.
- LeetCode Quest: DSA — Heap (Sequence Valley)
Last Stone Weight: from a sort-each-iteration brute force to building a max-heap from scratch in TypeScript, with every bug and lesson along the way.
- LeetCode Quest: DSA — Array I (Linear Shoal)
Working through the Array I unit of LeetCode's Data Structures & Algorithms Quest — concatenation, interleaving, and streak-counting, with a look at when a two-pointer is cleaner than a for-loop.
- LeetCode Quest: DSA — Array II (Linear Shoal)
The Array II unit of LeetCode's DSA Quest — finding duplicates and missing numbers, counting smaller elements with prefix sums, and the in-place negation trick for O(1) space disappearance detection.
- LeetCode Quest: DSA — Stack (Linear Shoal)
The Stack unit of LeetCode's DSA Quest — simulating stack operations on a stream, evaluating Reverse Polish Notation three ways, and tracking exclusive CPU time with an interval-accounting stack.
- Grid Equalization: Median, Modular Arithmetic, and Quickselect
A walkthrough of LeetCode 2033 — why modular arithmetic determines feasibility, why the median is the optimal target, and what a Quickselect-based solution would look like.