Problems

Loved, Not Loved#12343

Hard · Greedy algorithms · Math · Constructive Algorithms

Equation#12344

Medium · Brute force · Combinatorics

Shuffle#12345

Very hard · Greedy algorithms · Prime factorization · Constructive Algorithms · Sorting · Number theory

Sometimes it happens#12346

Very hard · Prefix Sums · Data Structures · Greedy algorithms · Range queries

Nasser and permutation#12348

Easy · Greedy algorithms · Math · Constructive Algorithms

Nasser's Array Reduction#12349

Hard · Shortest paths · Graphs · Greedy algorithms · Prefix Sums

Nasser and Palindromic Shifts#12350

Medium · Strings · Hashing · Binary Search

Nasser and the Target OR#12351

Hard · Bitwise Operations · Greedy algorithms

Nim-Yum-Yum#12352

Medium · Games · Interactive

Cheater#12353

Very easy · Math

Nasser and Bitwise OR Equal Array#12354

Easy · Bitwise Operations

University Promotion#12355

Easy · Sorting · Greedy algorithms

Nasser's Parity Array Transformation#12356

Hard · Greedy algorithms · Dynamic programming · Prefix Sums

Product Minimize Mod#12357

Medium · Dynamic programming · Number theory

Please be easy!#12361

Easy · Number theory · Math

Kaosar and M(ex+od)#12362

Hard · Randomized algorithms · Constructive Algorithms · Greedy algorithms

Yet Another Array Problem#12363

Easy · Combinatorics · Number theory

Kaosar and EM ( > w < )#12365

Medium · SQRT Decomposition · Math · Number theory

The Honoured One#12366

Medium · Number theory · Combinatorics · Prime factorization

Split#12368

Hard · Greedy algorithms · Strings · Math

Triple#12369

Hard · Prefix Sums · Greedy algorithms · Hashing

Rectangular Fibonacci Spiral#12370

Very hard · Math · Number theory · Binary Search · Hashing · Data Structures · Combinatorics

Oh no, sorting#12371

Very hard · Sorting · Data Structures · Queries · SQRT Decomposition

And again trees#12372

Very hard · Dynamic programming · Trees · Greedy algorithms · Data Structures · Depth-first Search

9076-9100 of 9178