Open In App

Arista Interview Experience |on campus|SDE

Last Updated : 01 Nov, 2024
Comments
Improve
Suggest changes
1 Likes
Like
Report

Interview Process Overview:

Stages:

  1. Online Test
  2. Technical Interviews: 2 Rounds

Online Test

Many candidates found the online test challenging; however, those familiar with the Striver DSA Sheet found it manageable.

Questions:

  • Question 1 (Greedy):
    • An easy greedy algorithm problem.
  • Question 2 (Dynamic Programming):
    • A straightforward 1D DP question for those experienced in dynamic programming.
    • The task was to find the maximum sum in an array, with options to either move sequentially or jump to prime numbers ending in 3.
    • This solution involved memoization and establishing proper logic for jumps based on number properties.
  • Question 3 (Graph):
    • A problem involving a directed cyclic graph.
    • Initially, I considered using Kahn’s algorithm due to the directed nature, but it turned out to be simpler to solve with a DFS-based approach since the graph was cyclic.
    • I partially solved the question, achieving 2.5 out of 3 correct solutions, which placed me 5th overall.

Observation: Some candidates were selected despite lower scores, likely influenced by diversity and inclusion considerations.

Interview Rounds

Technical Interview — Round 1

Resume Review: The interviewer had reviewed my resume but did not ask related questions, which is common among higher-paying companies that prioritize skills over resume details in initial rounds.

Questions:

  • C Language Code with Pointers:
    • I was required to code using C pointers and memory allocation techniques with malloc and calloc.
    • I requested to use C++ due to my familiarity with its syntax, but I was asked to proceed with C, which negatively impacted my performance.
  • Memory Allocation:
    • I explained the differences between static, dynamic, and register memory allocation in C/C++.
    • In a follow-up, we discussed the storage mechanisms for static and constant variables.
  • Linked List:
    • I was tasked with reversing a linked list in k-sized parts.
    • I coded it from scratch and presented two approaches, although I encountered some issues.
  • Copy Mechanisms:
    • I explained the concepts of shallow copy and deep copy.

Feedback: The interviewer indicated that my performance on the first question significantly influenced their assessment.

Verdict

Outcome: Not selected.

Result: Out of the candidates interviewed, five were selected, primarily based on their strong foundational skills.


Explore