Take a ladder with 5 steps, write a function that gives all the possible combinations of either 1,2, or 3 steps, in any order, to get to the 5th step, and returns the total number of combinations. So some of the possibilities would be [1,1,1,1,1], [1,1,1,2], [1,1,2,1], etc. Then he asked the same question with order not being considered, so [1,1,1,2] and [1,1,2,1] are the same solution.
What is your weakness?
median for a stream
1. Write a program in C to print the following pattern if value for S and N are given. Say if S=3,N=3 the pattern should be: 3 44 555 555 44 3
Write a routine to determine if a linked list has a cycle.
1. Reverse string except spaces. A string has mix of alphabets and spaces. Your task is to reverse the string, but preserve the positions of spaces. For example, reverse of " a if" is " f ia" 2. An array of size n has all but one numbers between 1 and n+1. Find the missing one.
if you have a linked list ordered like : n1-n2-n3-n4-n5-n6-n7-NULL. how to sort it to be at the order : n2-n1-n4-n3-n6-n5-n7-NULL
Print a binary tree level by level in zigzag order
You have a box of red balls, a box of blue balls, and a box of red and blue balls. What is the minimum number of boxes you can open and know what is the contents of each box?
Given a point to an array of 12 bits in a graphics buffer where each 4 bits represented red green and blue respectively, flip the color of the array to blue.
Viewing 1131 - 1140 interview questions