Write a function to find intersection of 2 sorted arrays.
Softwareentwickler Backend Interview Questions
513,129 softwareentwickler backend interview questions shared by candidates
a very long single linked list, how to find the n-th entry from the end.
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).
Viewing 2191 - 2200 interview questions