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
2Hash TableStringGreedyHeap (Priority Queue)+1
6Linked ListTwo PointersStackRecursion
7ArrayHash TableSliding Window
8MediumInorder Successor in BST II
TreeBinary Search TreeBinary Tree
11MediumInorder Successor in BST
TreeDepth-First SearchBinary Search TreeBinary Tree
13Hash TableLinked ListDesignDoubly-Linked List
14TreeDepth-First SearchBreadth-First SearchBinary Tree
15Dynamic ProgrammingTreeDepth-First SearchBinary Tree
16EasyMoving Average from Data Stream
ArrayDesignQueueData Stream
18MediumMissing Element in Sorted Array
ArrayBinary Search
20Depth-First SearchBreadth-First SearchGraphTopological Sort
21ArrayHash TableMathBinary Search+2
23BacktrackingTreeDepth-First SearchBinary Tree
26ArrayHash TableDivide and ConquerSorting+4
27StringDynamic Programming
31TreeDepth-First SearchBinary Search TreeBinary Tree
32Two PointersStringDynamic Programming
33ArrayMathRecursionQueue+1
34TreeDesignBinary Search TreeHeap (Priority Queue)+2
35Linked ListDepth-First SearchDoubly-Linked List
36Hash TableStringDesignTrie
38ArrayStringBacktrackingDepth-First Search+1