Problemi
LinkedList Reverse#10046
Molto facile · Implementation
LinkedList Intersection#10047
Facile · Data Structures
Invertire il grafo#10048
Molto facile · Graphs
Bitmap#10049
Media · Breadth-first Search · Shortest paths
Il cammino più lungo in un albero#10050
Molto facile · Graphs
Average value#10051
Molto facile · Implementation
Calculate the prefix#10052
Facile · Prefix Function
Beautiful quinary#10053
Facile · Implementation
Maximum minus minimum#10054
Molto facile · Bitmasks
How many balanced ternary#10055
Facile · Dynamic programming · Math
Ricerca in ampiezza 0-1#10056
Molto facile · Graphs
Tree PreOrder Traversal#10057
Molto facile · Trees · Depth-first Search
Breadth First Search 0-1-2#10058
Molto facile · Graphs
Tree InOrder Traversal#10059
Molto facile · Trees · Depth-first Search
Tree PostOrder Traversal#10060
Facile · Depth-first Search · Graphs · Trees
Tree Minimum element#10061
Molto facile · Trees
Tree Maximum element#10062
Molto facile · Trees
Tree Find#10063
Molto facile · Trees · Binary Search
Tree Sum of elements#10064
Molto facile · Trees · Depth-first Search
T1. Calculator ET#10073
Molto facile · Greedy algorithms
T2. Individualistic#10074
Facile · Dynamic programming · Binary Search
T3. Spiral T#10075
Facile · Implementation
T4. If only one differs#10076
Facile · Implementation
T5. Only two different#10077
Molto facile · Implementation
T6. Less often than others#10078
Molto facile · Strings