The numbers 1-5 are inserted, in order, into a stack. Numbers are removed from the stack one-by-one and pushed into another array (numbers could be removed at any time, even before all the numbers have been added to the stack). What order of numbers in the array could NOT be produced by this scenario? Write code to determine if a sequence of numbers could have been produced by this scenario.
Given an array of items of three different colors red, green, blue. How would you sort the items in the array so that all the items with a certain color would be grouped together.
Find the character with longest repitition in the string e.g. aaacccddddeefffffffg the result should be 'f'.
find duplicated item from an array, output the duplicated item with their times
Reverse an integer. Looking for optimized solution and definitely no tostring type of solution
Suppose you have 11 marbles and a two-pan balance used to compare the weight of 2 things. All of the marbles weigh the same except for one, which is heavier than all of the others. How would you find the heaviest marble if you are only allowed to weigh the marbles 3 times?
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
what was a technical difficulty and how have you overcome it.
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.
Viewing 1211 - 1220 interview questions