المسائل
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