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
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.
How do you find 2 missing elements in an array of consecutive integers that are not sorted who's size is N-2.
Search on an unsorted list with a time complexity of O(logn)
Viewing 511 - 520 interview questions