समस्याएँ
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