Probleme

Mutation#966

Dificil · Greedy algorithms

Museum#967

Mediu · Dynamic programming

Distance between numbers#968

Dificil · Implementation · Brute force

Crisis#969

Ușor · Dynamic programming

Pair of points#970

Foarte dificil · Greedy algorithms · Graphs

Josephus problem#971

Mediu · Sorting

Sorting time#972

Ușor · Sorting · Implementation

Maximum sum on a tree#973

Ușor · Graphs · Depth-first Search

Floyd - 1#974

Ușor · Dynamic programming · Shortest paths · Graphs

Floyd#975

Foarte ușor · Graphs

Floyd - existence#976

Ușor · Graphs

Is it a Tree?#977

Foarte ușor · Trees · Graphs

Get a tree#978

Foarte ușor · Trees · Graphs · Depth-first Search

Frame-workout 1#979

Foarte ușor · Implementation · Brute force

Frame-workout 2#980

Foarte ușor · Brute force · Implementation

Minimum spanning tree#981

Ușor · Graphs · Disjoint set union · Sorting · Greedy algorithms

Connectivity#982

Foarte ușor · Graphs · Depth-first Search

Number of cycles#984

Mediu · Graphs

Scheduled Checking#985

Foarte dificil · Graphs

Picking Numbers#986

Foarte ușor · Dynamic programming

Nails#987

Foarte ușor · Dynamic programming

Subsequence#988

Foarte ușor · Dynamic programming

Ladders#989

Foarte ușor · Dynamic programming

12345#990

Foarte ușor · Implementation

951-975 din 9226