Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4 * 3, you should not print out 3 * 4 again as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than efficiency. PrintFactors(12) 12 * 1 6 * 2 4 * 3 3 * 2 * 2
They asked to write a function that takes a string and check if it is a number. The second question was given a sorted array that has been rotated, find a number in that array {6,7,1,2,3,4,5}
Basic OOP related questions and Java question about different data structures.
Questions about Manual Testing, Differences between Functional, Performance, Unit, Regression, Load, Stress, Volume testing.
Given a list of buying and selling prices, check if by given a new price will there be any match / transaction. buyer and seller both should get the best prices.
given a number, how do you determine if its a power of 3?
Describe your everyday work methodology
What kind of data structure would you use to index annagrams of words? e.g. if there exists the word "top" in the database, the query for "pot" should list that...
You are given a random binary tree 5 / \ 4 9 / \ / \ 3 5 6 8 Write code to print it out in order level ie 5 4 9 3 5 6 8 The tree need not be balanced. Write all the datastructures for the tree and make sure that you print newlines after each level. Also write test cases to test your code.
How would you store 1 million phone numbers?
Viewing 1271 - 1280 interview questions