MR CodeBlocks Problems Tracks Mock Tests Compiler

Login

// practice ground

Problems

#	Title	Topics	Difficulty
976	Persistent Segment Compression	Design Segment Tree	Hard
977	Two-Dimensional Interval Tree	Intervals Segment Tree	Hard
978	Mergeable Priority Queues	Design Heaps / Priority Queue	Hard
979	Fully Persistent Queue	Design Queues	Hard
980	Lock-Free Circular Buffer Simulation	Design Queues	Hard
981	External Memory Merge Planner	Design Sorting	Hard
982	Dynamic Graph Bipartiteness Queries	Graphs Union Find (Disjoint Set)	Hard
983	Online Bridge Detection	DFS Graphs	Hard
984	Dynamic Articulation Point Queries	DFS Graphs	Hard
985	Shortest Path Under Forbidden Vertices	BFS Graphs	Hard
986	Trie-Based Approximate String Matching	Strings Trie	Hard
987	Compressed Graph Reachability Index	Graphs Hashing	Medium
988	Multi-Version Disjoint Set Union	Design Union Find (Disjoint Set)	Hard
989	Adaptive Binary Search Strategy Optimizer	Binary Search Design	Hard
990	Dynamic Matrix Connectivity	Matrix Union Find (Disjoint Set)	Hard
991	Hierarchical Interval Index	Intervals Trees	Medium
992	Unified Search Structure Simulator	Design Searching	Hard
993	Kaprekar Number Check	Math	Easy
994	Graph Path Existence via DFS	DFS Graphs	Easy
995	Circular Dependency Detection in Assignments	Graphs Variables	Medium
996	Variable Scope Resolution Order	Trees Variables	Medium
997	Diagonal Zigzag Matrix Fill	Matrix Simulation	Medium
998	Shortest Escape from a Weighted Grid	Graphs Matrix	Medium
999	Multi-Exit Maze Shortest Path	BFS Graphs Matrix	Medium
1000	Operator Precedence Evaluator	Operators Strings	Medium

Showing 976–1000 of 1062

Prev 38 39 40 41 42 Next