8 posts · page 1 of 1
A comprehensive comparison of data structures — arrays vs linked lists, hash maps vs trees vs tries, heaps vs BSTs, stacks vs queues, sets vs Bloom filters, with decision flowcharts and complexity tables.
Master stack and queue patterns for LeetCode including monotonic stacks, min stacks, queue implementations, and practical templates.
Master Python's collections module with defaultdict, Counter, deque, namedtuple, and OrderedDict through practical, real-world examples.
Understand JavaScript WeakMap and WeakSet, their garbage collection behavior, and practical use cases like caching, private data, and DOM metadata.
Learn how Bloom filters work, why they use multiple hash functions, and where to apply them in caching, databases, and distributed systems.
A practical comparison of the C++ standard containers: vector, list, deque, map, unordered_map, set, and friends, with guidance on which to pick when.
Implement and understand the Fenwick tree, also called the binary indexed tree, for O(log n) prefix sums and point updates in just a few lines.
Learn segment trees for fast range sum, min, and max queries with point updates, including a clean iterative Python implementation.