InterviewBit Problems
Maximum Edge Removal : Solved
About the Maximum Edge Removal : Solved category
(1)
DFS approach in C++
(1)
Very easy O(n) solution using only arrays
(2)
With Map and Recursion
(1)
C++ [For those who didn't learn DFS yet] [Without Explicit DFS] [Tree concepts]
(1)
C++ Dfs Solution by counting the number of nodes which have subtrees with even nodes
(1)
C++ | Maps Used. Easy
(2)
CPP Even Tree Solution based on DFS
(2)
O(n) cpp. total even sized childs
(1)
DFS Solution Easy
(1)
Easy cpp O(n) solution
(1)
next page →
