Arista Networks 2025 [Rejected]
Summary
I interviewed with Arista Networks, solving two DSA problems and answering Java theory questions, but ultimately received a rejection despite feeling confident in my performance.
Full Experience
I had an interview with Arista Networks. The discussion started with my current work. Following that, I was given two DSA problems: 'Search in Rotated Sorted Array' and 'Longest Substring Without Repeating Characters'. There were also several Java-specific theory questions, including topics like the Singleton pattern, and the static and final keywords. I successfully solved both DSA problems and provided answers for all the theory questions. I felt confident about qualifying for the next round, but unfortunately, I received a rejection. I'm unsure what companies are looking for these days; perhaps the position was filled or there was a misalignment with the role. Nevertheless, I wish everyone the best of luck!
Interview Questions (5)
Given a sorted array that has been rotated at some pivot unknown to you beforehand, search for a given target value. If the target is found in the array, return its index, otherwise return -1. You may assume no duplicate exists in the array.
Given a string s, find the length of the longest substring without repeating characters.
Explain the Singleton design pattern in Java, including its purpose, common implementations (e.g., eager, lazy, thread-safe), and scenarios where it is typically used.
Describe the static keyword in Java. Discuss its usage with variables, methods, and blocks, and explain its implications for memory management and access.
Explain the final keyword in Java. Discuss its application to variables, methods, and classes, and describe the behavior and restrictions it imposes in each context.