Considering a 2-dimension matrix that can only be traversed by 1 adjacent position at a time and never diagonally. Create an algorithm to traverse that matrix from its upper-left corner to its lower-right corner using the shorter possible path in the most efficient way.
given an integer, write code to list all primes preceding it.
How could you represent days and month using 2 6 sided dice
"If you were stranded on a desert island, what three development tools would you bring with you?"
first round interview
Why do you want to join Tableau? Find the smallest unique integer in a random integer array with possible duplicates.
My previous experience.
Can write a function which inputs two ints and check if it is 3 it should return 6 if input is 6 return 3, without using any condition.
Write a Java program to count the number of occurances of each number in a series of numbers.
if there are 9 white balls and 7 black balls in a bag .You have to take out balls one by one from the bag.then in how many attempts you wilk get a matched pair
Viewing 631 - 640 interview questions