Probleme

Palindrome Subsequence Sum#12335

Mediu · Math · Number theory

Square of Fortune#12336

Foarte ușor · Math

I hate 67#12337

Ușor · Combinatorics · Greedy algorithms

Or Sum#12338

Ușor · Greedy algorithms · Bitwise Operations · Math

Interviews#12339

Ușor · Binary Search · Math

Permutation Minimize Product#12340

Mediu · Greedy algorithms · Sorting · Math

Fraction Construction#12341

Mediu · Combinatorics · Number theory · Greedy algorithms · Constructive Algorithms

Monochrome Image#12342

Foarte ușor · Math

Loved, Not Loved#12343

Dificil · Greedy algorithms · Math · Constructive Algorithms

Equation#12344

Mediu · Brute force · Combinatorics

Shuffle#12345

Foarte dificil · Greedy algorithms · Prime factorization · Constructive Algorithms · Sorting · Number theory

Sometimes it happens#12346

Foarte dificil · Prefix Sums · Data Structures · Greedy algorithms · Range queries

Nasser and permutation#12348

Ușor · Greedy algorithms · Math · Constructive Algorithms

Nasser's Array Reduction#12349

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

Nasser and Palindromic Shifts#12350

Mediu · Strings · Hashing · Binary Search

Nasser and the Target OR#12351

Dificil · Bitwise Operations · Greedy algorithms

Nim-Yum-Yum#12352

Mediu · Games · Interactive

Cheater#12353

Foarte ușor · Math

Nasser and Bitwise OR Equal Array#12354

Ușor · Bitwise Operations

University Promotion#12355

Ușor · Sorting · Greedy algorithms

Nasser's Parity Array Transformation#12356

Dificil · Greedy algorithms · Dynamic programming · Prefix Sums

Product Minimize Mod#12357

Mediu · Dynamic programming · Number theory

Please be easy!#12361

Ușor · Number theory · Math

Kaosar and M(ex+od)#12362

Dificil · Randomized algorithms · Constructive Algorithms · Greedy algorithms

9076-9100 din 9226