Маселелер
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