There are 10 boxes of apples. Each apple in the boxes weights 1 pound, except that one of the boxes contains bad apples, which weights 0.9 pound each. You are given a digital weight (not a scale), and you can take apples out of the boxes. what is the minimum time of weighs to find out which box has bad apples? I gave one solution of 3 times using divide and conquer, but the interviewer said that 1 step is possible. So I couldn`t come up with the solution.
Write a function to check if a given tree is a valid binary search tree or not.
Find the smallest two values in an array
Is there any algorithm to verify whether a linked list is circular or not?
gave me a tree of 3 level and provided me a number that contains the level number and asked me to code a program that would print the nodes on that level in the tree.
Counting the number of anagrams of one string in another string
Given a list of integers, all from 1 to n, except for 2 which are marked as "0", find the 2 values that are missing. For example, for n = 5: arr = [1,5,0,0,3] => the two missing values are 2 and 4.
Reverse a string
Advantage of Process Over thread ??
How many bytes are actually allocated by malloc(n)? How does free() know how many bytes to free?
Viewing 121 - 130 interview questions