Company: Databricks
Status: Selected
Qualification: BTech in CSE from IIITH (2025 grad)
Position: Software Engineer
Location: Bengaluru
Interview Process (On-campus hiring): Resume Shortlisting → Two Technical Rounds → Hiring Manager Round

Round 1: Technical Interview
Problem Statement:
Given a tree and some target nodes. The tree is undirected and need not be binary. Each edge length is 1.
Task: Starting from the root, find the minimum cost to traverse all target nodes and return to the root.

Follow-up:
What if you can start from any node instead of the root?

Round 2: Technical Interview
Problem Statement:
Given a list of servers, each server has a cost associated with it. The servers are represented as an array of N integers.

If you choose server i, then i servers ahead of it are automatically selected.
You may skip selecting those servers, but sometimes it might be beneficial to select them as well.
Find the min cost to cover all servers.

Started with an O(n log n) solution.
Later optimized it to O(n).

Round 3: Hiring Manager Round
Focused on behavioral questions and past internship experiences.
Questions based on teamwork, problem-solving approach, and decision-making in challenging situations.