DSA Doctor
Verified Company Vault
Arista Networks DSA Interview Questions
38 curated coding interview questions directly asked in Arista Networks technical rounds, sorted by frequency with recency and difficulty diagnostics.
38
Total Questions
11 (29%)
Easy Problems
26 (68%)
Medium Problems
1 (3%)
Hard Problems
🔥 Most Tested Topics:
Arrays (12)Trees (9)Strings (9)Linked List (8)Core DSA (3)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 268 | Missing Number | Easy | Arrays | Sorting / Prefix / Scan | 72.0% | 100.0% | 6m |
| 997 | Find the Town Judge | Easy | Graphs | BFS / DFS / Topological Sort | 50.8% | 100.0% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 100.0% | all |
| 2182 | Construct String With Repeat Limit | Medium | Strings | Hashing / Sliding Window | 70.8% | 100.0% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 87.5% | all |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 87.5% | all |
| 92 | Reverse Linked List II | Medium | Linked List | Two Pointers | 51.5% | 75.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | all |
| 219 | Contains Duplicate II | Easy | Arrays | Sorting / Prefix / Scan | 51.3% | 75.0% | all |
| 510 | Inorder Successor in BST II | Medium | Trees | DFS / BFS | 61.1% | 75.0% | all |
| 203 | Remove Linked List Elements | Easy | Linked List | Two Pointers | 54.5% | 75.0% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 75.0% | all |
| 104 | Maximum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 75.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 75.0% | all |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 75.0% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | all |
| 788 | Rotated Digits | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 64.0% | 62.5% | all |
| 1669 | Merge In Between Linked Lists | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 83.0% | 62.5% | all |
| 1710 | Maximum Units on a Truck | Easy | Arrays | Sorting / Prefix / Scan | 74.9% | 62.5% | all |
| 703 | Kth Largest Element in a Stream | Easy | Heap | Priority Queue | 61.0% | 62.5% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 62.5% | all |
| 113 | Path Sum II | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 62.2% | 62.5% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 62.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 62.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | all |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 62.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 62.5% | all |
| 1910 | Remove All Occurrences of a Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 78.5% | 62.5% | all |
| 82 | Remove Duplicates from Sorted List II | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 51.8% | 62.5% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 62.5% | all |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 62.5% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 24 | Swap Nodes in Pairs | Medium | Trees | DFS / BFS | 69.5% | 62.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 62.5% | all |
| 1351 | Count Negative Numbers in a Sorted Matrix | Easy | Arrays | Sorting / Prefix / Scan | 79.6% | 62.5% | all |
| 346 | Moving Average from Data Stream | Easy | Core DSA | Implementation / Reasoning | 80.2% | 62.5% | all |