Arista Networks Interview Questions — 38 DSA Problems

34 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Arista Networks LeetCode questions for software engineering interviews.

• Restore IP Addresses (MEDIUM) — String, Backtracking
• Construct String With Repeat Limit (MEDIUM) — Hash Table, String, Greedy, Heap (Priority Queue), Counting
• Find the Town Judge (EASY) — Array, Hash Table, Graph
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion
• Reverse Linked List II (MEDIUM) — Linked List
• Reorder List (MEDIUM) — Linked List, Two Pointers, Stack, Recursion
• Contains Duplicate II (EASY) — Array, Hash Table, Sliding Window
• Inorder Successor in BST II (MEDIUM) — Tree, Binary Search Tree, Binary Tree
• Rotated Digits (MEDIUM) — Math, Dynamic Programming
• Remove Linked List Elements (EASY) — Linked List, Recursion
• Inorder Successor in BST (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Maximum Depth of Binary Tree (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• Moving Average from Data Stream (EASY) — Array, Design, Queue, Data Stream
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Missing Element in Sorted Array (MEDIUM) — Array, Binary Search
• Maximum Units on a Truck (EASY) — Array, Greedy, Sorting
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Missing Number (EASY) — Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting
• Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix
• Path Sum II (MEDIUM) — Backtracking, Tree, Depth-First Search, Binary Tree
• Kth Missing Positive Number (EASY) — Array, Binary Search
• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Longest Common Subsequence (MEDIUM) — String, Dynamic Programming
• Remove All Occurrences of a Substring (MEDIUM) — String, Stack, Simulation
• Merge In Between Linked Lists (MEDIUM) — Linked List
• Contains Duplicate (EASY) — Array, Hash Table, Sorting
• Validate Binary Search Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Palindromic Substrings (MEDIUM) — Two Pointers, String, Dynamic Programming
• Find the Winner of the Circular Game (MEDIUM) — Array, Math, Recursion, Queue, Simulation
• Kth Largest Element in a Stream (EASY) — Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Stream
• Flatten a Multilevel Doubly Linked List (MEDIUM) — Linked List, Depth-First Search, Doubly-Linked List
• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix