Was pretty relaxed- just explain your thinking. There was a code test online - including maths and programming. Then I had to submit an extended response regarding my motivations etc. Then there was a technical interview - asking about some engineering maths, coding and programming concepts. Then a general non technical interview with the manager.

I attended a Career Fair event and applied online after attending the event, which shortly led to a behavioral assessment where I had to record myself and send them the videos of my responses. After that, I was sent a HackerRank take home assessment. Upon successful completion of those two, I was interviewed by an engineer on behavioral and technical questions. I thought I did well and solved the problem successfully. This is where it goes south. I reached out 1-2 weeks later asking for an update on my application, and I hear nothing back. I wait another week, it becomes a month and then eventually I find out that I have been ghosted. I thought it was very unprofessional and inconsiderate, especially because they had asked us to commit a lot of time to interview with them.

First, there was a basic phone screen interview asking about visa status, gpa, and basic behavioral question. After the phone screen you are asked to complete a hacker rank challenge and scheduled for a technical phone interview the following week. The hacker rank challenge questions were the following: 1. Given a List of Strings, return the words that can be typed only using one row of your keyboard. example: ["Hello", "Alaska", "Dad", "Peace"] => ["Alaska", "Dad"] 2. Given a List of Strings of operators and numbers, determine the sum of the given expression. The numbers can be positive or negative and the operators only have multiplication and division. 3. Given an array starting from 1 to 2^n, [1,2,3,4], transform the array such that when you split the array in half, the left side goes on top of the right, repeat this until the left side has a length of 1. [1,2,3,4] => [1,2][3,4] => [1][3][2][4] => [1,3,2,4]. 4. Given a graph of vertices and directed edges, return all vertices in order that can visit all other vertices within 2 steps. As for the technical interview, we went over how you would design a class of human and pets and was questioned about time complexity of the algorithm you wrote on HackerRank and more questions to problems regarding HackerRank Questions.