Company interviews / Arista Networks
Arista Networks interview practice
36 coding questions are known to come up in Arista Networks interviews (9 easy, 25 medium, 2 hard), 1 of them in the last six months. The most common topics are String, Hash Table, Linked List, Array.
36Known questions
1Asked in last 6 months
25Medium
2Hard
Coding questions Arista Networks asks
From public company-tagged interview question lists. Most recent and most frequent first.
Easy 9Medium 25Hard 2
- String12
- Hash Table11
- Linked List11
- Array10
- Recursion7
- Two Pointers5
- Stack5
- Dynamic Programming5
- Backtracking4
- Design3
- Depth-First Search3
- Math3
| Question | Difficulty | Asked recently |
|---|---|---|
| LFU Cache | Hard | Yes |
| Construct String With Repeat Limit | Medium | — |
| Find the Town Judge | Easy | — |
| Restore IP Addresses | Medium | — |
| Reverse Nodes in k-Group | Hard | — |
| Course Schedule II | Medium | — |
| LRU Cache | Medium | — |
| Reorder List | Medium | — |
| Reverse Linked List II | Medium | — |
| Missing Number | Easy | — |
| Contains Duplicate II | Easy | — |
| Copy List with Random Pointer | Medium | — |
| Maximum Depth of Binary Tree | Easy | — |
| Search in Rotated Sorted Array | Medium | — |
| Rotated Digits | Medium | — |
| Remove Linked List Elements | Easy | — |
| Remove Duplicates from Sorted List II | Medium | — |
| Simplify Path | Medium | — |
| Permutations | Medium | — |
| Remove All Occurrences of a Substring | Medium | — |
| Count Negative Numbers in a Sorted Matrix | Easy | — |
| Maximum Number of Occurrences of a Substring | Medium | — |
| Palindromic Substrings | Medium | — |
| Decode String | Medium | — |
| Top K Frequent Elements | Medium | — |
Practice a Arista Networks interview
Take the same AI interview a Arista Networks candidate would face: you talk it through while you code, and get a scorecard with what earned each score. Three single-question interviews a day are free.