Arista Networks Software Developer Intern Interview Questions and Answers

Q1. Bfs tree traversal
Ans. 
BFS tree traversal visits nodes level by level starting from the root.
• Start at the root node and visit its children before moving on to the next level.

• Use a queue data structure to keep track of nodes to visit next.

• BFS is often used to find the shortest path in unweighted graphs.
Answered by AI
Add your answer
Q2. Resume and core
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

There were 25 mcqs and 1 coding question. OS, aptitude, C and C++ concepts were the main focus. 

Q1. Which feature of the operating system is being used here?
Add your answer
Q2. 
Count of Sum of Consecutives Problem Statement
You are given a positive integer 'N'. Your objective is to determine the number of ways to express 'N' as the sum of two or more consecutive natural numbers.
...read more
Ans. Brute Force Approach
Approach:
 
In this brute force approach,. We will iterate from 1 to ‘N’ using the iterator i and will check if there is a possible sequence of consecutive positive integers such that their sum is ‘N’, and the ending integer of the consecutive sequence is 'i'. The checking will be done as follows:
• We know that the ending position is ‘i’. Therefore, we need to find a starting point for the consecut...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was of 60 minutes,

Questions asked were
1. Swap without temp variable
2. A problem question in which I was asked to find the ball with odd weight out of the remaining in the least number of attempts and write an algorithm for it.
3. Code to insert in the middle of circular linked list, code to find middle element of a singly linked list with knowing the number of elements in it.
4. Socket programming
5. Operating system concepts
6. Types of joins in DBMS
7. A DBMS query
8. Print in C without a semi colon
9. If I have any questions in the end.

Q1. 
Swap Numbers Without Temporary Variable
Your task is to interchange the values of two numbers given as variables 'X' and 'Y' without using a temporary variable or any additional variable.
Explanation:
Y...read more
Ans. Addition Approach
• Idea is to get the sum of given two-variable ‘X’ and ‘Y’ in an ‘X’ = ‘X’ + ‘Y’.
• Value of swapped ‘Y’ can get by ‘X’ - ‘Y’ = (‘X’ + ‘Y’) - ‘Y’ = ‘X’
• Value of swapped ‘X’ can get by ‘X’ - ‘Y’ = (‘X’ + ‘Y’) - ‘Y’ = (‘X’ + ‘Y’) - ‘X’ = ‘Y’
• The current value of ‘Y’ is the initial value of ‘X’
• Suppose ‘X’ is 10 and ‘Y’ is 20 then
  • ‘X’ = ‘X’ + ‘Y’ = 20+10’
  • Swapped value of ‘Y’ is ‘X’- ‘Y’ = 30-20 = 10’
  • And the swappe...read more
Answered Anonymously
Add your answer

Very good but easy
easy question long question

Q1. Java codingg on sql programming
Add your answer
Q2. Colection framework java concept
Add your answer

Q1. Data structure algorithm questions related to various scenarios
Add your answer
Q2. DS Algo related questions which revolved around different scenarios
Add your answer

It includes two DSA questions and some aptitude questions

Q1. Introduce yourself
Add your answer
Q2. Give the maximum element at any point of time for after pop and push
Add your answer
Q3. Reverse a string
Add your answer

Difficult online round

Q1. Arrays from neetcode
Ans. 
Arrays are a collection of strings in programming used to store multiple values under a single variable name.
• Arrays are declared using square brackets []

• Each element in an array is accessed by its index, starting from 0

• Example: var fruits = ['apple', 'banana', 'orange']
Answered by AI
Add your answer
Q2. Linked list from neetcode
Add your answer

Q1. Trees in neet code
Ans. 
Trees in neet code refer to the implementation of tree data structures in coding challenges on the platform NeetCode.
• Trees are a common data structure used in coding challenges to represent hierarchical relationships between data.

• Common tree operations include traversal (inorder, preorder, postorder), insertion, deletion, and searching.

• Examples of tree-related coding challenges on NeetCode include implementing a binary...read more
Answered by AI
Add your answer
Q2. Trees in leet code
Ans. 
Trees in leetcode are a common topic for coding interviews, involving various tree traversal and manipulation techniques.
• Understand different tree traversal methods like inorder, preorder, and postorder.

• Learn about common tree algorithms like finding the height, diameter, and lowest common ancestor.

• Practice solving tree-related problems on leetcode to improve your skills.
Answered by AI
Add your answer