Skip to contentSkip to footer

Data Interview Questions

Salaries
Interviews

132,958 data interview questions shared by candidates

Interview 1: 1) Algorithms Question -- How would you solve this array problem? Can you do it in O(n) time? Then write the code 2) Do you have any questions? Interview 2: Talk about your experiences--particularly in data science or machine learning
avatar

Intern, Data Science

Interviewed at Adobe

4.1★
Apr 21, 2016

Interview 1: 1) Algorithms Question -- How would you solve this array problem? Can you do it in O(n) time? Then write the code 2) Do you have any questions? Interview 2: Talk about your experiences--particularly in data science or machine learning

A parting of n is a list P=(a1,a2,a3,....) such that a1<=a2<=a3.... and n=a1+a2+a3+... For example for n=5 the partings are: (1,1,1,1,1), (1,1,1,2),(1,1,3),(1,2,2),(1,4),(2,3),(5) Define X(P) as the number of 1s in a parting and Y(P) as the number of different numbers, for example X(1,1,1,2)=3 and Y(1,1,1,2)=2. For a certain n, show that the sum of all X(P) is equal to the sum of all Y(P), for example for n=5 both are equal to 12
avatar

Data Scientist

Interviewed at Pagaya

3.3★
Dec 22, 2020

A parting of n is a list P=(a1,a2,a3,....) such that a1<=a2<=a3.... and n=a1+a2+a3+... For example for n=5 the partings are: (1,1,1,1,1), (1,1,1,2),(1,1,3),(1,2,2),(1,4),(2,3),(5) Define X(P) as the number of 1s in a parting and Y(P) as the number of different numbers, for example X(1,1,1,2)=3 and Y(1,1,1,2)=2. For a certain n, show that the sum of all X(P) is equal to the sum of all Y(P), for example for n=5 both are equal to 12

Code a data structure which allows us to store and retrieve items by key up to a fixed capacity. When we add items over capacity we free up space by removing an item first: 1) remove any expired item first 2) If there are no expired items, find the items with the lowest priority number, and remove the one which has been used least recently of them Optimise for time.
avatar

Data Engineer

Interviewed at bp

3.8★
Nov 2, 2023

Code a data structure which allows us to store and retrieve items by key up to a fixed capacity. When we add items over capacity we free up space by removing an item first: 1) remove any expired item first 2) If there are no expired items, find the items with the lowest priority number, and remove the one which has been used least recently of them Optimise for time.

SQL
avatar

Data Engineer

Interviewed at Peloton Interactive

3.5★
Mar 15, 2020

SQL

Viewing 621 - 630 interview questions

Glassdoor has 132,958 interview questions and reports from Data interviews. Prepare for your interview. Get hired. Love your job.