Competitive Programming
Everything on SkillVeris tagged Competitive Programming — collected across the glossary, study notes, blog, and cheat sheets.
6 resources across 1 library
Interview Questions(6)
What is a Fenwick Tree (Binary Indexed Tree)?
A Fenwick tree, or binary indexed tree, is an array-backed structure that answers prefix-sum queries and supports point updates in O(log n) time using O(n) spa…
What is a Treap and How Does It Balance Itself?
A treap is a randomized binary search tree that combines BST ordering on keys with heap ordering on randomly assigned priorities, and the randomness alone keep…
What is Heavy-Light Decomposition?
Heavy-light decomposition splits a tree into vertical chains so that any root-to-node path crosses at most O(log n) chains, letting path queries (sum, max, upd…
What is the Sparse Table Technique?
A sparse table is a precomputed 2D array that answers range minimum, maximum, or GCD queries on a static array in O(1) time after O(n log n) preprocessing, by…
What is Mo's Algorithm?
Mo's algorithm answers many offline range queries on a static array efficiently by sorting queries into blocks of size sqrt(n) and moving a sliding [L, R] wind…
What is a Disjoint Sparse Table?
A disjoint sparse table is a variant of the sparse table that answers O(1) range queries for any associative operation — not just idempotent ones — by precompu…