Problemi

Palindrome Subsequence Sum#12335

Media · Math · Number theory

I hate 67#12337

Facile · Combinatorics · Greedy algorithms

Or Sum#12338

Facile · Greedy algorithms · Bitwise Operations · Math

Interviews#12339

Facile · Binary Search · Math

Permutation Minimize Product#12340

Media · Greedy algorithms · Sorting · Math

Fraction Construction#12341

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

Monochrome Image#12342

Molto facile · Math

Loved, Not Loved#12343

Difficile · Greedy algorithms · Math · Constructive Algorithms

Equation#12344

Media · Brute force · Combinatorics

Shuffle#12345

Molto difficile · Greedy algorithms · Prime factorization · Constructive Algorithms · Sorting · Number theory

Sometimes it happens#12346

Molto difficile · Prefix Sums · Data Structures · Greedy algorithms · Range queries

Nasser and permutation#12348

Facile · Greedy algorithms · Math · Constructive Algorithms

Nasser's Array Reduction#12349

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

Nasser and Palindromic Shifts#12350

Media · Strings · Hashing · Binary Search

Nasser and the Target OR#12351

Difficile · Bitwise Operations · Greedy algorithms

Nim-Yum-Yum#12352

Media · Games · Interactive

Cheater#12353

Molto facile · Math

Nasser and Bitwise OR Equal Array#12354

Facile · Bitwise Operations

University Promotion#12355

Facile · Sorting · Greedy algorithms

Nasser's Parity Array Transformation#12356

Difficile · Greedy algorithms · Dynamic programming · Prefix Sums

Product Minimize Mod#12357

Media · Dynamic programming · Number theory

Please be easy!#12361

Facile · Number theory · Math

Kaosar and M(ex+od)#12362

Difficile · Randomized algorithms · Constructive Algorithms · Greedy algorithms

9076-9100 di 9226