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.
Given a string write a function which prints all the subsets of the string. Now make the function to return only unique solutions. For example if they give you "abc" you print out a ab abc ac b bc c Now for the unique solution constraint, if they give you "aba" the output should be: a ab aba b
Question is verbose, uses search engine, string matching etc., but at the end boils down to this: There is two dimensional array where each sub array (row) is sorted, i.e. [[1 1000 2000] [20 10001 5000] [55 10002 222222]] Find a minimum range contain a number from each row. For above array it should be (1000-1002) range.
How do you swap 2 variable without using temporaries. (My version is given 2 register and 1 ALU, how do you swap the value of the 2 register without using external register or temporaries)
Three of my 150 friends have phone numbers ending in a permutation of the digits 0, 1, 4, and 9. Is this surprising?
Given an array of strings with commit ids, and a predicate isBuggy that returns if a single commit is buggy, write a program that finds the first buggy commit. - When a commit is buggy, we assume that all its children are buggy. - When a commit is not buggy, we assume that all its ancestors are not buggy. After solving it, I had to describe its time complexity and spatial complexity and how would I choose the test cases.
Determine if a string is valid based on placement of parenthesis. i.e. "123(13(44))" is valid but ")234(12)(" is not.
How do you see 5 years from now?
Online coding interview: Given an array of integers. Find the largest increasing sub sequence of integers in the array. // 10, 3, 7, 9, 0, 15 // return index 1&3
Given a (potentially large) array of integers, all but one repeating an even number of times, how would you find the one repeating an odd number of times in an efficient way? eg [1 2 3 3 2 2 1 4 2] should return 4
Write a method which return how many palindromes are in a word. Eg: barbarabar has 7 (b,a,r,barab,a,r)
Viewing 451 - 460 interview questions