Zenefits LeetCode Questions
21 questions all-time · 5 easy · 11 medium · 5 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 100 | 0.5% |
| 2 | Valid Parentheses String, Stack | Easy | 100 | 0.4% |
| 3 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 100 | 0.8% |
| 4 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 100 | 0.7% |
| 5 | N-Queens II Backtracking | Hard | 100 | 0.8% |
| 6 | Convert Sorted List to Binary Search Tree Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | Medium | 100 | 0.7% |
| 7 | Valid Palindrome Two Pointers, String | Easy | 100 | 0.5% |
| 8 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 100 | 0.5% |
| 9 | Min Stack Stack, Design | Medium | 100 | 0.6% |
| 10 | Excel Sheet Column Title Math, String | Easy | 100 | 0.5% |
| 11 | Majority Element Array, Hash Table, Divide and Conquer, Sorting, Counting | Easy | 100 | 0.7% |
| 12 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 100 | 0.6% |
| 13 | Reverse Linked List Linked List, Recursion | Easy | 100 | 0.8% |
| 14 | Course Schedule Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 100 | 0.5% |
| 15 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 100 | 0.6% |
| 16 | Majority Element II Array, Hash Table, Sorting, Counting | Medium | 100 | 0.6% |
| 17 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 100 | 0.5% |
| 18 | Flatten 2D Vector Array, Two Pointers, Design, Iterator | Medium | 100 | 0.5% |
| 19 | Verify Preorder Sequence in Binary Search Tree Array, Stack, Tree, Binary Search Tree, Recursion, Monotonic Stack, Binary Tree | Medium | 100 | 0.5% |
| 20 | Graph Valid Tree Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 100 | 0.5% |
| 21 | Shortest Distance from All Buildings Array, Breadth-First Search, Matrix | Hard | 100 | 0.4% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.