Depth-first search of a graph, backtracking, hashmaps, big-O notation
Grad Interview Questions
7,341 grad interview questions shared by candidates
Typical LeetCode esque questions, probably not allowed to disclose here
Tell me about your project
Given a string of brackets, and determine whether it is valid
Given a BST, implement a Sibling member variable and initialize them: struct Node { int data; Node* left; Node* right; Node* sibling; }; Such that all Nodes at the same depth point to the one to the right: 5 / \ 3 -> 7 / \ / \ 1 -> 4 -> 6 -> 9
Given a number of children, and a number of turns for each round. Figure out which student wins
Find the root of the tree given a dictionary of all parent-child nodes.
Phone: 1. BST in min-max fashion Onsite: 1. Variation of Insert Delete GetRandom O(1) on a different class (OOP style) 2. System Design on browser history
why do i want to join bloomberg and design underground system
why do you want to work here
Viewing 781 - 790 interview questions