Problem database last updated: June 20, 2025
14 problems · 4 Easy, 7 Medium, 3 Hard · Ranked #115 of 458
4 Easy
29% · avg 23%
7 Medium
50% · avg 59%
3 Hard
21% · avg 18%
Based on 14 reported problems, Verkada interviews are in line with industry averages - 21% Hard vs 18% overall.
Compared to the industry average, Verkada puts unusual emphasis on design (21.4% of problems, 3.7x the industry average), divide-and-conquer (14.3% of problems, 3.4x the industry average), binary-search (21.4% of problems, 2.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (57.1%), string (28.6%), hash-table (21.4%), binary-search (21.4%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Snapshot Array Implement a SnapshotArray that supports the following interface: | Medium | Very Likely | arrayhash-tablebinary-search | Solve |
Maximum Profit in Job Scheduling We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. | Hard | Very Likely | arraybinary-searchdynamic-programming | Solve |
Non-overlapping Intervals Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the int... | Medium | Very Likely | arraydynamic-programminggreedy | Solve |
Basic Calculator II Given a string s which represents an expression, evaluate this expression and return its value. | Medium | Very Likely | mathstringstack | Solve |
Interval List Intersections You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of inte... | Medium | Very Likely | arraytwo-pointersline-sweep | Solve |
Guess the Word You are given an array of unique strings words where words[i] is six letters long. One word of words was chosen as a secret word. | Hard | Very Likely | arraymathstring | Solve |
Remove Sub-Folders from the Filesystem Given a list of folders folder, return the folders after removing all sub-folders in those folders. You may return the answer in any order. | Medium | Likely | arraystringdepth-first-search | Solve |
Merge k Sorted Lists You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. | Hard | Likely | linked-listdivide-and-conquerheap-priority-queue | Solve |
Transpose Matrix Given a 2D integer array matrix, return the transpose of matrix. | Easy | Likely | arraymatrixsimulation | Solve |
Diameter of Binary Tree Given the root of a binary tree, return the length of the diameter of the tree. | Easy | Likely | treedepth-first-searchbinary-tree | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Time Based Key-Value Store Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain... | Medium | Likely | hash-tablestringbinary-search | Solve |
Image Smoother An image smoother is a filter of the size 3 x 3 that can be applied to each cell of an image by rounding down the average of the cell and the eight surrounding... | Easy | Likely | arraymatrix | Solve |
Number of 1 Bits Given a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight). | Easy | Likely | divide-and-conquerbit-manipulation | Solve |
Snapshot Array
SolveImplement a SnapshotArray that supports the following interface:
Maximum Profit in Job Scheduling
SolveWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].
Non-overlapping Intervals
SolveGiven an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the int...
Basic Calculator II
SolveGiven a string s which represents an expression, evaluate this expression and return its value.
Interval List Intersections
SolveYou are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of inte...
Guess the Word
SolveYou are given an array of unique strings words where words[i] is six letters long. One word of words was chosen as a secret word.
Remove Sub-Folders from the Filesystem
SolveGiven a list of folders folder, return the folders after removing all sub-folders in those folders. You may return the answer in any order.
Merge k Sorted Lists
SolveYou are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Transpose Matrix
SolveGiven a 2D integer array matrix, return the transpose of matrix.
Diameter of Binary Tree
SolveGiven the root of a binary tree, return the length of the diameter of the tree.
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Time Based Key-Value Store
SolveDesign a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain...
Image Smoother
SolveAn image smoother is a filter of the size 3 x 3 that can be applied to each cell of an image by rounding down the average of the cell and the eight surrounding...
Number of 1 Bits
SolveGiven a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight).
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Verkada interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Verkada interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Verkada interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Verkada has been reported to ask 14 distinct coding problems. The most common topics are array, string, hash-table. 4 are Easy difficulty, 7 are Medium, and 3 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 14 reported problems, Verkada interviews are in line with industry averages - 21% Hard vs 18% overall. 50% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Verkada coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Verkada interview with AIarrow_forward
