I'd applied online for SDE1 and I cleared my OA and phone interview which set me up for 4 round onsite interviews that held last week..and looked like, I was certainly not in there for a treat. Rejected but here I am and I had tried recollecting all the questions as I could from my experience and wanted to share so that it may help someone preparing for the same.
I was asked leadership behavioural questions in every round I appeared. I am just summing up whatever questions I came across.
Leadership Principles(Round 1-4): Questions such as have you ever been given negative feedback by your peers, Describe your project challenges, Your thought process of approaching a problem if you’ve not came across such problems before, How would you deal with clients with requirements on a deadline and you know it cannot be met as they have requested. Have you worked anytime beyond your responsibilities?
There were more questions asked but they were more or less similar to above.
Technical Questions.
Round1: Given a sequence of pages a customer has visited, return 3 pages in sequence which were highest visited.
You can assume there is a log file such as below with the timestamp, Customer Name and the page visited.
‘’’
00:11:00#John#HomePage
00:11:01#John#HelpPage
00:11:00#Maria#HomePage
00:11:00#Matthew#ProfilePage
00:11:00#Maria#DetailPage
….
’’’
Example:
Customer: John, Pages Visited in sequence: [HomePage, HelpPage, DetailPage,OrderPage,CheckOutPage]
Customer: Maria, Pages Visited in sequence: [DetailPage,OrderPage,CheckOutPage,ProfilePage]
Customer: Matthew, Pages Visited in sequence: [ProfilePage, DetailPage,OrderPage,CheckOutPage ]
Output:[DetailPage,OrderPage,CheckOutPage]
Round2 Object Design: There are Departments such as (Men, Female, Kids) and Product category such as (Shoes, Toys, Clothes). A customer can like or order a product. For each customer, we want to show recommendations of products based on their preferences. Design the classes and relationships as needed. (This might be the rejection reason)
Round3: K Closest Points from origin : Given n unique data points(x,y) on Cartesian plane, How would find K closest points from origin.
Follow up: How would you deal if the points are not unique or there are duplicates and we need to return the K unique datapoints.
Follow up: What if we want to find K closest points from a given point(m,n) instead of origin.
Round4: Given a list of Meetings, How would you find whether there is a conflict or not. Here, I was also expected to write the meeting class with the necessary attributes and write a method to check whether there is a conflict or not.
Follow up: Return all the meetings which had conflict
Follow up: Find the minimum number of rooms required to run all the meetings along with the room number used for each meeting.