Software Engineer Data Interview Questions

439,223 software engineer data interview questions shared by candidates

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]} |
avatar

Software Engineer

Interviewed at Nutanix

3.8
Apr 29, 2018

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]} |

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.
avatar

Associate Software Engineer

Interviewed at MathWorks

4.3
Sep 3, 2016

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.
avatar

Data Engineer

Interviewed at Squarepoint Capital

3.9
Dec 1, 2016

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.

Providing an algorithm for combinations(n, k), not because of it's complexity, just because it took my the majority of the interview to understand that this was the problem I was solving - it was not made very clear at all.
avatar

Software Engineer

Interviewed at Meta

3.5
Apr 3, 2013

Providing an algorithm for combinations(n, k), not because of it's complexity, just because it took my the majority of the interview to understand that this was the problem I was solving - it was not made very clear at all.

Viewing 1711 - 1720 interview questions

Glassdoor has 439,223 interview questions and reports from Software engineer data interviews. Prepare for your interview. Get hired. Love your job.