Anakin (YC21) | SDE-2 | Interview Experience

anakin logo
anakin
SDE-2
April 12, 20255 reads

Summary

I applied for an SDE II-Backend role at Anakin, going through a multi-round interview process that included pre-screening, live coding, machine coding, and HLD/project discussion. Unfortunately, I was unable to pass all test cases in the live coding round, which likely led to my elimination at that stage.

Full Experience

I saw a post on LinkedIn by a talent acquisition lead for a SDE II-Backend opportunity where those interested had to apply through a google form link. Seemed like they were focused on hiring graduates from premium colleges (top IITs, NITs, IIITs, etc). I filled the google form and got a call from the recruiter few hours later to discuss about the opportunity in brief and conduct a pre-screening assessment. After clearing the prescreening, he described the interview format and asked my availability to schedule for the same.

Interview Process Round 1: Live Coding/DSA (60 mins) - Assessment on Code quality, optimisation, solution completion and logical explanation. Round 2: Machine coding (60 mins)- Assessment on Solution completion, Code quality(Modular, Readable, Extendable), Design Pattern, Schema design(Data modelling), Communication(Logical explanation), Thread safety Round 3: HLD + Project Discussion (90 mins)- Assessment on API design, Schema design, system design aptitude, Deep-dive on Distributed System (Scalability, Fault tolerance, System robustness and related topics), Project understanding

Round 0 - Pre-Screening (15 mins)

  1. Which data-structure would you use to implement an undo function in a text-editor? Ans: Stack.
  2. Which data-structure would you use for forward and backward browser navigation? Ans: 2 stacks, one to track forward and one for backward.
  3. To build a search feature for a ecommerce platform efficiently. Ans: For simple search using SQL, LIKE operator. But not efficient for large datasets. Indexing and search optimized DBs for bit more complex queries that can handle full-text search, for best results we can use cloud search engines like Elasticsearch (supports advanced search features like fuzzy matching).
  4. When a new product is launched and millions of users are searching that new product in the same ecommerce platform, in what ways can we reduce the load on the system? Ans: Use in memory cache (e.g. Redis) to reduce database load, database sharding to distribute the load across multiple nodes, load balancer to distribute traffic evenly among the servers and appropriate scaling, and usage of Content Delivery Network (CDN) to cache static content like photos, HTML, CSS, JS.

Round 1 - Live Coding/DSA (60 mins)

I was given 2 LC problems to be solved in 1 hour.

  1. https://leetcode.com/problems/minimum-division-operations-to-make-array-non-decreasing/
  2. https://leetcode.com/problems/apply-operations-to-make-all-array-elements-equal-to-zero/

Unfortunately, I was unable to pass all the TCs in both problems, hence most likely got out in this round itself.

Interview Questions (6)

Q1
Data Structure for Undo Function in Text Editor
Data Structures & Algorithms

Which data-structure would you use to implement an undo function in a text-editor?

Q2
Data Structure for Browser Navigation
Data Structures & Algorithms

Which data-structure would you use for forward and backward browser navigation?

Q3
Efficient Search Feature for E-commerce Platform
System Design

To build a search feature for a ecommerce platform efficiently.

Q4
Reduce System Load for New Product Launch
System Design

When a new product is launched and millions of users are searching that new product in the same ecommerce platform, in what ways can we reduce the load on the system?

Q5
Minimum Division Operations to Make Array Non-decreasing
Data Structures & Algorithms
Q6
Apply Operations to Make All Array Elements Equal to Zero
Data Structures & Algorithms
Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!