/* * Suppose we have a sorted array in ascending order, with no duplicates: * * {1, 2, 3, 4, 5, 6, 7} * * Somehow an unknown amount of numbers at the beginning are shifted to the end, * creating an array that looks like: * 0 1 2 3 4 5 6 * {3, 4, 5, 6, 7, 1, 2} * * Let us call the new array a shifted cyclic array. * * Now, given a Shifted Cyclic Array int a[], and its length n (> 0), write a function * to find the smallest number in the array. */
In the phone interview, they just asked about my projects on the resume. and my programming experience. A week later, I got noticed that I need to take an online assessment. This assessment had 4 parts, first is 10 quick response questions, very easy, just be quick, you have 2 minutes limit; second is math questions, not hard, but need to be very careful; third is programming learning, they first teach you some basic rules about a new programming language and then test you each point they have shown you. I think this part is to test if you are a quick learner; the last part is 4 programming questions using the languages they have provided, for me, these questions are not very easy. It took a long time. Please prepare a calculator for the test. I forget to prepare one so it took longer to figure some questions. Please keep this in mind: being fast is important, but not as important as accuracy. You can find online assessment sample questions on the website to prepare for the assessment.
Write a method to generate the Fibonacci series
Given a list of strings, for each string, find if it has an anagram in the list.
Given a set of non-overlapping integer ranges (1,3) (5,8), etc., and an input integer, what is the best way to organize the data and allow for quick search based on the input, etc.
Print out a binary tree level by level
Given array of elements of 3 types. Sort it.
use bit operations to write a function that will determine if a number is a power of 2
compress strings such as "aaabbbcccc" into the string "a3b3c4"
Given an unsorted array, extract the max and min value using the least number of comparison.
Viewing 851 - 860 interview questions