Science Interview Questions

43,745 science interview questions shared by candidates

Write a program in Python to calculate tax if Salary and Tax Brackets are given as list in the form [ [10000, .3],[20000, .2], [30000, .1], [None, .1]]. You don’t know in the beginning how many tax brackets are there. You have to test for all of them.
avatar

Data Scientist Infrastructure

Interviewed at Meta

3.6
Apr 1, 2018

Write a program in Python to calculate tax if Salary and Tax Brackets are given as list in the form [ [10000, .3],[20000, .2], [30000, .1], [None, .1]]. You don’t know in the beginning how many tax brackets are there. You have to test for all of them.

Given an event-level table of interactions between pairs of users (note that there aren't duplicates in one day for one pair of users), for each possible number of "people interacted with" find the count for that group in a given day (i.e. 10 people interacted with only one person, 20 with 2, etc.).
avatar

Data Scientist

Interviewed at Meta

3.6
Nov 17, 2017

Given an event-level table of interactions between pairs of users (note that there aren't duplicates in one day for one pair of users), for each possible number of "people interacted with" find the count for that group in a given day (i.e. 10 people interacted with only one person, 20 with 2, etc.).

The second question asks you to refactor a function in O(n^2) and make it O(n), basically by eliminating the nested for-loop. This is the function you're asked to refactor: int solution(int *A, int N) { int result = 0; int i, j; for (i = 0; i < N; i++) for (j = 0; j < N; j++) if (A[i] == A[j]) if (abs(i - j) > result) result = abs(i - j); return result; }
avatar

Computer Science Intern

Interviewed at Spire Global

2.7
May 18, 2015

The second question asks you to refactor a function in O(n^2) and make it O(n), basically by eliminating the nested for-loop. This is the function you're asked to refactor: int solution(int *A, int N) { int result = 0; int i, j; for (i = 0; i < N; i++) for (j = 0; j < N; j++) if (A[i] == A[j]) if (abs(i - j) > result) result = abs(i - j); return result; }

Viewing 151 - 160 interview questions

Glassdoor has 43,745 interview questions and reports from Science interviews. Prepare for your interview. Get hired. Love your job.