↳
Can you provide more details on the questions please?
↳
Sort it (choose an algorithm), calculate index for median, loop over next based on index. They will want to actually discuss implementation (i.e. use a for loop, traverse next ptr, etc.). You should also know algorithmic complexity (big-O notation). Less
↳
It was almost all about tf-idf vectorizer
↳
Gave examples from work history.
↳
def search(A, target): if target == None: return -1 #if not target: # return -1 #riht I needed to address this! try: target = int(target) except ValueError: return -1 l=0 n = len(A) r = n-1 while l<=r: middle=l+((r-l)/2) if A[middle] == target: return middle if A[l] <= A[middle]: if ((A[l]<= target) and (target Less
↳
Mutual information / chi-squared criteria
↳
This was basically describe the technical solution and they wanted also to know specifically how I would implement them. Less