1st round - Adding multiplication function to C codebase
2nd round - 2 1-hour technical interviews. Interviewers ghosted and had to reschedule multiple times. Didn't apologize, very unprofessional vibe.
Got rejected, asked recruiters for any feedback even if it was vague, but they ghosted as well. Bad experience overall.
Find indices of elements for 2-sum, 3-sum, and 4-sum all in optimal time. 2-sum is easy, but 3-sum and 4-sum should be O(n^2) which is tricky because you need to find indices, not just the elements and there can be duplicate elements. Still don't understand solution to this day
Connect next pointers of all leaf nodes in binary tree. Tricky part is you must do it without extra space so you can't create a queue. I solved using a queue at first and thought solving without extra space was just a followup but I got rejected so seems like you have to do optimal space or else you'll get no hire.
The following metrics were computed from 1 interview experience for the SingleStore Software Engineer, University Graduate role in United States.
SingleStore's interview process for their Software Engineer, University Graduate roles in the United States is extremely selective, failing the vast majority of engineers.
Candidates reported having very negative feelings for SingleStore's Software Engineer, University Graduate interview process in United States.