Interview Prep/Companies/Arista Networks
AN

Arista Networks

38 questions tracked34 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 38 of 38 questions

1
MediumRestore IP Addressesβœ“ Our Solution
100
StringBacktracking
2
MediumConstruct String With Repeat Limitβœ“ Our Solution
100
Hash TableStringGreedyHeap (Priority Queue)+1
3
EasyFind the Town Judgeβœ“ Our Solution
98
ArrayHash TableGraph
4
HardReverse Nodes in k-Groupβœ“ Our Solution
95
Linked ListRecursion
5
MediumReverse Linked List IIβœ“ Our Solution
95
Linked List
6
MediumReorder Listβœ“ Our Solution
89
Linked ListTwo PointersStackRecursion
7
EasyContains Duplicate IIβœ“ Our Solution
80
ArrayHash TableSliding Window
8
MediumInorder Successor in BST II
80
TreeBinary Search TreeBinary Tree
9
MediumRotated Digitsβœ“ Our Solution
80
MathDynamic Programming
10
EasyRemove Linked List Elementsβœ“ Our Solution
75
Linked ListRecursion
11
MediumInorder Successor in BST
75
TreeDepth-First SearchBinary Search TreeBinary Tree
12
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
75
ArrayBinary Search
13
MediumLRU Cacheβœ“ Our Solution
75
Hash TableLinked ListDesignDoubly-Linked List
14
EasyMaximum Depth of Binary Treeβœ“ Our Solution
67
TreeDepth-First SearchBreadth-First SearchBinary Tree
15
HardBinary Tree Maximum Path Sumβœ“ Our Solution
67
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
16
EasyMoving Average from Data Stream
67
ArrayDesignQueueData Stream
17
EasyMerge Two Sorted Listsβœ“ Our Solution
67
Linked ListRecursion
18
MediumMissing Element in Sorted Array
67
ArrayBinary Search
19
EasyMaximum Units on a Truckβœ“ Our Solution
67
ArrayGreedySorting
20
MediumCourse Schedule IIβœ“ Our Solution
67
Depth-First SearchBreadth-First SearchGraphTopological Sort
21
EasyMissing Numberβœ“ Our Solution
67
ArrayHash TableMathBinary Search+2
22
MediumSearch a 2D Matrixβœ“ Our Solution
57
ArrayBinary SearchMatrix
23
MediumPath Sum IIβœ“ Our Solution
57
BacktrackingTreeDepth-First SearchBinary Tree
24
EasyKth Missing Positive Numberβœ“ Our Solution
57
ArrayBinary Search
25
MediumInteger to Romanβœ“ Our Solution
57
Hash TableMathString
26
MediumTop K Frequent Elementsβœ“ Our Solution
57
ArrayHash TableDivide and ConquerSorting+4
27
MediumLongest Common Subsequenceβœ“ Our Solution
57
StringDynamic Programming
28
MediumRemove All Occurrences of a Substringβœ“ Our Solution
57
StringStackSimulation
29
MediumMerge In Between Linked Listsβœ“ Our Solution
57
Linked List
30
EasyContains Duplicateβœ“ Our Solution
57
ArrayHash TableSorting
31
MediumValidate Binary Search Treeβœ“ Our Solution
57
TreeDepth-First SearchBinary Search TreeBinary Tree
32
MediumPalindromic Substringsβœ“ Our Solution
57
Two PointersStringDynamic Programming
33
MediumFind the Winner of the Circular Gameβœ“ Our Solution
57
ArrayMathRecursionQueue+1
34
EasyKth Largest Element in a Streamβœ“ Our Solution
57
TreeDesignBinary Search TreeHeap (Priority Queue)+2
35
MediumFlatten a Multilevel Doubly Linked Listβœ“ Our Solution
57
Linked ListDepth-First SearchDoubly-Linked List
36
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
57
Hash TableStringDesignTrie
37
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
57
ArrayDynamic Programming
38
MediumWord Searchβœ“ Our Solution
57
ArrayStringBacktrackingDepth-First Search+1