Writing / 63 entries
A public digital garden — bugs, breakthroughs, and the chaos of building things on the web.
Understand how to design and build a highly optimized prefix tree from scratch in Python.
Deep dive into constructing Pascal's Triangle with O(n^2) time and optimal memory efficiency in Python.
Efficient wildcard searching using an optimized Python Trie.
Use Kadane's Algorithm to find the maximum sum subarray in O(n) time with O(1) space.
Maximize water storage in a container using a Two-Pointer approach to achieve optimal O(n) time complexity.
Count set bits in O(k) time using Brian Kernighan's bit trick — where k is the number of 1-bits.
Peel the matrix layer by layer using four shrinking boundaries — a classic simulation problem.
A detailed breakdown of the DP string segmentation approach, optimizing for both speed and memory.