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