Arista Networks | Interview Experience

arista networks logo
arista networks
backend role (Golang)Bangalore4.5 years
July 24, 20253 reads

Summary

I interviewed for a backend role at Arista Networks in Bangalore, undergoing three rounds focused on DSA, core concepts, HLD/LLD, and project discussion. Despite receiving positive feedback after each round, the position was ultimately filled by another candidate, likely due to my remote location hindering an in-person final round.

Full Experience

YOE: 4.5

Got reached out by a recruiter via Naukri for a backend role (Golang) based in Bangalore. The process was briefed as 3 rounds with the final round being in-person with the director for which travel and accommodation expenses would be reimbursed.

Round 1 – DSA + Core Concepts (1 hour)
1 easy problem on Binary Search: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/

1 medium-level DSA problem: https://leetcode.com/problems/insert-delete-getrandom-o1/description/

Followed by an in-depth discussion on the internal working of HashMap

Received positive feedback next week, and the second round was scheduled the following week with the Engineering Manager.

Round 2 – HLD + LLD + Project Discussion (90 minutes)

Deep dive into the architecture of my current project

LLD of a Parking Lot system with focus on core entities, classes & concurrency handling

Again, received positive feedback a week later. I was told the final round would be confirmed soon, pending clarity on whether it would be virtual or in-person (as I’m not located in Bangalore).

Unfortunately, after two weeks of silence and multiple follow-ups, I was informed that the position had been filled.

I believe they went ahead with a candidate who was already in Bangalore and could attend the in-person round. Later saw a compensation post on leetcode as well which suggested the same. The lack of transparency and prolonged delays felt disheartening especially after investing time and energy into multiple rounds.

Interview Questions (5)

Q1
Find Minimum in Rotated Sorted Array
Data Structures & AlgorithmsEasy

Given a sorted array that has been rotated at some pivot unknown to you beforehand, find the minimum element. You may assume no duplicate exists in the array.

Q2
Insert Delete GetRandom O(1)
Data Structures & AlgorithmsMedium

Design a data structure that supports inserting, deleting, and getting a random element in O(1) average time. All operations should be efficient and handle edge cases.

Q3
Internal Working of HashMap
Data Structures & Algorithms

An in-depth discussion on the internal working mechanisms of a HashMap data structure, including collision resolution strategies, resizing logic, and factors affecting its performance.

Q4
Current Project Architecture Discussion
Other

A deep dive into the architecture of the candidate's current project, including components, technologies used, design choices, challenges faced, and how they were addressed.

Q5
Low-Level Design (LLD) of a Parking Lot System
System DesignMedium

Design a Low-Level Design (LLD) for a Parking Lot system, focusing on identifying core entities, defining classes and their relationships, and implementing mechanisms for concurrency handling.

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!