Tematy

• Binary Search

  Brak zadań
• Bitmasks

  Brak zadań
• Bitsets

  Brak zadań

  Bitsets, bitmaps

• Bitwise Operations

  Brak zadań

  Bitwise "xor", "and", "or", "not", etc.

• Breadth-first Search

  Brak zadań
• Brute force

  Brak zadań
• Combinatorics

  Brak zadań
• Constructive Algorithms

  Brak zadań
• Data Structures

  Brak zadań

  Heaps, binary search trees, segment trees, hash tables, etc

• Depth-first Search

  Brak zadań

  Depth-first Search and similar algorithms

• Dijkstra algorithm

  Brak zadań
• Disjoint set union

  Brak zadań
• Dynamic programming

  Brak zadań
• Fenwick Tree

  Brak zadań
• For Beginners

  Brak zadań

  Beginners, Easy problems

• Geometry

  Brak zadań

  Geometry, computational geometry

• Graph matchings

  Brak zadań

  Graph matchings, König's theorem, vertex cover of bipartite graph

• Graphs

  Brak zadań
• Greedy algorithms

  Brak zadań
• Hashing

  Brak zadań

  Hashing, hashtables

• Implementation

  Brak zadań

  Implementation problems, programming technics, simulation

• Math

  Brak zadań

  Mathematics including integration, differential equations, etc

• Matrix

  Brak zadań

  Matrix multiplication, determinant, Cramer's rule, systems of linear equations

• Number theory

  Brak zadań

  Number theory: Euler function, GCD, divisibility, etc

• Prefix Function

  Brak zadań
• Prefix Sums

  Brak zadań
• Prime factorization

  Brak zadań
• Priority Queue

  Brak zadań
• Queries

  Brak zadań
• Scanline / Sweep Line

  Brak zadań
• Segment Tree

  Brak zadań
• Shortest paths

  Brak zadań

  Shortest paths on weighted and unweighted graphs

• Sorting

  Brak zadań

  Sortings, orderings

• Stacks

  Brak zadań

  Stack data structure

• Strings

  Brak zadań

  Prefix- and Z-functions, suffix structures, Knuth–Morris–Pratt algorithm, etc

• Trees

  Brak zadań
• Two pointers

  Brak zadań