Meseleler

Mutation#966

Kyn · Greedy algorithms

Museum#967

Orta · Dynamic programming

Distance between numbers#968

Kyn · Implementation · Brute force

Crisis#969

Ýeňil · Dynamic programming

Pair of points#970

Örän kyn · Greedy algorithms · Graphs

Josephus problem#971

Orta · Sorting

Sorting time#972

Ýeňil · Sorting · Implementation

Maximum sum on a tree#973

Ýeňil · Graphs · Depth-first Search

Floyd - 1#974

Ýeňil · Dynamic programming · Shortest paths · Graphs

Floyd#975

Örän ýeňil · Graphs

Floyd - existence#976

Ýeňil · Graphs

Is it a Tree?#977

Örän ýeňil · Trees · Graphs

Get a tree#978

Örän ýeňil · Trees · Graphs · Depth-first Search

Frame-workout 1#979

Örän ýeňil · Implementation · Brute force

Frame-workout 2#980

Örän ýeňil · Brute force · Implementation

Minimum spanning tree#981

Ýeňil · Graphs · Disjoint set union · Sorting · Greedy algorithms

Connectivity#982

Örän ýeňil · Graphs · Depth-first Search

Tree Edges Coloring#983

Ýeňil · Graphs

Number of cycles#984

Orta · Graphs

Scheduled Checking#985

Örän kyn · Graphs

Picking Numbers#986

Örän ýeňil · Dynamic programming

Nails#987

Örän ýeňil · Dynamic programming

Subsequence#988

Örän ýeňil · Dynamic programming

Ladders#989

Örän ýeňil · Dynamic programming

12345#990

Örän ýeňil · Implementation

951-975 / 9226