CodeZilla
Annual flagship competitive programming contest testing algorithmic problem solving and speed.
Algorithmic problem solving, contest preparation, and ICPC regional training at BIT Mesra.
Core topic progression practiced by chapter problem solvers.
Syntax, fast I/O, control flow, functions, and memory basics in C++.
Vectors, pairs, sets, maps, priority queues, and iterators.
Big-O notation, amortized analysis, constraints, and operation counts.
Prefix sums, two pointers, sliding window, frequency hashing, and basic string manipulation.
State transitions, recursive trees, subsets, permutations, and pruning.
Binary search on answers, tree traversals, lowest common ancestor (LCA), and tree queries.
BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal/Prim MST, and Disjoint Set Union (DSU).
Memoization, iterative DP, 0/1 knapsack, longest common subsequence, and bitmask DP.
Segment trees with lazy propagation, Fenwick trees, number theory, and string hashes.
Virtual contests, live rounds, debugging under pressure, and upsolution discipline.
3-person team synergy, problem triage, stress testing, and mock regionals.
Premier platform for rated algorithmic rounds (Div. 1/2/3/4) and community problem sets.
A rigorously organized collection of classic algorithmic problems covering core topics.
Clean, high-quality problem statements with excellent Beginner (ABC) and Regular (ARC) contests.
Regular Starters and division contests tailored for collegiate problem solvers.
Annual flagship competitive programming contest testing algorithmic problem solving and speed.
Monthly algorithmic sprint for continuous problem-solving practice and peer benchmarking.
Team contest simulation with ACM ICPC style team coordination and problem prioritization.
A modern, free interview preparation platform featuring curated problem collections (Blind 75, Grind 169), pattern-based roadmaps (Sliding Window, Two Pointers, Monotonic Stack, Dynamic Programming), and multi-language solutions with step-by-step intuition.
The definitive 455+ problem step-by-step master curriculum for engineering students. Spans foundational mathematics, arrays, binary search, linked lists, recursion, trees, graphs, and advanced dynamic programming with video lectures and editorial code.
A structured prerequisite graph of 150 essential LeetCode problems categorized by topic, accompanied by clean video walkthroughs, space-time complexity analysis, and pattern categorization.
The benchmark collection of 300 algorithmic problems curated by Antti Laaksonen at the University of Helsinki. High-density, no-fluff problems covering sorting, searching, DP, graph theory, range queries, and tree algorithms.
The original curated list of 75 algorithmic challenges distilled by tech leads to build core pattern intuition without solving hundreds of repetitive problems.
A free collection of curated, high-quality competitive programming resources from Bronze to Platinum created by former Olympiad finalists. Features comprehensive guides, hints, and practice problems.
The definitive English translation of the E-Maxx algorithms knowledge base. Rigorous mathematical descriptions and verified C++ implementations for number theory, combinatorics, graph theory, and string algorithms.
26 classic problems (A through Z) designed specifically to build intuition across dynamic programming paradigms: from basic 1D DP to digit DP, tree DP, and matrix exponentiation.
The world's leading competitive programming contest arena. Practice thousands of rated problems filtered by difficulty rating (800 to 3500) and study peer editorials.