Filter interviews by
I was interviewed before Jun 2016.
The question asks to construct a k-ary tree using the given k and DFS traversal string.
Iterate through the DFS traversal string
If the current character is 'P', create a parent node
If the current character is 'L', create a leaf node
Link the nodes according to the DFS traversal order
To determine if a graph has a node with n degree, iterate through all nodes and count their edges.
Iterate through each node in the graph
Count the number of edges connected to each node
If any node has n edges, then the graph has a node with n degree
Software Engineer
33
salaries
| ₹14 L/yr - ₹50 L/yr |
Software Developer
27
salaries
| ₹24 L/yr - ₹78.4 L/yr |
Sde1
25
salaries
| ₹30 L/yr - ₹60 L/yr |
Senior Software Engineer
17
salaries
| ₹35 L/yr - ₹72 L/yr |
SDE (Software Development Engineer)
17
salaries
| ₹35 L/yr - ₹50 L/yr |
Jane Street
Optiver
Indian Molasses Company
SIG Plc