Problemat

LinkedList Reverse#10046

Shumë e lehtë · Implementation

LinkedList Intersection#10047

E lehtë · Data Structures

Reverse the graph#10048

Shumë e lehtë · Graphs

Bitmap#10049

Mesatare · Breadth-first Search · Shortest paths

Longest path in a tree#10050

Shumë e lehtë · Graphs

Average value#10051

Shumë e lehtë · Implementation

Calculate the prefix#10052

E lehtë · Prefix Function

Beautiful quinary#10053

E lehtë · Implementation

Maximum minus minimum#10054

Shumë e lehtë · Bitmasks

How many balanced ternary#10055

E lehtë · Dynamic programming · Math

Breadth First Search 0-1#10056

Shumë e lehtë · Graphs

Tree PreOrder Traversal#10057

Shumë e lehtë · Trees · Depth-first Search

Breadth First Search 0-1-2#10058

Shumë e lehtë · Graphs

Tree InOrder Traversal#10059

Shumë e lehtë · Trees · Depth-first Search

Tree PostOrder Traversal#10060

E lehtë · Depth-first Search · Graphs · Trees

Tree Minimum element#10061

Shumë e lehtë · Trees

Tree Maximum element#10062

Shumë e lehtë · Trees

Tree Find#10063

Shumë e lehtë · Trees · Binary Search

Tree Sum of elements#10064

Shumë e lehtë · Trees · Depth-first Search

T1. Calculator ET#10073

Shumë e lehtë · Greedy algorithms

T2. Individualistic#10074

E lehtë · Dynamic programming · Binary Search

T3. Spiral T#10075

E lehtë · Implementation

T4. If only one differs#10076

E lehtë · Implementation

T5. Only two different#10077

Shumë e lehtë · Implementation

T6. Less often than others#10078

Shumë e lehtë · Strings

7551-7575 nga 9226