Flexible work and opportunities to explore.
The pay is not up to standards.
First Round interview: * Go through your resume. * Determine whether a tree is a BST. * Implement the merge sorting algorithm. Second Round interview: * Go through your resume. * Explain how to design a MapReduce program for the word counting task
There are four interviews in total. You are likely to be interviewed by a prospective teammate, so you need to always put your best foot forward. Two of the interviews will be coding challenges. Each is tailored to understand your problem-solving sk
Initial Phone + Screening for HR questions
Initial Phone + Screening for HR questions
First Round interview: * Go through your resume. * Determine whether a tree is a BST. * Implement the merge sorting algorithm. Second Round interview: * Go through your resume. * Explain how to design a MapReduce program for the word counting task
There are four interviews in total. You are likely to be interviewed by a prospective teammate, so you need to always put your best foot forward. Two of the interviews will be coding challenges. Each is tailored to understand your problem-solving sk
Initial Phone + Screening for HR questions
Initial Phone + Screening for HR questions