Express the number of ways, T(N) for climbing N steps. You can climb either one or two steps at a time. What is T(N)?
Engineer Interview Questions
843,597 engineer interview questions shared by candidates
It's the first OA coding sample of Google. The coding question is: Given a zero-indexed array A of N integers, return any of the indexes P of the element, which left sums of its left elements and right elements are equal. Sum of zero element is assumed to be equal to 0. This can happen if P = 0 or if P = N-1.For example, A = {-1, 3, -4, 5, 1, -6, 2, 1}, indexes 1, 3, and 7 are valid outputs.
Write a program that reads a file and counts the number of times each word in the file appears and at which lines.
Calculate the nth number of the fibonacci series
If you want to distribute a large file (gigabytes) in a large (100+ machines) park how do you do it?
There is a notepad which accepts only four operations: 1. Character X 2. select all 3. copy 4. paste Given n number of operations, provide the sequence of choices that gives maximum characters in the notepad.
sort the array so that the odd number in front of the even number and their relative order doesn't change in O(n)
unix questions were difficult.....sql was easy....choose your skill carefully...i choose c so they asked only c questions....
how to find the closest 2 number in an array of unique positive number
You have five bottles with pills. One bottle has 9 gram pills, the others have 10 gram pills. You have a scale that can only be used once. How can you find out which bottle contains the 9 gram pills?
Viewing 791 - 800 interview questions