Software engineers write programs to design and develop computer software. Interviews are highly technical, so come ready to work through coding problems and math brainteasers. The specific questions you are asked will depend on what type of programming position you are looking for. Try researching a specific software discipline such as web development, application development, or system development.
Easier questions 1) Two variations of a program exist, A and B. When run on machine 1, A runs twice as fast as B. When run on machine 2, A runs 10x as fast as B. How would you investigate this? -same datasets -same versions of OS and libraries -same hardware 2) Had to code a method that calculated the factorial, first simply, then a second one recursively.
Find a repeated number in a list of numbers
Try to figure out the top unique search queries from a database with 100 billion entries
Round 1 Given a bitmap, use a quaTree data structure to represent the bitmap. The maps are all squares with black or white pixels and the length of the map is 2^n (you can always divide the map into 4 smaller parts). Then give you a root node of a quaTree, calculate the total black pixel in this map. Follow up: Given two root node, generate the intersection of these two maps.
Write a code that show all possible permutation from a given String.
Only one programming questions. Input a string, including numbers, operands, and brackets. Calculate the result. Test case: input: "(+ 3 3)": Output: 6 input "(* 3 3)" Output: 9 input: "(+ 1 12 (- 17 3) 5 (* 2 8 (/ 120 4)) 46)", Output: 1 + 12 + (17 - 3) + 5 + (2 * 8 * (120 / 4)) + 46 = 558
consider one situation, 9,9,9,9 to 1,0,0,0,0.
Find the shortest distance between two points in a 2D grid world (bfs).
Given two identical strings, where one string has a random character inserted, return the random inserted character.
Given an int array A, return an int array B that A[i + B[i]] is the first element in A after A[i] that is greater than or equal to A[i]
Viewing 1871 - 1880 interview questions