Not difficult. It is like why can not compare two strings. And how to compare one object which initialed as a string with string. The coding quesition is to find the kth in two sorted arrays.
Ingeniero De Software Desarrollador Java Junior Interview Questions
666,144 ingeniero de software desarrollador java junior interview questions shared by candidates
Asked to write a function to determine if numbers were a power of X.
Given a string input, create a function that will output a compressed version of the string. E.g. Input = "AAABBZZDDD", Output = "A3B2Z2D3"
write a function that receives a dictionary and a string and return true if the string is built of exactly two words in the dictionary
Difficult to answer in short and first time attempt.
find a way to separate money into n parts. For example, if total money is 121, find a way to separate 121 into 4 closest parts and the solution would be an array with elements 30, 30, 30, 31
What sort would you use if you had a large data set on disk and a small amount of ram to work with?
Some probability question 1) given a rand5() function which provide a random number between 1-5 at equal probability. Write a rand7() fuction to provide a random number between 1-7 with equal probability...
Given a BS tree, give the median number in the tree with O(1) space.
Write a function in Java that will take a sorted array of ints, possibly with duplicates, and compact the array removing all the duplicate numbers. That is, if the contains the numbers - 1, 3, 7, 7, 8, 9, 9, 9, 10, then when the function returns, the contents should be - 1, 3, 7, 8, 9, 10. Be sure your answer is as efficient as possible. Describe the efficiency of your algorithm using big O notation.
Viewing 681 - 690 interview questions