समस्याएँ

आसान · Implementation

मध्यम · Greedy algorithms · Sorting

मध्यम · Breadth-first Search · Graphs

कठिन · Greedy algorithms · Prefix Sums · Sorting · Data Structures

मध्यम · Greedy algorithms · String suffix structures

आसान · Dynamic programming · Graphs

कठिन · Dynamic programming

बहुत कठिन · Segment Tree · Sorting · Queries

बहुत कठिन · Trees · Depth-first Search · Data Structures · Divide and Conquer

आसान · Divide and Conquer · Math · Number theory

आसान · Implementation

बहुत आसान · Greedy algorithms · Prefix Sums

आसान · Sorting

कठिन · Sorting · Prefix Sums · Greedy algorithms

मध्यम · Greedy algorithms · Sorting · Prefix Sums · Two pointers

मध्यम · Trees · Depth-first Search

कठिन · Disjoint set union · Sorting · Greedy algorithms · Queries

बहुत आसान · Graphs

बहुत कठिन · Dynamic programming · Combinatorics · Number theory · Prefix Sums

आसान · Dynamic programming · Greedy algorithms

आसान · Graphs · Trees

कठिन · Greedy algorithms · Sorting · Scanline / Sweep Line · Data Structures · Combinatorics · Prefix Sums

बहुत आसान · Trees

बहुत आसान · Trees · Depth-first Search

बहुत आसान · Interactive