Skip to contentSkip to footer

Ingenieros De Software Interview Questions

Salaries
Interviews

711,475 ingenieros de software interview questions shared by candidates

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.
avatar

Software Engineer

Interviewed at Walmart

3.4★
Jul 16, 2013

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.

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
avatar

Frontend Developer

Interviewed at Wix

4.1★
Apr 5, 2018

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

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.
avatar

Software Developer Intern

Interviewed at Expedia Group

3.7★
Aug 27, 2012

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 function f(p) that returns an array of linked pages e.g f(homepage) = {page1, page2, page3}. Or f(page1) = {page4, page5}. If there is no linked pages function will return null. And we say one site is a good site if we can get to any page of that site in a less than 6 clicks. The task was to write a function that will check is it a good site or not using f(p).
avatar

Software Developer

Interviewed at Booking.com

4★
Dec 9, 2017

You have a function f(p) that returns an array of linked pages e.g f(homepage) = {page1, page2, page3}. Or f(page1) = {page4, page5}. If there is no linked pages function will return null. And we say one site is a good site if we can get to any page of that site in a less than 6 clicks. The task was to write a function that will check is it a good site or not using f(p).

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.
avatar

Software Development Engineer

Interviewed at Microsoft

4★
Jun 11, 2015

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.

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.
avatar

Software Development Engineer

Interviewed at Microsoft

4★
Mar 8, 2016

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.

Viewing 1131 - 1140 interview questions

Glassdoor has 711,475 interview questions and reports from Ingenieros de software interviews. Prepare for your interview. Get hired. Love your job.