Starting CP
Problem optimization, longest sequences, knapsack problems
Programming Topics
Browse our comprehensive collection of programming topics. Each guide includes detailed explanations, examples, and practice questions.
Popular Topics
Bit Manipulation
Bit representation, operations, and optimization techniques
Shortest Paths
Bellman-Ford, Dijkstra's, and Floyd-Warshall algorithms
String Algorithms
Trie structure, string hashing, and pattern matching
Basic Techniques
Introduction to Programming
Programming languages, input/output, working with numbers
Operators
Arithmetic, assignment, comparison, and logical operators
Variables & Data Types
Understanding variables, primitive types, and type conversion
Conditional Statements
If/else statements, switch cases, and ternary operators
Loops
For loops, while loops, and loop control statements
Time Complexity
Understanding algorithm efficiency, calculation rules, complexity classes
Algorithms
Sorting Algorithms
Sorting theory, implementation and binary search techniques
Complete Search
Generating subsets, permutations, backtracking techniques
Greedy Algorithms
Coin problem, scheduling, tasks and deadlines, optimization
Dynamic Programming
Problem optimization, longest sequences, knapsack problems
Amortized Analysis
Two pointer methods, nearest elements, sliding window techniques
Range Queries
Static array queries, binary indexed trees, segment trees
Data Structures
Dynamic Arrays
Creating, accessing, and manipulating dynamic arrays
Set Structures
Working with sets, operations and implementation techniques
Map Structures
Key-value pairs, hash maps, and dictionary implementations
Bit Manipulation
Bit representation, operations, and optimization techniques
Advanced Data Structures
Iterators, ranges, and specialized data structures
Graph Algorithms
Basics of Graphs
Graph terminology and representation techniques
Graph Traversal
Depth-first search, breadth-first search and applications
Shortest Paths
Bellman-Ford, Dijkstra's, and Floyd-Warshall algorithms
Tree Algorithms
Tree traversal, diameter, paths and binary trees
Spanning Trees
Kruskal's algorithm, union-find, and Prim's algorithm
Directed Graphs
Topological sorting, dynamic programming, and cycle detection
Advanced Topics
Number Theory
Primes, factors, modular arithmetic and equation solving
Combinatorics
Binomial coefficients, Catalan numbers, inclusion-exclusion
Matrices
Matrix operations, linear recurrences and graph representations
Probability
Calculation, events, random variables and randomized algorithms
Game Theory
Game states, Nim game, and the Sprague-Grundy theorem
String Algorithms
Trie structure, string hashing, and pattern matching
Square Root Algorithms
Combining algorithms, integer partitions, and Mo's algorithm
Advanced Segment Trees
Lazy propagation, dynamic trees, and multi-dimensional structures
Computational Geometry
Complex numbers, points and lines, polygon area calculation
Sweep Line Algorithms
Intersection points, closest pair, and convex hull problems