Drivetrain.ai SDE-2 Interview Experience (1.8 YOE)

Experience
1.8 years
Posted
17 Jun 2026
43 reads

Summary

I completed five interview rounds for an SDE-2 position at Drivetrain.ai, solving several DSA problems, and received an offer which I declined due to compensation.

How it went

Drivetrain.ai SDE-2 Interview Experience (1.8 YOE)

Round 1 – HR Screening Quick discussion about experience, projects, expectations, and notice period.

Round 2 – Technical

  • Sliding Window Maximum (solved both brute force and optimal deque solution)
  • Weighted Random Selection
  • Find all possible recipes given recipes, ingredients, and supplies (Topological Sort / BFS)

Solved both questions within the 1-hour round.

Round 3 – Technical

  • DP problem: minimize difference between sums of two subsets
  • Design a data structure supporting push, pop, top, getMax, and getMin, and difference of Max - Min at any point. All Operations are expected to be O(1)

Solved both questions within the 1-hour round.

Round 4 – CTO Round (30 mins) Given a probability-based problem that required a binary search approach. Was able to identify the pattern and solve it in around 15 minutes. The remaining time was spent discussing optimizations and edge cases.

Round 5 – CEO Round General discussion around culture fit, startup expectations, and career goals.

Offer

  • SDE-2

  • Base: ₹24 LPA

  • Fixed Bonus: ₹3 LPA

  • Total Compensation - ₹27 LPA Fixed

  • Remote

  • Current Compensation - ₹22 LPA

Outcome

Received the offer but decided not to proceed as we couldn't reach an agreement on compensation.

Overall, a good interview process with strong focus on DSA, problem-solving, and fundamentals.

Questions asked (6)

  1. 01

    Sliding Window Maximum

    Data Structures & Algorithms

    Find the maximum value in each sliding window of size k across an array. I solved it using both a brute‑force approach and an optimal deque‑based solution.

  2. 02

    Weighted Random Selection

    Data Structures & Algorithms

    Given a set of items each with an associated weight, select an item randomly such that the probability of picking an item is proportional to its weight.

  3. 03

    Find All Possible Recipes (Topological Sort / BFS)

    Data Structures & Algorithms

    Given a list of recipes, the ingredients required for each recipe, and a list of available supplies, determine which recipes can be prepared. The solution uses topological sorting or BFS to resolve dependencies.

  4. 04

    Partition Subset Sum Minimum Difference

    Data Structures & Algorithms

    Given an array of integers, partition it into two subsets so that the absolute difference between the sums of the subsets is minimized.

  5. 05

    Data Structure with Max, Min, and Difference

    Data Structures & Algorithms

    Design a data structure that supports push, pop, top, getMax, getMin, and retrieving the difference between the current maximum and minimum values, all in O(1) time.

  6. 06

    Probability Binary Search Problem

    Data Structures & Algorithms

    A probability‑based problem where the solution requires identifying a pattern and applying binary search to find the answer efficiently.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Drivetrain.ai recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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