1. Implement a queue using stacks 2. Search through an array of integers and find pairs that add to a target
Software Developers Interview Questions
96,233 software developers interview questions shared by candidates
What is difference between Reentrant and Thread Safe functions ?
Given 99 numbers from 1 to 100 no-duplicate, find the number that is not there between 1 to 100; given 98 numbers from 1 to 100 no-duplicate, find the two numbers missing between 1 to 100.
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
1. Resume: The project you are most proud of. 2. Data Structure: Pick or design a data structure to store a phone book (name + number pair). We want to do fast lookup (by name) and print the book in lexical order (dictionary order). No follow up. 3. Coding: Given an input array, print the most frequent character in that array. However, when two or more character with the same frequency, print the one with smaller index. e.g. "HAHAB" -> you should print 'H'. No follow up.
Basic Core java Questions and a coding question
If one-third of n is 2, how much is n divided by 2? (really)
Given a string of numbers, find the largest prime number that is a substring of the string. E.g. 1337 has 337 as its largest prime.
Viewing 1011 - 1020 interview questions