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