Zenefits interview questions¶
The most frequent LeetCode problems tagged to Zenefits. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 0 distinct problems tagged to Zenefits in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 21 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Convert Sorted List to Binary Search Tree | Medium | Older | Linked List, Divide and Conquer, Tree, Binary Search Tree |
| 2 | Course Schedule | Medium | Older | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort |
| 3 | Course Schedule II | Medium | Older | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort |
| 4 | Excel Sheet Column Title | Easy | Older | Math, String |
| 5 | Flatten 2D Vector | Medium | Older | Array, Two Pointers, Design, Iterator |
| 6 | Generate Parentheses | Medium | Older | String, Dynamic Programming, Backtracking, Bracket Sequences |
| 7 | Graph Valid Tree | Medium | Older | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory |
| 8 | LRU Cache | Medium | Older | Hash Table, Linked List, Design, Doubly-Linked List |
| 9 | Majority Element | Easy | Older | Array, Hash Table, Divide and Conquer, Sorting |
| 10 | Majority Element II | Medium | Older | Array, Hash Table, Sorting, Counting |
| 11 | Median of Two Sorted Arrays | Hard | Older | Array, Binary Search, Divide and Conquer |
| 12 | Min Stack | Medium | Older | Stack, Design |
| 13 | N-Queens II | Hard | Older | Backtracking, Algorithm X |
| 14 | Number of Islands | Medium | Older | Array, Depth-First Search, Breadth-First Search, Union-Find |
| 15 | Reverse Linked List | Easy | Older | Linked List, Recursion |
| 16 | Shortest Distance from All Buildings | Hard | Older | Array, Breadth-First Search, Matrix |
| 17 | Sliding Window Maximum | Hard | Older | Array, Queue, Sliding Window, Heap (Priority Queue) |
| 18 | Trapping Rain Water | Hard | Older | Array, Two Pointers, Dynamic Programming, Stack |
| 19 | Valid Palindrome | Easy | Older | Two Pointers, String |
| 20 | Valid Parentheses | Easy | Older | String, Stack, Bracket Sequences |
| 21 | Verify Preorder Sequence in Binary Search Tree | Medium | Older | Array, Stack, Tree, Binary Search Tree |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies