You're given a binary tree--not necessarily complete or proper--and you need to give each node a "friend" pointer that points to the node to its right in the tree. This node is on the same level but is not necessarily a sibling, which makes the problem a little tricky. The friend pointer of the node farthest to the right on each level should be null.
Dynamic programming question. Given a list of non-overlapping (but intersecting) intervals {[0-2], [2-5], [6-10]} find the largest non-intersecting set with mamimum range. I.e in above | {[2-5], [6-10]} | > | {[0-2], [6-10]} |
Design an ID allocator which can allocate and de-allocate from a range of 1-1,000,000
you are building a website and how would you count the number of visitors for the past 5 min. Follow ups included exploring potential concurrency issues and how would you fix it.
Write a function that: given a 1 row 2^n column matrix containing integers 1 to 2^n, divide the matrix in two, and place the right half of the matrix below the left half. Repeat this process until the matrix is 2^n rows and 1 column and return the result.
Design an algorithm to search an element in a singly linked list in O(1) complexity without using any other data-structure.
How can doctors encourage patients to take action on routine maintenance (e.g. cancer screening exams, vaccines), particularly when lacking any other reason to make contact?
Please write a function that accepts a floating number and returns its square-root. You may not use built-in square root function from your language. However, basic operators like addition, subtraction, multiplication are allowed. Please take into consideration the floating precision.
What way can you tell if an integer is odd or even?
There were some mathematical puzzles.
Viewing 1661 - 1670 interview questions