Задачи
LinkedList Reverse#10046
Многу лесно · Implementation
LinkedList Intersection#10047
Лесно · Data Structures
Reverse the graph#10048
Многу лесно · Graphs
Bitmap#10049
Средно · Breadth-first Search · Shortest paths
Longest path in a tree#10050
Многу лесно · Graphs
Average value#10051
Многу лесно · Implementation
Calculate the prefix#10052
Лесно · Prefix Function
Beautiful quinary#10053
Лесно · Implementation
Maximum minus minimum#10054
Многу лесно · Bitmasks
How many balanced ternary#10055
Лесно · Dynamic programming · Math
Breadth First Search 0-1#10056
Многу лесно · Graphs
Tree PreOrder Traversal#10057
Многу лесно · Trees · Depth-first Search
Breadth First Search 0-1-2#10058
Многу лесно · Graphs
Tree InOrder Traversal#10059
Многу лесно · Trees · Depth-first Search
Tree PostOrder Traversal#10060
Лесно · Depth-first Search · Graphs · Trees
Tree Minimum element#10061
Многу лесно · Trees
Tree Maximum element#10062
Многу лесно · Trees
Tree Find#10063
Многу лесно · Trees · Binary Search
Tree Sum of elements#10064
Многу лесно · Trees · Depth-first Search
T1. Calculator ET#10073
Многу лесно · Greedy algorithms
T2. Individualistic#10074
Лесно · Dynamic programming · Binary Search
T3. Spiral T#10075
Лесно · Implementation
T4. If only one differs#10076
Лесно · Implementation
T5. Only two different#10077
Многу лесно · Implementation
T6. Less often than others#10078
Многу лесно · Strings