Problemat

Кількість маршрутів#11651

Shumë e vështirë · Trees · Disjoint set union · Sorting · Binary Search · Depth-first Search · Data Structures

Four-digit numbers#11652

E lehtë · Brute force · Implementation

Maximum Sum Increasing Subsequence#11653

Mesatare · Dynamic programming

Teams Forming#11654

E lehtë · Sorting · Greedy algorithms

Huseyn's training#11655

E lehtë · Greedy algorithms · Sorting

Видалення рядків#11657

Shumë e lehtë · Implementation

Get 2024#11659

Mesatare · Dynamic programming · Strings

Небезпечні дороги#11660

Mesatare · Depth-first Search · Graphs

Sum of Prime Numbers#11661

Mesatare · Dynamic programming · Prime factorization · Combinatorics

Нумеровані списки#11662

E lehtë · Implementation

Fun Fibonacci#11663

Mesatare · Dynamic programming · Number theory

Array Partition#11664

E lehtë · Sorting · Greedy algorithms

Chords#11665

Mesatare · Combinatorics · Number theory

Candies#11666

Mesatare · Math · Implementation

Lost pencil#11667

Mesatare · Implementation

Create an array#11668

E vështirë · Greedy algorithms · Sorting · Data Structures

Ibrahim's dissertation#11669

E vështirë · Dynamic programming · Sorting

Sum of neighbors#11670

Mesatare · Implementation

Absolute difference#11671

E lehtë · Math · Implementation

Dynamic array#11672

Mesatare · Greedy algorithms · Priority Queue · Binary Search

Maximum palindrome#11673

Mesatare · Strings · Implementation

The Cubes#11674

E lehtë · Math

The Strings#11675

Mesatare · Implementation

8776-8800 nga 9226