Given a set of n jobs with [start time, end time, cost] find a subset so that no 2 jobs overlap and the cost is maximum ?
Engineer Interviews
Engineer Interview Questions
Engineers are responsible for designing and building products. In an interview context, expect to be quizzed on your technical skills, and also evaluated for your ability to work as a part of a team to get things built. The specific questions you are asked will depend on what type of engineering position you are looking for such as a specific engineering discipline like software engineer, electrical engineer, or mechanical engineer.
Top Engineer Interview Questions & How to Answer
Question #1: What is the most challenging engineering project you've dealt with, and how did you ensure it was successful?
Question #2: In your current role, what steps do you take to avoid making mistakes?
Question #3: Describe a time you dealt with a difficult client or stakeholder.
841,430 engineer interview questions shared by candidates
You have a 2-D array of friends like [[A,B],[A,C],[B,D],[B,C],[R,M], [S],[P], [A]] Write a function that creates a dictionary of how many friends each person has. People can have 0 to many friends. However, there won't be repeat relationships like [A,B] and [B,A] and neither will there be more than 2 people in a relationship
Python : fill in the blank(edge case of input list : None , []) ,find count of letter in a string , uncommon words between 2 strings.
Given an array of integer in which all numbers occur even times except for one number occurs odd times, find it.
What is Little Endian and Big Endian?
How to find the max number of a shift buffer queue. For instance, there is an array like 5, 6,8,11,1,2, how to find the max number, which is 11 in this example.
How many golf balls can fit in a school bus?
Assume a matrix of integers they are sorted in boh row and column vice .. how do u find a given number from the matrix in a optimal way?
1. return the maximum product of 3 numbers in an array 2. print out the pairs of a number and the nearest greater number to its right in an array. Example: given [1,2,5,2,6], print out (1,2), (2,5), (5,6), (2,6)
(a) first, write a function to calculate the hamming distance between two binary numbers (b) write a function that takes a list of binary numbers and returns the sum of the hamming distances for each pair (c) find a solution for (b) that works in O(n) time.
Viewing 251 - 260 interview questions