Problems

Mutation#966

Hard · Greedy algorithms

Museum#967

Medium · Dynamic programming

Distance between numbers#968

Hard · Implementation · Brute force

Crisis#969

Easy · Dynamic programming

Pair of points#970

Very hard · Greedy algorithms · Graphs

Josephus problem#971

Medium · Sorting

Sorting time#972

Easy · Sorting · Implementation

Maximum sum on a tree#973

Easy · Graphs · Depth-first Search

Floyd - 1#974

Easy · Dynamic programming · Shortest paths · Graphs

Floyd#975

Very easy · Graphs

Floyd - existence#976

Easy · Graphs

Is it a Tree?#977

Very easy · Trees · Graphs

Get a tree#978

Very easy · Trees · Graphs · Depth-first Search

Frame-workout 1#979

Very easy · Implementation · Brute force

Frame-workout 2#980

Very easy · Brute force · Implementation

Minimum spanning tree#981

Easy · Graphs · Disjoint set union · Sorting · Greedy algorithms

Connectivity#982

Very easy · Graphs · Depth-first Search

Number of cycles#984

Medium · Graphs

Scheduled Checking#985

Very hard · Graphs

Picking Numbers#986

Very easy · Dynamic programming

Nails#987

Very easy · Dynamic programming

Subsequence#988

Very easy · Dynamic programming

Ladders#989

Very easy · Dynamic programming

12345#990

Very easy · Implementation

951-975 of 9226