समस्याएँ

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