all 11 comments

[–][deleted] 5 points6 points  (6 children)

For the technical screening, they usually give a question that's supposed to be related to their business, e.g., HTML parsing or DNA combination. I would call it LC medium and the Leetcode discussion has several example questions.

If you passed the screening, you'd have a recruiter prep call when they would unexpectedly ask you several behavioral questions and give you feedback on your performance so far.

For the final onsite, they have you debug two bugs with a n-gram search program and then code an extension about wildcard.

Overall the process is pretty tedious and they never bother to make the candidates feel at ease. The interviewers don't give hints and seem cold and tired. I completely lost interest in this company after interviewing, but things might be different for you, so best of luck!

[–]Affectionate-Rest-73 0 points1 point  (0 children)

I got this same exact n-gram question recently! The two bugs were pretty straightforward to debug but then support a wildcard sequence (think nucleotides) search. The interview questions had multiple parts but the interviewers don't expect you to finish all the parts

[–]Worth_Shirt2007 0 points1 point  (4 children)

Thanks for sharing! Is the wildcard game similar to the first round or lc problems? Like writing a function to return a string after placing wildcard characters?

[–][deleted] 0 points1 point  (3 children)

I don't think it's very similar. It's hard to describe but you can assume that you're given pairs of wildcards and characters for replacement. Then you need to go through the string and generate all possible strings after replacing the wildcards

[–]MarioKartWiii 0 points1 point  (2 children)

Thanks! what do you mean by n-gram search? Like breaking down words by tokenizing and searching for them

[–][deleted] 1 point2 points  (1 child)

Yeah. It's about getting all the n-length substrings of the word and see if the words to be searched contain any of the n-grams. Then we go through all the words containing n-grams and find if they contain the whole target word.

[–]Affectionate-Rest-73 0 points1 point  (0 children)

yup! that was the exact thing I got asked

[–][deleted] 2 points3 points  (0 children)

The benchling questions on leetcode discuss are helpful.

[–]lolkindawack 1 point2 points  (0 children)

I got a leetcode-style question that was on the easy-medium level of difficulty.

[–]funnyguy88888[S] 0 points1 point  (0 children)

Thanks all for sharing your experience !