Teme

• Binary Search

  Brez nalog
• Bitmasks

  Brez nalog
• Bitsets

  Brez nalog

  Bitsets, bitmaps

• Bitwise Operations

  Brez nalog

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

• Breadth-first Search

  Brez nalog
• Brute force

  Brez nalog
• Combinatorics

  Brez nalog
• Constructive Algorithms

  Brez nalog
• Data Structures

  Brez nalog

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

• Depth-first Search

  Brez nalog

  Depth-first Search and similar algorithms

• Dijkstra algorithm

  Brez nalog
• Disjoint set union

  Brez nalog
• Dynamic programming

  Brez nalog
• Fenwick Tree

  Brez nalog
• For Beginners

  Brez nalog

  Beginners, Easy problems

• Geometry

  Brez nalog

  Geometry, computational geometry

• Graph matchings

  Brez nalog

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

• Graphs

  Brez nalog
• Greedy algorithms

  Brez nalog
• Hashing

  Brez nalog

  Hashing, hashtables

• Implementation

  Brez nalog

  Implementation problems, programming technics, simulation

• Math

  Brez nalog

  Mathematics including integration, differential equations, etc

• Matrix

  Brez nalog

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

• Number theory

  Brez nalog

  Number theory: Euler function, GCD, divisibility, etc

• Prefix Function

  Brez nalog
• Prefix Sums

  Brez nalog
• Prime factorization

  Brez nalog
• Priority Queue

  Brez nalog
• Queries

  Brez nalog
• Scanline / Sweep Line

  Brez nalog
• Segment Tree

  Brez nalog
• Shortest paths

  Brez nalog

  Shortest paths on weighted and unweighted graphs

• Sorting

  Brez nalog

  Sortings, orderings

• Stacks

  Brez nalog

  Stack data structure

• Strings

  Brez nalog

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

• Trees

  Brez nalog
• Two pointers

  Brez nalog