Graph Traversals: Node Exploration, Matrices, and Shortest Paths
Understand adjacency list representations versus matrices, Breadth-First Search (BFS) shortest paths, and Depth-First Search (DFS) topological sorting.
CATEGORY
10 articles in DSA.
Understand adjacency list representations versus matrices, Breadth-First Search (BFS) shortest paths, and Depth-First Search (DFS) topological sorting.
Deep dive into hash functions, cryptographic vs non-cryptographic hashes, collision resolution using chaining or open addressing, and load factor resizing.
Master the subtleties of binary search index management, avoiding infinite loops, computing lower/upper bounds, and searching through monotonic decision spaces.
Master sorting algorithms including Quicksort, Mergesort, and Timsort. Learn time complexities, memory trade-offs, stability, and non-comparison sorting techniques.
Master call stack recursion mechanics, base cases, state space search using backtracking, and dynamic programming optimization via memoization.
Explore hierarchical structures, pre-order/in-order/post-order traversals, Binary Search Tree properties, self-balancing trees, and Tries.
Master queue behavior, implementation trade-offs using Circular Arrays versus Linked Lists, and how queues manage network traffic and system buffers.
Learn core stack properties, how to build them using dynamic arrays or linked lists, call stack memory mechanics, and the advanced Monotonic Stack algorithm pattern.
Understand singly and doubly linked list architectures, pointer manipulation, and step-by-step algorithms like linked list reversal and cycle detection.
Understand contiguous memory constraints, the complexity of indexing versus insertions, multidimensional memory layout, and how dynamic arrays scale behind the scenes.