Zenefits Questions
Here are the LeetCode questions for Zenefits.
Total: 21
Easy: 5
Medium: 11
Hard: 5
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 9 | |
| 2 | Breadth-First Search | 5 | |
| 3 | String | 4 | |
| 4 | Stack | 4 | |
| 5 | Depth-First Search | 4 | |
| 6 | Hash Table | 3 | |
| 7 | Linked List | 3 | |
| 8 | Two Pointers | 3 | |
| 9 | Divide and Conquer | 3 | |
| 10 | Graph Theory | 3 | |
| 11 | Design | 3 | |
| 12 | Dynamic Programming | 2 | |
| 13 | Backtracking | 2 | |
| 14 | Tree | 2 | |
| 15 | Union-Find | 2 | |
| 16 | Topological Sort | 2 | |
| 17 | Binary Search Tree | 2 | |
| 18 | Recursion | 2 | |
| 19 | Sorting | 2 | |
| 20 | Matrix | 2 | |
| 21 | Monotonic Stack | 2 | |
| 22 | Binary Tree | 2 | |
| 23 | Counting | 2 | |
| 24 | Math | 1 | |
| 25 | Binary Search | 1 | |
| 26 | Queue | 1 | |
| 27 | Sliding Window | 1 | |
| 28 | Heap (Priority Queue) | 1 | |
| 29 | Doubly-Linked List | 1 | |
| 30 | Iterator | 1 | |
| 31 | Monotonic Queue | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Shortest Distance from All Buildings | Visit | Hard | |
| 2 | Graph Valid Tree | Visit | Medium | |
| 3 | Verify Preorder Sequence in Binary Search Tree | Visit | Medium | |
| 4 | Flatten 2D Vector | Visit | Medium | |
| 5 | Sliding Window Maximum | Visit | Hard | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 21 questions for free!
Log InFrequently Asked Questions
Common questions about Zenefits interviews