Always-open practice
All 700 problems
Browse by difficulty category — 7 tiers, 100 problems each. Core authored problems are marked; generated extras fill each tier for volume practice.
VERY EASY
100 problems
0/100 on this device
- set1-q1COREAdd Two NumbersVERY EASY
I/O & Arithmetic Basics
- set2-q1COREVowel or ConsonantVERY EASY
Conditionals & Strings Basics
- set3-q1COREArray SumVERY EASY
Arrays: Frequency, Min/Max, Search
- set4-q1COREIs Even (bitwise)VERY EASY
Bitwise Operations & Number Properties
- set5-q1CORESort AscendingVERY EASY
Sorting Fundamentals
- set6-q1COREDistance Between Two PointsVERY EASY
Basic Geometry
- set7-q1CORERange Sum Query (single)VERY EASY
Prefix Sums & Range Queries
- set8-q1COREMaximum Coins (largest first)VERY EASY
Greedy Algorithms — Introduction
- set9-q1COREBinary Search BasicVERY EASY
Binary Search — On Arrays and On the Answer
- set10-q1COREGCD of Two NumbersVERY EASY
Number Theory: GCD, LCM, Primes, Divisors
- set11-q1COREIs PalindromeVERY EASY
Strings — Intermediate
- set12-q1CORECount Connected ComponentsVERY EASY
Graphs — BFS/DFS Introduction
- set13-q1COREFibonacci (DP, not recursion)VERY EASY
Dynamic Programming — Introduction
- set14-q1COREFactorial Mod PVERY EASY
Combinatorics & Modular Math
- set15-q1COREMaximize Sum of Pairs (fixed pairs)VERY EASY
Advanced Greedy + Prefix Sums (World T20 X Team style)
- set16-q1COREMulti-Source BFS (Nearest Fire)VERY EASY
Advanced Graphs — Implicit Graphs & Multi-source
- set17-q1CORESum of Divisors FunctionVERY EASY
Advanced Number Theory
- set18-q1CORECoin Change — Minimum CoinsVERY EASY
Advanced Dynamic Programming
- set19-q1CORETicket Number (warm-up)VERY EASY
Mixed Practice Contest — Round A
- set20-q1COREArray Product Without DivisionVERY EASY
Final Mock Contest — Round B (Cumulative, hardest set)
- gen-t1-001Rafi's Threshold CheckVERY EASY
Conditionals
- gen-t1-002Arif's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-003Nabila's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-004Mim's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-005Meherun's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-006Mahi's Sign DetectorVERY EASY
Conditionals
- gen-t1-007Wasif's Threshold CheckVERY EASY
Conditionals
- gen-t1-008Rafi's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-009Shuvo's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-010Ayesha's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-011Nadia's Threshold CheckVERY EASY
Conditionals
- gen-t1-012Fahim's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-013Shanto's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-014Jui's Sign DetectorVERY EASY
Conditionals
- gen-t1-015Rina's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-016Mim's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-017Tanvir's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-018Antu's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-019Rina's Threshold CheckVERY EASY
Conditionals
- gen-t1-020Tanjil's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-021Priya's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-022Antu's Sign DetectorVERY EASY
Conditionals
- gen-t1-023Shuvo's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-024Mim's Threshold CheckVERY EASY
Conditionals
- gen-t1-025Tanvir's Sign DetectorVERY EASY
Conditionals
- gen-t1-026Shuvo's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-027Shanto's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-028Arif's Sign DetectorVERY EASY
Conditionals
- gen-t1-029Rezwan's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-030Antu's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-031Dip's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-032Arif's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-033Zayan's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-034Imran's Sign DetectorVERY EASY
Conditionals
- gen-t1-035Rakib's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-036Nadia's Sign DetectorVERY EASY
Conditionals
- gen-t1-037Ayesha's Threshold CheckVERY EASY
Conditionals
- gen-t1-038Zayan's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-039Rezwan's Threshold CheckVERY EASY
Conditionals
- gen-t1-040Ayesha's Sign DetectorVERY EASY
Conditionals
- gen-t1-041Kabir's Threshold CheckVERY EASY
Conditionals
- gen-t1-042Meherun's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-043Ayesha's Sign DetectorVERY EASY
Conditionals
- gen-t1-044Shanto's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-045Dip's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-046Nabila's Threshold CheckVERY EASY
Conditionals
- gen-t1-047Lamia's Sign DetectorVERY EASY
Conditionals
- gen-t1-048Tanvir's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-049Ayesha's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-050Dip's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-051Kabir's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-052Shanto's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-053Antu's Threshold CheckVERY EASY
Conditionals
- gen-t1-054Meherun's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-055Tanvir's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-056Lamia's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-057Mahi's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-058Nabila's Threshold CheckVERY EASY
Conditionals
- gen-t1-059Lamia's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-060Arif's Sign DetectorVERY EASY
Conditionals
- gen-t1-061Lamia's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-062Sabbir's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-063Rina's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-064Rezwan's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-065Rezwan's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-066Sabbir's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-067Priya's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-068Shanto's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-069Kabir's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-070Rakib's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-071Shanto's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-072Dip's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-073Nabila's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-074Antu's Average FinderVERY EASY
Basic Arithmetic
- gen-t1-075Mahi's Sign DetectorVERY EASY
Conditionals
- gen-t1-076Dip's Difference CheckerVERY EASY
Basic Arithmetic
- gen-t1-077Mim's Sign DetectorVERY EASY
Conditionals
- gen-t1-078Shuvo's Quick SumVERY EASY
Basic Arithmetic
- gen-t1-079Meherun's Sign DetectorVERY EASY
Conditionals
- gen-t1-080Meherun's Difference CheckerVERY EASY
Basic Arithmetic
EASY
100 problems
0/100 on this device
- set1-q2COREEven or OddEASY
I/O & Arithmetic Basics
- set2-q2COREString LengthEASY
Conditionals & Strings Basics
- set3-q2COREFind MaximumEASY
Arrays: Frequency, Min/Max, Search
- set4-q2CORECount Set BitsEASY
Bitwise Operations & Number Properties
- set5-q2COREKth SmallestEASY
Sorting Fundamentals
- set6-q2COREPoint Inside CircleEASY
Basic Geometry
- set7-q2COREMultiple Range Sum QueriesEASY
Prefix Sums & Range Queries
- set8-q2COREActivity SelectionEASY
Greedy Algorithms — Introduction
- set9-q2COREFirst and Last OccurrenceEASY
Binary Search — On Arrays and On the Answer
- set10-q2CORELCM of Two NumbersEASY
Number Theory: GCD, LCM, Primes, Divisors
- set11-q2CORECharacter FrequencyEASY
Strings — Intermediate
- set12-q2COREShortest Path in an Unweighted GraphEASY
Graphs — BFS/DFS Introduction
- set13-q2COREClimbing StairsEASY
Dynamic Programming — Introduction
- set14-q2COREnCr Mod PEASY
Combinatorics & Modular Math
- set15-q2COREMaximum Sum of Chosen Subset's Adjacent DifferencesEASY
Advanced Greedy + Prefix Sums (World T20 X Team style)
- set16-q2COREKnight's Minimum MovesEASY
Advanced Graphs — Implicit Graphs & Multi-source
- set17-q2COREEuler's Totient FunctionEASY
Advanced Number Theory
- set18-q2CORELongest Common SubsequenceEASY
Advanced Dynamic Programming
- set19-q2COREMinimum Deletions to Make Frequency UniqueEASY
Mixed Practice Contest — Round A
- set20-q2COREMedian in a StreamEASY
Final Mock Contest — Round B (Cumulative, hardest set)
- gen-t2-001Tanvir's Running Total BoardEASY
Array Basics
- gen-t2-002Nusrat's Vowel CounterEASY
String Basics
- gen-t2-003Meherun's Case ConverterEASY
String Basics
- gen-t2-004Wasif's Palindrome FilterEASY
String Basics
- gen-t2-005Tanvir's Running Total BoardEASY
Array Basics
- gen-t2-006Rina's Palindrome FilterEASY
String Basics
- gen-t2-007Tanjil's Case ConverterEASY
String Basics
- gen-t2-008Oindrila's Case ConverterEASY
String Basics
- gen-t2-009Nabila's Palindrome FilterEASY
String Basics
- gen-t2-010Shuvo's Vowel CounterEASY
String Basics
- gen-t2-011Rafi's Vowel CounterEASY
String Basics
- gen-t2-012Rakib's Running Total BoardEASY
Array Basics
- gen-t2-013Tanjil's Running Total BoardEASY
Array Basics
- gen-t2-014Nabila's Case ConverterEASY
String Basics
- gen-t2-015Priya's Running Total BoardEASY
Array Basics
- gen-t2-016Jui's Case ConverterEASY
String Basics
- gen-t2-017Farhan's Vowel CounterEASY
String Basics
- gen-t2-018Shuvo's Palindrome FilterEASY
String Basics
- gen-t2-019Nadia's Vowel CounterEASY
String Basics
- gen-t2-020Sabbir's Running Total BoardEASY
Array Basics
- gen-t2-021Rina's Case ConverterEASY
String Basics
- gen-t2-022Meherun's Minimum FinderEASY
Array Basics
- gen-t2-023Tanjil's Palindrome FilterEASY
String Basics
- gen-t2-024Oindrila's Minimum FinderEASY
Array Basics
- gen-t2-025Wasif's Vowel CounterEASY
String Basics
- gen-t2-026Tanjil's Palindrome FilterEASY
String Basics
- gen-t2-027Lamia's Running Total BoardEASY
Array Basics
- gen-t2-028Arif's Vowel CounterEASY
String Basics
- gen-t2-029Wasif's Case ConverterEASY
String Basics
- gen-t2-030Ayesha's Minimum FinderEASY
Array Basics
- gen-t2-031Farhan's Minimum FinderEASY
Array Basics
- gen-t2-032Tanvir's Running Total BoardEASY
Array Basics
- gen-t2-033Arif's Minimum FinderEASY
Array Basics
- gen-t2-034Zayan's Minimum FinderEASY
Array Basics
- gen-t2-035Dip's Running Total BoardEASY
Array Basics
- gen-t2-036Dip's Running Total BoardEASY
Array Basics
- gen-t2-037Jui's Vowel CounterEASY
String Basics
- gen-t2-038Tanjil's Palindrome FilterEASY
String Basics
- gen-t2-039Farhan's Minimum FinderEASY
Array Basics
- gen-t2-040Farhan's Case ConverterEASY
String Basics
- gen-t2-041Lamia's Palindrome FilterEASY
String Basics
- gen-t2-042Imran's Minimum FinderEASY
Array Basics
- gen-t2-043Mahi's Palindrome FilterEASY
String Basics
- gen-t2-044Nusrat's Running Total BoardEASY
Array Basics
- gen-t2-045Nadia's Minimum FinderEASY
Array Basics
- gen-t2-046Tanjil's Minimum FinderEASY
Array Basics
- gen-t2-047Nadia's Vowel CounterEASY
String Basics
- gen-t2-048Fahim's Case ConverterEASY
String Basics
- gen-t2-049Nabila's Palindrome FilterEASY
String Basics
- gen-t2-050Dip's Case ConverterEASY
String Basics
- gen-t2-051Nabila's Minimum FinderEASY
Array Basics
- gen-t2-052Dip's Case ConverterEASY
String Basics
- gen-t2-053Lamia's Vowel CounterEASY
String Basics
- gen-t2-054Rina's Running Total BoardEASY
Array Basics
- gen-t2-055Shuvo's Case ConverterEASY
String Basics
- gen-t2-056Nadia's Palindrome FilterEASY
String Basics
- gen-t2-057Mahi's Running Total BoardEASY
Array Basics
- gen-t2-058Sadia's Case ConverterEASY
String Basics
- gen-t2-059Priya's Vowel CounterEASY
String Basics
- gen-t2-060Sadia's Palindrome FilterEASY
String Basics
- gen-t2-061Lamia's Minimum FinderEASY
Array Basics
- gen-t2-062Oindrila's Running Total BoardEASY
Array Basics
- gen-t2-063Farhan's Palindrome FilterEASY
String Basics
- gen-t2-064Priya's Case ConverterEASY
String Basics
- gen-t2-065Mahi's Vowel CounterEASY
String Basics
- gen-t2-066Lamia's Case ConverterEASY
String Basics
- gen-t2-067Imran's Vowel CounterEASY
String Basics
- gen-t2-068Dip's Vowel CounterEASY
String Basics
- gen-t2-069Farhan's Case ConverterEASY
String Basics
- gen-t2-070Nusrat's Vowel CounterEASY
String Basics
- gen-t2-071Zayan's Running Total BoardEASY
Array Basics
- gen-t2-072Shuvo's Case ConverterEASY
String Basics
- gen-t2-073Shuvo's Vowel CounterEASY
String Basics
- gen-t2-074Rina's Minimum FinderEASY
Array Basics
- gen-t2-075Nabila's Palindrome FilterEASY
String Basics
- gen-t2-076Rakib's Running Total BoardEASY
Array Basics
- gen-t2-077Dip's Minimum FinderEASY
Array Basics
- gen-t2-078Rakib's Case ConverterEASY
String Basics
- gen-t2-079Shanto's Minimum FinderEASY
Array Basics
- gen-t2-080Rakib's Running Total BoardEASY
Array Basics
MEDIUM
100 problems
0/100 on this device
- set1-q3CORESimple InterestMEDIUM
I/O & Arithmetic Basics
- set2-q3COREReverse a StringMEDIUM
Conditionals & Strings Basics
- set3-q3CORECount OccurrencesMEDIUM
Arrays: Frequency, Min/Max, Search
- set4-q3CORESwap Without TempMEDIUM
Bitwise Operations & Number Properties
- set5-q3CORESort by Custom RuleMEDIUM
Sorting Fundamentals
- set6-q3CORERectangle Area & PerimeterMEDIUM
Basic Geometry
- set7-q3COREEquilibrium IndexMEDIUM
Prefix Sums & Range Queries
- set8-q3COREMinimum PlatformsMEDIUM
Greedy Algorithms — Introduction
- set9-q3CORESquare Root (integer floor)MEDIUM
Binary Search — On Arrays and On the Answer
- set10-q3COREPrime Check (fast)MEDIUM
Number Theory: GCD, LCM, Primes, Divisors
- set11-q3COREAnagram CheckMEDIUM
Strings — Intermediate
- set12-q3COREDetect a Cycle in an Undirected GraphMEDIUM
Graphs — BFS/DFS Introduction
- set13-q3CORE0/1 KnapsackMEDIUM
Dynamic Programming — Introduction
- set14-q3CORECount Arrangements with RepetitionMEDIUM
Combinatorics & Modular Math
- set15-q3COREWorld T20 X Team (full version)MEDIUM
Advanced Greedy + Prefix Sums (World T20 X Team style)
- set16-q3CORESHA75-style Full Reachability with PrecomputationMEDIUM
Advanced Graphs — Implicit Graphs & Multi-source
- set17-q3COREModular InverseMEDIUM
Advanced Number Theory
- set18-q3COREMatrix Chain Multiplication (min scalar multiplications)MEDIUM
Advanced Dynamic Programming
- set19-q3CORESmallest Window Containing All Characters of PatternMEDIUM
Mixed Practice Contest — Round A
- set20-q3COREMaximum GCD Subsequence + Range Team Query, CombinedMEDIUM
Final Mock Contest — Round B (Cumulative, hardest set)
- gen-t3-001Mahi's Mode FinderMEDIUM
Frequency Counting
- gen-t3-002Antu's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-003Mim's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-004Mahi's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-005Antu's Range TotalMEDIUM
Prefix Sums
- gen-t3-006Dip's Range TotalMEDIUM
Prefix Sums
- gen-t3-007Meherun's Median FinderMEDIUM
Sorting
- gen-t3-008Kabir's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-009Nadia's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-010Rafi's Range TotalMEDIUM
Prefix Sums
- gen-t3-011Zayan's Range TotalMEDIUM
Prefix Sums
- gen-t3-012Tanvir's Median FinderMEDIUM
Sorting
- gen-t3-013Shuvo's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-014Sadia's Median FinderMEDIUM
Sorting
- gen-t3-015Kabir's Mode FinderMEDIUM
Frequency Counting
- gen-t3-016Antu's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-017Kabir's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-018Imran's Range TotalMEDIUM
Prefix Sums
- gen-t3-019Sadia's Median FinderMEDIUM
Sorting
- gen-t3-020Lamia's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-021Zayan's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-022Wasif's Median FinderMEDIUM
Sorting
- gen-t3-023Nabila's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-024Shuvo's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-025Oindrila's Median FinderMEDIUM
Sorting
- gen-t3-026Zayan's Range TotalMEDIUM
Prefix Sums
- gen-t3-027Meherun's Mode FinderMEDIUM
Frequency Counting
- gen-t3-028Tanjil's Range TotalMEDIUM
Prefix Sums
- gen-t3-029Priya's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-030Imran's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-031Imran's Range TotalMEDIUM
Prefix Sums
- gen-t3-032Dip's Mode FinderMEDIUM
Frequency Counting
- gen-t3-033Arif's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-034Sadia's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-035Farhan's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-036Nabila's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-037Nabila's Mode FinderMEDIUM
Frequency Counting
- gen-t3-038Priya's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-039Rina's Median FinderMEDIUM
Sorting
- gen-t3-040Sadia's Median FinderMEDIUM
Sorting
- gen-t3-041Wasif's Median FinderMEDIUM
Sorting
- gen-t3-042Sabbir's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-043Nadia's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-044Nusrat's Mode FinderMEDIUM
Frequency Counting
- gen-t3-045Oindrila's Median FinderMEDIUM
Sorting
- gen-t3-046Rafi's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-047Farhan's Mode FinderMEDIUM
Frequency Counting
- gen-t3-048Kabir's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-049Shanto's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-050Jui's Median FinderMEDIUM
Sorting
- gen-t3-051Ayesha's Range TotalMEDIUM
Prefix Sums
- gen-t3-052Imran's Median FinderMEDIUM
Sorting
- gen-t3-053Lamia's Range TotalMEDIUM
Prefix Sums
- gen-t3-054Imran's Range TotalMEDIUM
Prefix Sums
- gen-t3-055Sadia's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-056Oindrila's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-057Mim's Median FinderMEDIUM
Sorting
- gen-t3-058Rezwan's Duplicate DetectorMEDIUM
Arrays & Sorting
- gen-t3-059Shanto's Median FinderMEDIUM
Sorting
- gen-t3-060Rezwan's Range TotalMEDIUM
Prefix Sums
- gen-t3-061Sabbir's Mode FinderMEDIUM
Frequency Counting
- gen-t3-062Nabila's Mode FinderMEDIUM
Frequency Counting
- gen-t3-063Meherun's Median FinderMEDIUM
Sorting
- gen-t3-064Jui's Median FinderMEDIUM
Sorting
- gen-t3-065Shanto's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-066Fahim's Median FinderMEDIUM
Sorting
- gen-t3-067Fahim's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-068Tanvir's Range TotalMEDIUM
Prefix Sums
- gen-t3-069Kabir's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-070Kabir's Mode FinderMEDIUM
Frequency Counting
- gen-t3-071Rina's Pair Sum CheckMEDIUM
Two Pointers
- gen-t3-072Rafi's Mode FinderMEDIUM
Frequency Counting
- gen-t3-073Nadia's Median FinderMEDIUM
Sorting
- gen-t3-074Tanjil's Median FinderMEDIUM
Sorting
- gen-t3-075Nusrat's Median FinderMEDIUM
Sorting
- gen-t3-076Nadia's Range TotalMEDIUM
Prefix Sums
- gen-t3-077Dip's Mode FinderMEDIUM
Frequency Counting
- gen-t3-078Nabila's Median FinderMEDIUM
Sorting
- gen-t3-079Shanto's Range TotalMEDIUM
Prefix Sums
- gen-t3-080Sadia's Pair Sum CheckMEDIUM
Two Pointers
MEDIUM-HARD
100 problems
0/100 on this device
- set1-q4CORELargest of ThreeMEDIUM-HARD
I/O & Arithmetic Basics
- set2-q4COREGrading SystemMEDIUM-HARD
Conditionals & Strings Basics
- set3-q4CORESecond Largest (distinct)MEDIUM-HARD
Arrays: Frequency, Min/Max, Search
- set4-q4COREPower of Two CheckMEDIUM-HARD
Bitwise Operations & Number Properties
- set5-q4COREMinimum Swaps to SortMEDIUM-HARD
Sorting Fundamentals
- set6-q4COREPoint Inside Axis-Aligned Rectangle (Multi-query)MEDIUM-HARD
Basic Geometry
- set7-q4COREDifference Array Range UpdatesMEDIUM-HARD
Prefix Sums & Range Queries
- set8-q4COREFractional KnapsackMEDIUM-HARD
Greedy Algorithms — Introduction
- set9-q4COREMinimize the Maximum (Painter's Partition style)MEDIUM-HARD
Binary Search — On Arrays and On the Answer
- set10-q4CORECount Divisors of Every Number up to N (Sieve style)MEDIUM-HARD
Number Theory: GCD, LCM, Primes, Divisors
- set11-q4CORELongest Substring Without Repeating CharactersMEDIUM-HARD
Strings — Intermediate
- set12-q4COREBipartite CheckMEDIUM-HARD
Graphs — BFS/DFS Introduction
- set13-q4CORELongest Increasing SubsequenceMEDIUM-HARD
Dynamic Programming — Introduction
- set14-q4COREModular ExponentiationMEDIUM-HARD
Combinatorics & Modular Math
- set15-q4COREMinimum Cost to Connect Sticks (via extremes, priority-queue idea)MEDIUM-HARD
Advanced Greedy + Prefix Sums (World T20 X Team style)
- set16-q4CORE0-1 BFS (Grid with Some Free Moves)MEDIUM-HARD
Advanced Graphs — Implicit Graphs & Multi-source
- set17-q4CORECount Pairs with a Given GCDMEDIUM-HARD
Advanced Number Theory
- set18-q4CORELongest Palindromic SubsequenceMEDIUM-HARD
Advanced Dynamic Programming
- set19-q4COREMaximum Product SubarrayMEDIUM-HARD
Mixed Practice Contest — Round A
- set20-q4COREShortest Path with Exactly K EdgesMEDIUM-HARD
Final Mock Contest — Round B (Cumulative, hardest set)
- gen-t4-001Shanto's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-002Sadia's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-003Arif's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-004Oindrila's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-005Nadia's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-006Arif's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-007Rina's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-008Zayan's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-009Nabila's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-010Jui's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-011Zayan's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-012Mahi's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-013Wasif's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-014Kabir's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-015Tanjil's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-016Nabila's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-017Mim's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-018Sabbir's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-019Tanvir's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-020Sadia's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-021Rafi's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-022Lamia's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-023Sabbir's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-024Sabbir's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-025Jui's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-026Shuvo's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-027Fahim's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-028Rafi's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-029Arif's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-030Fahim's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-031Tanjil's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-032Arif's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-033Fahim's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-034Nusrat's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-035Priya's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-036Arif's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-037Meherun's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-038Dip's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-039Meherun's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-040Wasif's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-041Imran's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-042Oindrila's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-043Mim's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-044Zayan's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-045Dip's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-046Tanvir's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-047Shuvo's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-048Tanvir's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-049Imran's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-050Rakib's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-051Antu's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-052Oindrila's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-053Imran's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-054Fahim's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-055Kabir's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-056Rezwan's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-057Zayan's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-058Zayan's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-059Antu's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-060Shuvo's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-061Tanjil's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-062Arif's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-063Tanvir's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-064Tanvir's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-065Rezwan's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-066Fahim's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-067Mim's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-068Rakib's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-069Zayan's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-070Kabir's Capacity PlannerMEDIUM-HARD
Binary Search
- gen-t4-071Oindrila's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-072Rina's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-073Meherun's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-074Tanjil's Meeting SchedulerMEDIUM-HARD
Greedy
- gen-t4-075Kabir's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-076Kabir's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-077Nadia's Coverage Zone CheckMEDIUM-HARD
Geometry
- gen-t4-078Nusrat's Best Streak FinderMEDIUM-HARD
Sliding Window
- gen-t4-079Kabir's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
- gen-t4-080Imran's Budget SplitMEDIUM-HARD
Prefix Sums + Greedy
HARD
100 problems
0/100 on this device
- set1-q5COREDigit Sum LoopHARD
I/O & Arithmetic Basics
- set2-q5COREBalanced Brackets (single type)HARD
Conditionals & Strings Basics
- set3-q5COREArray Has a Pair Summing to KHARD
Arrays: Frequency, Min/Max, Search
- set4-q5CORESingle Non-DuplicateHARD
Bitwise Operations & Number Properties
- set5-q5COREMerge Two Sorted Arrays In-Place-Style (K-way idea)HARD
Sorting Fundamentals
- set6-q5CORETriangle ClassificationHARD
Basic Geometry
- set7-q5COREMaximum Subarray Sum (Kadane's)HARD
Prefix Sums & Range Queries
- set8-q5COREJob Sequencing with DeadlinesHARD
Greedy Algorithms — Introduction
- set9-q5COREKth Smallest Element in a Sorted Matrix (via binary search on value)HARD
Binary Search — On Arrays and On the Answer
- set10-q5COREGCD of an Increasing Subsequence of Length K (mini version)HARD
Number Theory: GCD, LCM, Primes, Divisors
- set11-q5CORECount Distinct Substrings of a String of a Single Repeated CharacterHARD
Strings — Intermediate
- set12-q5COREReachability on a Jump Graph (SHA75-style)HARD
Graphs — BFS/DFS Introduction
- set13-q5COREEdit DistanceHARD
Dynamic Programming — Introduction
- set14-q5CORENumber of Ways to Tile a 2×N Board with 1×2 Dominoes, Modulo PHARD
Combinatorics & Modular Math
- set15-q5COREBalanced Partition (Minimize Difference)HARD
Advanced Greedy + Prefix Sums (World T20 X Team style)
- set16-q5COREShortest Cycle Through a Given Edge / Node (mini)HARD
Advanced Graphs — Implicit Graphs & Multi-source
- set17-q5COREMaximum GCD Subsequence of Length K (full version)HARD
Advanced Number Theory
- set18-q5COREMaximum GCD-LIS Combined (final boss, matches Problem J exactly)HARD
Advanced Dynamic Programming
- set19-q5COREK Closest Points to Origin, then Path FeasibilityHARD
Mixed Practice Contest — Round A
- set20-q5CORESegment Tree with Range Update + Range GCD QueryHARD
Final Mock Contest — Round B (Cumulative, hardest set)
- gen-t5-001Rafi's Common Factor FinderHARD
Number Theory
- gen-t5-002Rafi's Common Factor FinderHARD
Number Theory
- gen-t5-003Mahi's Common Factor FinderHARD
Number Theory
- gen-t5-004Shanto's Common Factor FinderHARD
Number Theory
- gen-t5-005Rafi's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-006Nusrat's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-007Tanvir's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-008Tanvir's Budget AllocationHARD
DP (Knapsack)
- gen-t5-009Sabbir's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-010Wasif's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-011Rina's Common Factor FinderHARD
Number Theory
- gen-t5-012Ayesha's Budget AllocationHARD
DP (Knapsack)
- gen-t5-013Tanvir's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-014Arif's Budget AllocationHARD
DP (Knapsack)
- gen-t5-015Mim's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-016Farhan's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-017Dip's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-018Zayan's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-019Ayesha's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-020Rina's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-021Oindrila's Budget AllocationHARD
DP (Knapsack)
- gen-t5-022Dip's Common Factor FinderHARD
Number Theory
- gen-t5-023Mim's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-024Imran's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-025Sabbir's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-026Ayesha's Common Factor FinderHARD
Number Theory
- gen-t5-027Oindrila's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-028Rafi's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-029Priya's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-030Rakib's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-031Meherun's Common Factor FinderHARD
Number Theory
- gen-t5-032Tanvir's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-033Zayan's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-034Shanto's Common Factor FinderHARD
Number Theory
- gen-t5-035Nusrat's Budget AllocationHARD
DP (Knapsack)
- gen-t5-036Antu's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-037Oindrila's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-038Rafi's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-039Fahim's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-040Jui's Common Factor FinderHARD
Number Theory
- gen-t5-041Tanvir's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-042Lamia's Budget AllocationHARD
DP (Knapsack)
- gen-t5-043Antu's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-044Antu's Common Factor FinderHARD
Number Theory
- gen-t5-045Rezwan's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-046Shuvo's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-047Tanvir's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-048Meherun's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-049Nabila's Common Factor FinderHARD
Number Theory
- gen-t5-050Rina's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-051Lamia's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-052Farhan's Longest Growth StreakHARD
Dynamic Programming
- gen-t5-053Imran's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-054Priya's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-055Wasif's Budget AllocationHARD
DP (Knapsack)
- gen-t5-056Ayesha's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-057Tanjil's Budget AllocationHARD
DP (Knapsack)
- gen-t5-058Sadia's Budget AllocationHARD
DP (Knapsack)
- gen-t5-059Shuvo's Common Factor FinderHARD
Number Theory
- gen-t5-060Arif's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-061Dip's Common Factor FinderHARD
Number Theory
- gen-t5-062Fahim's Budget AllocationHARD
DP (Knapsack)
- gen-t5-063Mim's Budget AllocationHARD
DP (Knapsack)
- gen-t5-064Tanvir's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-065Wasif's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-066Rina's Common Factor FinderHARD
Number Theory
- gen-t5-067Tanvir's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-068Imran's Budget AllocationHARD
DP (Knapsack)
- gen-t5-069Antu's Budget AllocationHARD
DP (Knapsack)
- gen-t5-070Rakib's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-071Wasif's Budget AllocationHARD
DP (Knapsack)
- gen-t5-072Sadia's Common Factor FinderHARD
Number Theory
- gen-t5-073Imran's Budget AllocationHARD
DP (Knapsack)
- gen-t5-074Arif's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-075Nadia's Common Factor FinderHARD
Number Theory
- gen-t5-076Mahi's Budget AllocationHARD
DP (Knapsack)
- gen-t5-077Sadia's Network Reach CheckerHARD
Graphs (BFS/DFS)
- gen-t5-078Lamia's Dependency Loop CheckHARD
Graphs (Cycle Detection)
- gen-t5-079Wasif's Budget AllocationHARD
DP (Knapsack)
- gen-t5-080Imran's Common Factor FinderHARD
Number Theory
VERY HARD
100 problems
0/100 on this device
- set1-q6COREBig Integer Addition (arbitrary precision)VERY HARD
I/O & Arithmetic Basics
- set2-q6COREMulti-Bracket Validity with Minimum Fix CostVERY HARD
Conditionals & Strings Basics
- set3-q6CORECount Triplets Summing to ZeroVERY HARD
Arrays: Frequency, Min/Max, Search
- set4-q6CORETwo Non-Duplicates (every other value appears twice)VERY HARD
Bitwise Operations & Number Properties
- set5-q6CORECount InversionsVERY HARD
Sorting Fundamentals
- set6-q6COREConvex Polygon Area (Shoelace Formula)VERY HARD
Basic Geometry
- set7-q6CORE2D Prefix Sum (Submatrix Sum Queries)VERY HARD
Prefix Sums & Range Queries
- set8-q6COREHuffman Encoding Total LengthVERY HARD
Greedy Algorithms — Introduction
- set9-q6COREAggressive Cows (Maximize Minimum Distance)VERY HARD
Binary Search — On Arrays and On the Answer
- set10-q6COREChinese Remainder Theorem (2 congruences)VERY HARD
Number Theory: GCD, LCM, Primes, Divisors
- set11-q6COREZ-Function / Pattern OccurrencesVERY HARD
Strings — Intermediate
- set12-q6CORENumber of Islands (Connected Components in a Grid)VERY HARD
Graphs — BFS/DFS Introduction
- set13-q6COREMaximum Sum Increasing Subsequence with ReconstructionVERY HARD
Dynamic Programming — Introduction
- set14-q6CORECatalan Number Application — Valid ParenthesizationsVERY HARD
Combinatorics & Modular Math
- set15-q6CORETask Scheduling with Cooldown (greedy + counting)VERY HARD
Advanced Greedy + Prefix Sums (World T20 X Team style)
- set16-q6COREDijkstra with Path Reconstruction on Large Sparse GraphVERY HARD
Advanced Graphs — Implicit Graphs & Multi-source
- set17-q6CORESum of GCDs of All SubarraysVERY HARD
Advanced Number Theory
- set18-q6CORELongest Increasing Subsequence With At Most One DeletionVERY HARD
Advanced Dynamic Programming
- set19-q6CORESliding Window Maximum, With Sum-of-Maximums TwistVERY HARD
Mixed Practice Contest — Round A
- set20-q6COREFinal Boss: Team Selection Under GCD Constraint (H + J truly combined)VERY HARD
Final Mock Contest — Round B (Cumulative, hardest set)
- gen-t6-001Rina's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-002Antu's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-003Tanjil's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-004Fahim's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-005Tanvir's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-006Rakib's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-007Oindrila's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-008Kabir's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-009Tanvir's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-010Shanto's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-011Sadia's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-012Arif's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-013Oindrila's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-014Sadia's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-015Jui's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-016Tanvir's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-017Meherun's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-018Rina's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-019Sabbir's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-020Sabbir's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-021Arif's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-022Kabir's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-023Meherun's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-024Jui's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-025Mim's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-026Nabila's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-027Arif's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-028Arif's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-029Jui's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-030Fahim's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-031Rezwan's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-032Zayan's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-033Wasif's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-034Ayesha's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-035Lamia's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-036Oindrila's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-037Nabila's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-038Rina's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-039Wasif's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-040Ayesha's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-041Meherun's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-042Jui's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-043Arif's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-044Mim's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-045Kabir's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-046Shanto's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-047Kabir's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-048Tanvir's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-049Farhan's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-050Arif's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-051Tanvir's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-052Jui's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-053Shanto's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-054Mim's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-055Rina's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-056Tanvir's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-057Rafi's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-058Jui's Coprime Range CounterVERY HARD
Advanced Number Theory
- gen-t6-059Fahim's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-060Mim's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-061Mahi's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-062Ayesha's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-063Wasif's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-064Nabila's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-065Farhan's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-066Rakib's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-067Meherun's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-068Ayesha's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-069Oindrila's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-070Lamia's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-071Wasif's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-072Jui's Live Range Query SystemVERY HARD
Segment Trees
- gen-t6-073Imran's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-074Sadia's Maximum Spread TeamVERY HARD
Advanced Greedy
- gen-t6-075Lamia's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-076Oindrila's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-077Imran's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-078Nusrat's Weighted Shortest RouteVERY HARD
Advanced Graphs
- gen-t6-079Tanjil's Optimal Transformation CostVERY HARD
Advanced DP
- gen-t6-080Meherun's Optimal Transformation CostVERY HARD
Advanced DP
EXTREME
100 problems
0/100 on this device
- set1-q7COREReconstruct N from K Statistics (constructive/exam-style)EXTREME
I/O & Arithmetic Basics
- set2-q7COREWord Ladder Length (string transform, exam style)EXTREME
Conditionals & Strings Basics
- set3-q7CORELongest Subarray with Equal 0s and 1s After K FlipsEXTREME
Arrays: Frequency, Min/Max, Search
- set4-q7COREMaximum XOR SubarrayEXTREME
Bitwise Operations & Number Properties
- set5-q7COREK-Way Merge of Sorted Lists (min-heap based)EXTREME
Sorting Fundamentals
- set6-q7COREClosest Pair of Points (Divide and Conquer)EXTREME
Basic Geometry
- set7-q7CORERange Sum With Point Updates (Fenwick/BIT)EXTREME
Prefix Sums & Range Queries
- set8-q7COREGas Station Circular TourEXTREME
Greedy Algorithms — Introduction
- set9-q7COREMedian of Two Sorted Arrays in O(log(min(N,M)))EXTREME
Binary Search — On Arrays and On the Answer
- set10-q7CORECount Numbers ≤ N Coprime to N in a Range, Fast (Möbius-based)EXTREME
Number Theory: GCD, LCM, Primes, Divisors
- set11-q7CORELongest Palindromic Substring in O(N) (Manacher's Algorithm)EXTREME
Strings — Intermediate
- set12-q7COREStrongly Connected Components (Kosaraju's or Tarjan's)EXTREME
Graphs — BFS/DFS Introduction
- set13-q7COREOptimal Binary Search Tree CostEXTREME
Dynamic Programming — Introduction
- set14-q7COREDerangements Count (no fixed points), mod PEXTREME
Combinatorics & Modular Math
- set15-q7COREWorld T20 X Team, Offline with Point Updates (hardest variant)EXTREME
Advanced Greedy + Prefix Sums (World T20 X Team style)
- set16-q7COREReachability Precomputation on Jump Graph With Weighted Cost (final boss graph problem)EXTREME
Advanced Graphs — Implicit Graphs & Multi-source
- set17-q7CORESmallest Multiple With Only Digits 0 and 1 (BFS on remainders)EXTREME
Advanced Number Theory
- set18-q7COREMaximum GCD-Sum Subsequence (weighted variant)EXTREME
Advanced Dynamic Programming
- set19-q7CORETrapping Rain Water in 2D (advanced grid + priority queue)EXTREME
Mixed Practice Contest — Round A
- set20-q7COREFull Contest Simulator: Everything CombinedEXTREME
Final Mock Contest — Round B (Cumulative, hardest set)
- gen-t7-001Meherun's Original ChallengeEXTREME
Design Your Own
- gen-t7-002Fahim's Original ChallengeEXTREME
Design Your Own
- gen-t7-003Rafi's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-004Mim's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-005Rina's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-006Rina's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-007Rina's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-008Ayesha's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-009Arif's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-010Rakib's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-011Jui's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-012Mahi's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-013Fahim's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-014Mahi's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-015Mim's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-016Mim's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-017Nabila's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-018Shanto's Original ChallengeEXTREME
Design Your Own
- gen-t7-019Antu's Original ChallengeEXTREME
Design Your Own
- gen-t7-020Dip's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-021Ayesha's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-022Oindrila's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-023Kabir's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-024Farhan's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-025Zayan's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-026Rezwan's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-027Shuvo's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-028Mahi's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-029Shanto's Original ChallengeEXTREME
Design Your Own
- gen-t7-030Farhan's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-031Rezwan's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-032Zayan's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-033Rakib's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-034Nadia's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-035Tanjil's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-036Wasif's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-037Priya's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-038Rina's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-039Rezwan's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-040Imran's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-041Sadia's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-042Tanvir's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-043Rina's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-044Rafi's Original ChallengeEXTREME
Design Your Own
- gen-t7-045Tanjil's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-046Mim's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-047Lamia's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-048Rina's Original ChallengeEXTREME
Design Your Own
- gen-t7-049Mim's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-050Tanjil's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-051Rina's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-052Nusrat's Original ChallengeEXTREME
Design Your Own
- gen-t7-053Rina's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-054Sadia's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-055Nadia's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-056Dip's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-057Shanto's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-058Farhan's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-059Mahi's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-060Imran's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-061Sabbir's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-062Kabir's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-063Priya's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-064Tanvir's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-065Tanjil's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-066Rakib's Mixed-Cost Reachability PlannerEXTREME
Combined: Graphs + Weighted BFS
- gen-t7-067Nabila's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-068Mahi's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-069Fahim's Original ChallengeEXTREME
Design Your Own
- gen-t7-070Lamia's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-071Fahim's Constrained Team SpreadEXTREME
Combined: Greedy + Number Theory
- gen-t7-072Fahim's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-073Rina's Original ChallengeEXTREME
Design Your Own
- gen-t7-074Rina's Original ChallengeEXTREME
Design Your Own
- gen-t7-075Arif's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-076Tanvir's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-077Mahi's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-078Meherun's Live GCD DashboardEXTREME
Combined: Segment Tree + Number Theory
- gen-t7-079Jui's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory
- gen-t7-080Arif's GCD-Optimal Subsequence PlannerEXTREME
Combined: DP + Number Theory