Maximum rectangular area under a histogram.
Software Engineer Interviews
Software Engineer Interview Questions
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.
Top Software Engineer Interview Questions & How to Answer
Question #1: How would you describe your programming task process?
Question #2: Which programming languages do you know and prefer?
Question 3: What is an example of a successful project that you completed?
419,626 software engineer interview questions shared by candidates
This was one of the more standard questions. You have stairs with N number of steps. You can take either one step steps or two step steps; how many ways can you climb the stairs?
1. merge two sorted lists. 2.merge k sorted lists He asked followed up questions about memory allocation, difference between heap and priority queue, , time complexity and a few issues with my STL usage.
Write code to determine if a given input string contains balanced parentheses.
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
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.
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?
Viewing 2121 - 2130 interview questions