LAVACS KNOWLEDGE
Algorithms and data structures
Follow worked examples and complexity analysis to choose suitable algorithms and data structures.
Algorithms and data structures · Intermediate
Compute all-pairs distances with a matrix recurrence while respecting the intermediate-vertex invariant and negative-cycle scope.
Read and check your understanding →Algorithms and data structures · Intermediate
Use g+h priorities to guide shortest-path search, distinguishing admissibility, consistency and reopening requirements.
Read and check your understanding →Algorithms and data structures · Intermediate
Sort weighted edges and use disjoint sets to distinguish useful component joins from cycle-forming edges.
Read and check your understanding →Algorithms and data structures · Intermediate
Expand a weighted spanning tree using frontier-edge costs, and distinguish those priorities from accumulated shortest-path distances.
Read and check your understanding →Algorithms and data structures · Intermediate
Partition a directed graph by mutual reachability and use the acyclic condensation to reason about component-level dependencies.
Read and check your understanding →Algorithms and data structures · Intermediate
Build prefix-function fallback information to search without moving backward through the text and retain overlapping matches.
Read and check your understanding →Algorithms and data structures · Intermediate
Reuse an established prefix-match interval to build a Z array in linear time and locate a pattern with a safe separator.
Read and check your understanding →Algorithms and data structures · Intermediate
Update a fingerprint as a text window slides, then distinguish verified matches, collision risks and worst-case work.
Read and check your understanding →Algorithms and data structures · Intermediate
Order the suffixes of banana and use a contiguous matching interval, while separating index size from construction and comparison costs.
Read and check your understanding →Algorithms and data structures · Intermediate
Combine a keyword trie, failure links and output information to find multiple patterns, including suffix and overlapping matches.
Read and check your understanding →Algorithms and data structures · Intermediate
Compute insertion, deletion and substitution costs over prefixes, then distinguish distance-only memory savings from alignment reconstruction.
Read and check your understanding →Algorithms and data structures · Intermediate
Trace Huffman construction from symbol frequencies, then examine prefix decoding, weighted cost, implementation complexity and format overhead.
Read and check your understanding →Algorithms and data structures · Intermediate
Understand deque operations at both ends, implementation trade-offs, bounded behavior and why individually safe operations do not make compound workflows atomic.
Read and check your understanding →Algorithms and data structures · Intermediate
Trace circular-buffer head and tail indexes, distinguish empty from full, and examine wraparound, overflow and producer-consumer ordering assumptions.
Read and check your understanding →Algorithms and data structures · Intermediate
Understand AVL balance through insertion traces and rotations, including double rotations, metadata maintenance and deletion behavior.
Read and check your understanding →Algorithms and data structures · Intermediate
Follow red-black invariants through a small insertion trace, then distinguish recoloring, rotations, deletion repair and implementation variants.
Read and check your understanding →Algorithms and data structures · Intermediate
Trace predecessor links during insertion and deletion, separating randomized expectations from a fixed-height teaching implementation.
Read and check your understanding →Algorithms and data structures · Intermediate
Map set operations onto bits, mask bounded complements and compare dense universes with sparse large IDs.
Read and check your understanding →Algorithms and data structures · Intermediate
Copy only a point-update path and inspect range sums, shared references and lifetime conditions across retained versions.
Read and check your understanding →Algorithms and data structures · Intermediate
Derive a take-or-skip table and recover items, then examine update direction, pseudopolynomial cost and changed problem variants.
Read and check your understanding →Algorithms and data structures · Intermediate
Derive uniform inclusion with bounded storage, distinguishing seeded reproducibility, distribution observations and restart state.
Read and check your understanding →Algorithms and data structures · Intermediate
Track duplicate ranks and unexamined values while distinguishing input mutation, expected linear work and worst-case cost.
Read and check your understanding →Algorithms and data structures · Intermediate
Use shipping capacity to derive monotonic feasibility, a closed search interval, termination and the cost of each decision.
Read and check your understanding →Algorithms and data structures · Intermediate
Search sorted sequences without a known length, defining the end marker, stable reads and first-match boundary behavior.
Read and check your understanding →