Маселелер

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

951-975 / 9226