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. about 2. javascript typescript babel es5 es6 3. test driven development, unit-testing, continuous integration 4. react-redux, modern JS frameworks, JS closures 5. function sum(){/*add code here*/};console.log (sum(3)(5)(7)(3)()); // 18
Q. my_list = [[35, 66, 31], ["python", 13, "is"], [15, "fun", 14]] OUTPUT REQUIRED: To print the string from the list as : python is fun
Give me 5 different ways of finding the median (middle element) of a linked list. For the sake of simplicity, assume the list has odd number of ints. Also mention the runtime for each. Follow up: What's the fastest way you could find the median? What is the runtime? Oh.. and yes, code your answer(s) in any language of your preference.
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