Dynamic programming question. Given a list of non-overlapping (but intersecting) intervals {[0-2], [2-5], [6-10]} find the largest non-intersecting set with mamimum range. I.e in above | {[2-5], [6-10]} | > | {[0-2], [6-10]} |
Engineers Interview Questions
843,412 engineers interview questions shared by candidates
Design an ID allocator which can allocate and de-allocate from a range of 1-1,000,000
you are building a website and how would you count the number of visitors for the past 5 min. Follow ups included exploring potential concurrency issues and how would you fix it.
Unexpected: How do you see the contents of a .mat file without loading it into the workspace?
Write a function that: given a 1 row 2^n column matrix containing integers 1 to 2^n, divide the matrix in two, and place the right half of the matrix below the left half. Repeat this process until the matrix is 2^n rows and 1 column and return the result.
Using Python, write a one-liner function to return a list containing only the unique elements of the given list. Order doesn't matter. Next, write a function to return an order-preserving list containing only the unique elements of the given list.
Implement a 10:1 mux using 3 4:1 muxes
Will You serve More than 5 years ?
What is the difference between a reference and a pointer?
Given list of revision numbers and build statuses (OK or FAILED). Example : { (10001,OK ) , (10002, OK) , (10003, FAILED) , (10004,FAILED) } Find number of revision where build has failed in first time.
Viewing 2541 - 2550 interview questions