For a given binary tree, assign the sibling pointer of each node. A sibling is always the node to its immediate right on the same level of the tree.
Engineer Interview Questions
843,795 engineer interview questions shared by candidates
Why wouldn't you want a root DNS server to answer queries for you, instead of delegating you to an authoritative server?
Smallest missing natural number in a linked list in linear time without a hash table.
Write a function that calculates the root of a given number.
Goat Latin dictionary
Find Kth minimum node in a binary tree and suggest a complexity
Related to question 1, how could you implement debouncing? Say you wanted the `handleScroll` function to be called only after 200ms has passed between scroll events.
Given a pointer to the head of a singly linked list, iterate it backwards printing the values in reverse. Give 2 implementations - a recursive one, and an iterative one.
Given two events, each with a start and end time, implement a boolean check to see if they overlap.
Optimize the algorithm suggested above
Viewing 1331 - 1340 interview questions