المسائل

سهل · Sorting

سهل · Math · Brute force

سهل · Brute force · Sorting

سهل · Dynamic programming

صعب جدًا · Dynamic programming

سهل · Greedy algorithms · String suffix structures

صعب جدًا · Brute force · Math

متوسط · Number theory · Prefix Sums · Prime factorization

سهل · Sorting · Hashing

صعب جدًا · Dynamic programming · Divide and Conquer · Data Structures · Bitmasks

صعب · Geometry · Binary Search

متوسط · Graphs · Shortest paths

سهل جدًا · Math

صعب · Dynamic programming · Combinatorics · Trees

صعب جدًا · Graphs · Number theory · Depth-first Search · Dynamic programming · Binary Search · Prefix Sums · Data Structures

صعب جدًا · Segment Tree · Data Structures

صعب · Breadth-first Search · Graphs · Binary Search

صعب جدًا · Dynamic programming · Graphs · Breadth-first Search · Dijkstra algorithm · Shortest paths

صعب · Binary Search · Hashing · Strings

صعب · Greedy algorithms · Sorting · Data Structures

صعب جدًا · Constructive Algorithms · Graphs · Breadth-first Search · Disjoint set union

سهل · Graphs

سهل جدًا · Implementation

سهل جدًا · Brute force

سهل جدًا · Brute force · Implementation