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
Top trending discussions
Some of the top questions asked at the Tower Research Capital LLC interview -
based on 5 interviews
Interview experience
based on 16 reviews
Rating in categories
Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Sde1
25
salaries
| ₹0 L/yr - ₹0 L/yr |
SDE (Software Development Engineer)
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Jane Street
Optiver
Indian Molasses Company
SIG Plc