समस्याएँ

आसान · Trees · Depth-first Search · Prefix Sums

बहुत कठिन · Segment Tree · Greedy algorithms · Dynamic programming

आसान · Segment Tree · Range queries

बहुत आसान · Brute force

मध्यम · Combinatorics · Number theory · Brute force

बहुत आसान · Greedy algorithms · Sorting · Implementation

कठिन · Meet-in-the-middle · Hashing · Strings

मध्यम · Brute force · Number theory · Combinatorics

कठिन · Sorting · Two pointers · Greedy algorithms · Binary Search

कठिन · Breadth-first Search · Dynamic programming · Shortest paths · Sorting · Graphs

कठिन · Dynamic programming · Prefix Sums

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

मध्यम · Strings · Stacks

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

मध्यम · Dynamic programming

आसान · Strings · Prefix Function · Data Structures · Stacks

मध्यम · Dynamic programming

आसान · Greedy algorithms · Priority Queue · Graphs

आसान · Dynamic programming · Fenwick Tree · Data Structures · Prefix Sums

कठिन · Strings · Hashing · Data Structures

बहुत कठिन · Divide and Conquer · Convex Hull · Data Structures

बहुत आसान · Brute force

कठिन · Greedy algorithms · Graphs · Shortest paths

बहुत आसान · Binary Search · Math · Two pointers

मध्यम · Bitmasks · Brute force · Shortest paths