↳
so is the answer 4 heat 1 (first 4 car) + 1 (4 second set) + 1( Top 2 from first + Top 2 from second set) + 1 (3 car heat among the 3rd placed car) Moins
↳
Only two races of four cars in each. Get the times of all cars and sort them. You don't need any more races because the times will be the same in subsequent races. :) Moins
↳
4 if we cant measure time
↳
I felt did great !
↳
Powerful post
↳
I tried rooftop slushie mentioned above and it was pretty helpful. I recommend it. Moins
↳
What? Prefix is not started from the very first string? Jesus I cannot read Eng!
↳
x = ["Ravite", "Raviteja", "Ravby", "Raviejaain","Ravi" ] #Given String y = x[0] for i in x: if len(i)> len(y): y = i fin = [] y = list(y) for i in range(len(y)): count = 0 for j in range(len(x)): if y[i]==x[j][i]: count +=1 if count == len(x): fin.append(y[i]) else: break if len(fin) > 0: print "".join(fin) else: print "No common prefix in series" Moins
↳
/** * Jun Zheng, Rice Univ * Given a series of strings, find the biggest common prefix. * Real question of VMware * Java7; running time: O(n^2) * @param str * @return */ private String biggestPrefix(String[] strs){ String prefix=strs[0]; for(int i=1;i0;i++){ int j; for(j=0;j0)? prefix:"No such prefix!"; } Moins
↳
Is this question same as given on - nitinagrawal.com/delphix.html
↳
Possibly these people are not taking interviews to hire but to advertise themselves in the market that such company also exists. Moins
↳
global static variables have file scope and cant be accessed outside the file. That's the difference between global static and global. Moins
↳
we can use a function to access the variable or its pointer
↳
Challenging yes. But not necessarily in a good way. Most software engineers do NOT have the training to properly address this question. It requires a background in "data science" or signal processing. Unless the position interviewed for required these skills/background also, I would say the question was highly inappropriate. Moins
↳
There's quite an extended back and forth in actual interviews for questions like this, so nothing quite like real practice. The Prepfully Intuit Staff Software Engineer experts have actually worked in this role, so they're able to do an honest-to-God accurate mock, which really puts you through the paces. prepfully.com/practice-interviews Moins
↳
very good
↳
In these sorts of interviews you really need to drill down and understand what the interviewer is looking for. A good way to simulate a real interview experience is to do a mock with one of the Sandisk Staff Software Engineer experts on Prepfully, rated super strongly on TrustPilot... prepfully.com/practice-interviews Moins
↳
calculate sum of elements and return n(n+1)/2 - sum
↳
Sort the list and perform dichotomic search. O(2 log n)