Verkada Interview Questions — 15 DSA Problems

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

Most frequently asked Verkada LeetCode questions for software engineering interviews.

• Snapshot Array (MEDIUM) — Array, Hash Table, Binary Search, Design
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Interval List Intersections (MEDIUM) — Array, Two Pointers, Line Sweep
• Guess the Word (HARD) — Array, Math, String, Interactive, Game Theory
• Non-overlapping Intervals (MEDIUM) — Array, Dynamic Programming, Greedy, Sorting
• Basic Calculator II (MEDIUM) — Math, String, Stack
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Remove Sub-Folders from the Filesystem (MEDIUM) — Array, String, Depth-First Search, Trie
• Transpose Matrix (EASY) — Array, Matrix, Simulation
• Image Smoother (EASY) — Array, Matrix
• Basic Calculator III (HARD) — Math, String, Stack, Recursion
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Diameter of Binary Tree (EASY) — Tree, Depth-First Search, Binary Tree
• Number of 1 Bits (EASY) — Divide and Conquer, Bit Manipulation
• Time Based Key-Value Store (MEDIUM) — Hash Table, String, Binary Search, Design