المسائل
Mutation#966
صعب · Greedy algorithms
Museum#967
متوسط · Dynamic programming
Distance between numbers#968
صعب · Implementation · Brute force
Crisis#969
سهل · Dynamic programming
Pair of points#970
صعب جدًا · Greedy algorithms · Graphs
Josephus problem#971
متوسط · Sorting
Sorting time#972
سهل · Sorting · Implementation
Maximum sum on a tree#973
سهل · Graphs · Depth-first Search
Floyd - 1#974
سهل · Dynamic programming · Shortest paths · Graphs
Floyd#975
سهل جدًا · Graphs
Floyd - existence#976
سهل · Graphs
Is it a Tree?#977
سهل جدًا · Trees · Graphs
Get a tree#978
سهل جدًا · Trees · Graphs · Depth-first Search
Frame-workout 1#979
سهل جدًا · Implementation · Brute force
Frame-workout 2#980
سهل جدًا · Brute force · Implementation
Minimum spanning tree#981
سهل · Graphs · Disjoint set union · Sorting · Greedy algorithms
Connectivity#982
سهل جدًا · Graphs · Depth-first Search
Tree Edges Coloring#983
سهل · Graphs
Number of cycles#984
متوسط · Graphs
Scheduled Checking#985
صعب جدًا · Graphs
Picking Numbers#986
سهل جدًا · Dynamic programming
Nails#987
سهل جدًا · Dynamic programming
Subsequence#988
سهل جدًا · Dynamic programming
Ladders#989
سهل جدًا · Dynamic programming
12345#990
سهل جدًا · Implementation