المسائل

سهل جدًا · Sorting · Greedy algorithms

سهل جدًا · Brute force · String suffix structures

سهل جدًا · Graphs

سهل · Implementation

متوسط · Greedy algorithms · Sorting · Geometry

صعب · Dynamic programming · Combinatorics · Number theory

سهل · Graphs · Shortest paths

سهل جدًا · Dynamic programming · Prefix Sums

صعب · Trees · Depth-first Search · Combinatorics · Prefix Sums · Binary Search

صعب جدًا · Dynamic programming · Combinatorics · Greedy algorithms · Number theory · Stacks

سهل جدًا · Implementation

سهل جدًا · Implementation · Graphs

متوسط · Greedy algorithms · Prefix Sums

متوسط · Sorting · Greedy algorithms

سهل جدًا · Prefix Sums · Implementation

سهل · Graphs · Disjoint set union

سهل جدًا · Binary Search · Data Structures · Dynamic programming

صعب جدًا · Binary Search · Data Structures · Greedy algorithms · Sorting

صعب جدًا · Prefix Sums · Dynamic programming · Greedy algorithms · Scanline / Sweep Line

سهل · Prefix Sums · Dynamic programming

صعب جدًا · Trees · Dynamic programming · Combinatorics · Depth-first Search · Number theory

صعب جدًا · Dynamic programming · Dynamic Programming Optimization · Fenwick Tree · Segment Tree · Divide and Conquer

سهل جدًا · Geometry

سهل جدًا · Brute force

سهل جدًا · Sorting · Greedy algorithms