Arista Networks

# Interview Experience ## Round 0: Written Round **Format**: 15 CS core MCQs + 3 coding questions. **Duration**: 1.5 hours. ### Coding Questions: **LeetCode Easy**: Standard problem. **LeetCode Hard**: Given a binary string, find the number of substrings with an equal number of 1s and 0s where all 1s are together and all 0s are together. **LeetCode Hard**: Given an undirected tree with a certain number of stones on each node, you can add any number of stones to any node. Find the minimum number of stones to be added such that, for every pair of adjacent nodes, the absolute difference in the number of stones is at most 1. *Performance**: Solved the first two completely and passed 10/15 test cases for the third question. ## Round 1: Technical **Code Debugging**: Provided with a C++ code snippet involving recursion; required to find the error and correct it. **DSA Coding**: Check if a linked list is a palindrome. Check if a given BST is height-balanced. **Projects & Core CS**: Discussion regarding personal projects and questions on Operating Systems (OS). ## Round 2: Technical/Managerial **Work Experience**: Detailed explanation of past work experience and projects. Since I had a Flutter project, there were many in-depth questions regarding Flutter. **Core CS**: Questions on Computer Networks (CN) and Operating Systems (OS). **DSA Pseudo-code**: Write a pseudo-code for: Given a binary tree, find the 2nd highest sum of a path from root to leaf nodes. ## Summary of Experience DSA was of easy to medium level. The primary focus of the interviewers was to check the understanding of core CS concepts like OS and CN. They also emphasize deep knowledge about the projects mentioned in the resume and the specific technologies used.