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