«
»
Recent Interview Questions
More Questions »
0of 0 votesGiven a list of input tasks to run, and the cooldown interval, output the minimum number of time slots required to run them.
// Tasks: 1, 1, 2, 1, 2
// Recovery interval (cooldown): 2
// Output: 8 (order is 1 _ _ 1 2 _ 1 2 )
0of 0 votesImplement Ring Buffer with read and write pointers.
For example if the Ring buffer is implemented in the form of array of integers , one should be able to read / write more than one integer at a time. In short the data read / written should be in a chunk .
-
0of 0 votes
find the Closest leaf to a given node in Binary Tree
can you do it in o(n) time
public TreeNode findCloestLeafNode(TreeNode root, TreeNode target){}
no parent pointer
-
0of 0 votes
validate IP in string format and return the uint32 format
-1of 1 voteaa