Tesla | Software Engineer | Fremont, CA

Online assessment: 2 Questions (90 mins)

Phone Interview 1: Question 1) Review and follow-up on the Online assessment questions. Question 2) Minimum Path Sum (Leetcode) Question 3) Prefix Search in the dictionary of words (Similar to Implement Trie (Prefix Tree) (Leetcode))

Phone Interview 2: Informational call with the hiring manager with behavioral questions.

Onsite Interview:

Round 1: Design problem (45 mins) Question 1) Questions on the existing work. Question 2) Given a bunch of redis instance design a service to perform following operations a) Connection to redis instance b) access the data within that connection c) create and update the entry in redis. d) flush an entry (using time bound constraints)

Round 2: Problem Solving (45 mins) Question 1) Questions on the existing work. Question 2) LRU Cache (Leetcode)

Round 3: Problem Solving (45 mins) Question 1) Questions on the existing work. Question 2) Some concepts of SQL. Question 3) Given a node in a N-ary tree, check if that node exists in the tree, if so, print all the nodes under its hierarchy.

Round 4: Behavioral Questions with Senior Manager (45 mins)

Round 5: Behavioral Questions and current work related questions with Hiring Manager (45 mins)