المسائل

صعب · Shortest paths · Graphs · Greedy algorithms

سهل جدًا · Math · Number theory

صعب · Brute force

سهل · Dynamic programming

سهل جدًا · Graphs · Graph network flows

صعب جدًا · Shortest paths · Graphs

صعب · Graphs · Graph network flows

صعب · Brute force · Dynamic programming

صعب · Graph matchings · Graphs

سهل · Graphs · Brute force

سهل جدًا · Dynamic programming · Combinatorics

سهل جدًا · Dynamic programming · Segment Tree

سهل جدًا · Sorting · Geometry

سهل جدًا · Data Structures · Implementation · Fenwick Tree

سهل جدًا · Graphs · Implementation

متوسط · Graphs

سهل جدًا · Brute force

صعب جدًا · Graphs · Graph matchings · Graph network flows · Greedy algorithms · Dynamic programming

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

متوسط · Binary Search · Greedy algorithms · Priority Queue

متوسط · Dynamic programming · Probabilities

متوسط · Expression parsing · Brute force · Combinatorics

صعب · Prefix Sums · Greedy algorithms

سهل · Sorting

صعب · Geometry · Math · Number theory