You have a building with 100 stories. You also have two glass balls. You can drop the glass balls as many times as you want before they break. How can you find the floor at which they start breaking with the fewest number of drops?
Software Interview Questions
551,386 software interview questions shared by candidates
how to sort 2 different arrays,and save the result in the second array, if the first contains n elements, and the second contains m elements, and the second is alocated a length of m+n.
A rotated sorted array (e.g. 34512), find the rotation count (in this case, 3 means rotated by 3).
Create a Priority Queue with all methods.
Implement an iterator for a binary search tree that will iterate the nodes by value in ascending order.
You have an array of length n consisting of the integers from 0 through n-1 exactly once each, except for one which is missing. Find the missing number. The numbers can be in any order.
62-63=1; Changing only one element (either digit or operand), make this statement true.
Given an array of point structure element whose X and Y values are both int, write a boolean function to decide whether there is any midpoint(at least 1) of any two points in the array whose X and Y coordinate value are all integer.
Online Test : 1. count how many 1 bits are set after multiplication of 2 numbers 2. Implement CD (Unix command) functionality Technical Round 1 :: 1. formal introduction 2. Role in Current Project 3. Which UI framework/technology is better 4. Write a Decompressing Program to convert the string Ex :: i/p -> 3[b2[ca]] o/p -> bcacabcacabcaca
you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.
Viewing 3211 - 3220 interview questions