Problemi

Mutation#966

Difficile · Greedy algorithms

Museum#967

Media · Dynamic programming

Distance between numbers#968

Difficile · Implementation · Brute force

Crisis#969

Facile · Dynamic programming

Pair of points#970

Molto difficile · Greedy algorithms · Graphs

Josephus problem#971

Media · Sorting

Sorting time#972

Facile · Sorting · Implementation

Maximum sum on a tree#973

Facile · Graphs · Depth-first Search

Floyd - 1#974

Facile · Dynamic programming · Shortest paths · Graphs

Floyd#975

Molto facile · Graphs

Floyd - existence#976

Facile · Graphs

Is it a Tree?#977

Molto facile · Trees · Graphs

Get a tree#978

Molto facile · Trees · Graphs · Depth-first Search

Frame-workout 1#979

Molto facile · Implementation · Brute force

Frame-workout 2#980

Molto facile · Brute force · Implementation

Minimum spanning tree#981

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

Connectivity#982

Molto facile · Graphs · Depth-first Search

Tree Edges Coloring#983

Facile · Graphs

Number of cycles#984

Media · Graphs

Scheduled Checking#985

Molto difficile · Graphs

Picking Numbers#986

Molto facile · Dynamic programming

Nails#987

Molto facile · Dynamic programming

Subsequence#988

Molto facile · Dynamic programming

Ladders#989

Molto facile · Dynamic programming

12345#990

Molto facile · Implementation

951-975 di 9226