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
first round interview
Why do you want to join Tableau? Find the smallest unique integer in a random integer array with possible duplicates.
String foo = "abc"; String foo1 = "abc" what does (foo == foo1) evaluate to?
hackerrank problems
The question was asked in the personal interview. You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. Write a program which computes in how many distinct ways can you climb to the top.
None of the questions were unexpected, at least for any candidate applying for this job. I definitely felt I could have answered few questions better.
Given a list of "threads", which contain 2 variables - starting and ending times - implement a function that will return all running threads at some time t. Optimize it. (faster than O(n) )
Viewing 591 - 600 interview questions