Tower Research Capital LLC Core Engineering Interview Questions and Answers

A graph has a unique topological sort if and only if it is a directed acyclic graph (DAG).

• A topological sort is a linear ordering of the vertices of a graph such that for every directed edge (u, v), vertex u comes before vertex v in the ordering.

• To check if a graph has a unique topological sort, we can use depth-first search (DFS) or breadth-first search (BFS) algorithms.

• If during the DFS or BFS traversal, we encounter...read more

Check if a string containing parenthesis is balanced

• Use a stack to keep track of opening parenthesis

• Iterate through the string and push opening parenthesis onto the stack

• If a closing parenthesis is encountered, check if the stack is empty or if the top of the stack is the corresponding opening parenthesis

• If the stack is empty or the top of the stack doesn't match, the string is not balanced

• After iterating through the s...read more