Round 2 LeetCode Triangle Given a triangle of integers, find the maximum path sum from the top point to the bottom. Follow up: Print out the path of the maximum path
Engineer Developer Interview Questions
467,806 engineer developer interview questions shared by candidates
The question was very hard to think about in the span of 35 minutes. Especially that the interviewer had heavy accent and he was chewing on something in he background. The second interviewer asked how to create a silhouette given a list of buildings. Details: You are given a list if buildings represented with <starting point, end point, height>. return an ordered list of points that represents the silhouette. The points are represented with <X Coordinate, Y Coordinate>. Do not assume the buildings are sorted in any way.
How would you implement Google spelling correction algorithms?
Reverse the word order in a string.
How would you extend Array in JavaScript so that it could add all the values stored in an array?
Given an array of Ints find a maximum sum of non adjacent elements. for ex. arr = [1,0,3,9,2] then ans would be 10 = 1 + 9 (non adjacent element)
How do you make a function that only calls input function f every 50 milliseconds?
Write an algorithm to test if n is power of 2
Write a regular expression to match a machine's MAC address
Sie haben eine Datenbank mit Angestellten und ihren Hierarchien. Konstruieren Sie eine SQL-Anweisung, um jeden Angestellten mit seinem Supervisor zu verbinden.
Viewing 2101 - 2110 interview questions