# Q1: Write a function to intersect two *sorted* lists (find common elements) # Write a method taking two lists as input, and returning a new list # You can assume you have a reasonable array/list class available (ArrayList, vector, python list, etc) # Ex: # l1 = [1,2,3,4,5] # l2 = [1,5,7,11,100] # result = [1,5]
Vous recherchez exactement quoi aujourd’hui ?
Mostly technical / coding questions with limited time to answer, talk about past projects (with techncial depth), almost no questions with respect to data science (statistics, ml, math, modeling ...)
Given a grid of size n, in how many moves you can reach from lower-left corner to upper-right corner?
# Q2: Same as Q1, but now assume there can be duplicates. The output should not have duplicates # Ex: # l1 = [1,2,3,4,5,5,5] # l2 = [1,5,7,11,100] # result = [1,5]
How much do you expect to make here? (Something to that extent.)
what is SQL DBA Funtions
What are two variables that are dependent but not correlated? For example, x and y=2x are dependent and correlated.
Write sql to mimic a report
NLP challenge about finding semantic similarity of some 121 tweeter tags.
Viewing 1 - 10 interview questions