Puzzle question: A Floating ship contains 1 stone , If I drop that stone in sea,,What will happen with water level??? Is it increase or decrease n why??
Desarrollador Java Senior Interview Questions
750,349 desarrollador java senior interview questions shared by candidates
Given an array of numbers, replace each number with the product of all the numbers in the array except the number itself *without* using division.
three friends with different salaries need to find out their average salary without revealing individual salaries to each other. how?
A rabbit wants to climb some stairs and it can do steps of 1 or 2. How many possible paths are there to follow ( e.g 1-1-1... or 2-2-2 ... or 2-1-2-1... etc)
1) Clustered and Non Clustered (SQL)?
given the output from the first question write a algorithm to calculate how many possible inputs could have created that output. for example. "1211" could be interpreted as one two and one one || one hundred and twenty one ones.
Given a binary tree with the usual left and right pointers on each node, and additionally a parent pointer, make an algorithm to discover the closest ancestor to 2 nodes on the tree.
Implement a function to compute cubic root what is the time complexity?
You are given an integer N and an integer M. You are supposed to write a method void findBestCoinsThatMinimizeAverage(int N, int M) that prints the best collection of N coins that minimize the average number of minimum coins needed to generate values from 1 to M. So, if M = 100, and N = 4, then if we use the set {1, 5, 10, 25} to generate each value from 1 to 100, so that for each value the number of coins are minimized, i.e. 1 = 1 (1 coin), 2 = 1 + 1 (2 coins),..., 6 = 1 + 5 (2 coins), ..., 24 = 5 + 5 + 5 + 5 + 1 + 1 + 1 + 1 (8 coins), and we take the average of these coins, we would see that the average comes out to ~5.7. But if we instead use {1, 5, 18, 25}, the average would come out to be 3.7. We are to find that set of N coins, and print them, that produce the minimum average.
1.Implement deadlock in java 2. Features of mongo db 3.Questions related to dynamic programming 4.Implement Encapsulation using java Beans.
Viewing 311 - 320 interview questions