Los ingenieros de software se encargan de diseñar y desarrollar software informático. Las entrevistas serán muy técnicas, así que debes prepararte para resolver problemas de código y desafíos matemáticos. Las preguntas concretas que te planteen dependerán del tipo de puesto de programación al que aspires. Intenta buscar una disciplina de software concreta, como desarrollo web, desarrollo de aplicaciones o desarrollo de sistemas.
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
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
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).
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
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.
what was a technical difficulty and how have you overcome it.
Viewing 971 - 980 interview questions