1 k

Questions d'entretien pour Junior Data Analyst partagées par les candidats

Principales questions d'entretien

Trier: Pertinence|Populaires|Date
On a demandé à Junior Data Analyst...27 août 2013

For a given array count combination of pairs of (x,y) whose sum is N.

4 réponses

int[] list = {7,6,2,3,4,5}; int N=9; int count=0; for(int i=0;i

Three solutions I gave. 1. Sort the array in O(nlogn). Min and Max as two indices. Count=0 Loop if A[Min]+A[Max]N Decrement (Max) else Increment(Count) End 2. Using extra space and count sort if the minima and maxima of array sets are in a given range. Max absolute negative number subtracted to keep numbers in positive number space. Loop if Memory[N- A[i]- Min] Increment(Count) End 3. Create a Hashset/Hashtable. Look for N-A[i] and increment count if found. Loop if Get(N- A[i]) Increment (Count) else Push(A[i]) End Moins

the complexity of ur solution is not so good you can do better

Afficher Plus de réponses

If a jar has X red balls and Y blue balls, what is the minimum number of draws that is necessary to ensure that you have one ball of each color?

3 réponses

max(X, Y)+1

It is max, the first reply was correct. I you have 5 blue balls and 2 red balls : - If it was min : you take 3 balls, it is still possible to have picked 3 blue balls. - with max : you take 6 balls, the worst case is that you have picked 5 blue and 1 red balls. Moins

min(X,Y) + 1 is correct, not max()

2 réponses

48 actually

47

The details of your past projects

2 réponses

My project is changing detection using Gray level ambiguity optimization. Before earthquake is position condition. And after earthquake is the same position damage of the particula of the situation and damage Moins

We can define of the damage position

Find out whether an array/string contains non-repeated characters.

2 réponses

Two solutions I gave 1. Make a bucket of ASCII (256),/ Eng Alphabet(26)characters.Look for count of A[i] . If 1 return false else return true in the end Loop if (!Memory[A[i]]) ) Increment (Count) else return false End return true 2. Create a Hashset/Hashtable. Look for A[i] . If found return false else return true in the end Loop if ! Get(A[i]) Push (A[i]) else return false End return true Moins

the complxity of your solution will be O(n) runtime and O(n) memory you can do better Moins

If the coefficient of an independent variable in linear regression has an opposite sign than it should be, what might be the reason

1 réponses

multicollinearity

Excel document- recgnize what type of security breach this is...

1 réponses

I didn't figure it out because I never studied this before...I came to interview for a Junior position and the test was senior level. Moins

Introductory questions. Describing yourself. Your skills. Your past experiences. Presentation of a Case Study that was provided a few days before the interview.

1 réponses

I answered honestly. I sounded genuine and friendly. Smiling all the time. Presented the Case Study and answered the questions that followed. Moins