Zenefits Coding Interview Questions
We track 19 coding questions asked at Zenefits, tagged with the algorithms and concepts they test. The most common: Array, String, Breadth-First Search, Depth-First Search, Divide and Conquer.
Browse all 19 Zenefits questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- String10.8%
- Array8.1%
- Backtracking7.8%
- Stack7.1%
- Linked List5.6%
- Design4.4%
- Divide and Conquer4.3%
- Breadth-First Search4.1%
- Depth-First Search4.1%
- Hash Table4.1%
- Other (20)39.5%
How many questions involve each concept
Share of all 19 tracked Zenefits questions that touch each concept. Questions usually involve several, so these overlap.
- Array31.6%
- String21.1%
- Breadth-First Search15.8%
- Depth-First Search15.8%
- Divide and Conquer15.8%
- Hash Table15.8%
- Linked List15.8%
- Stack15.8%
- Backtracking10.5%
- Counting10.5%
- Design10.5%
- Dynamic Programming10.5%
Where Zenefits differs from the average company
Concept weight at Zenefits relative to the average across all companies we track. Green means Zenefits leans on it harder than most.
- Topological Sort9.7×
- Backtracking6.0×
- Divide and Conquer5.4×
- Design3.4×
- Sorting0.67×
- Hash Table0.61×
- Dynamic Programming0.50×
- Array0.42×
Zenefits specialties
Concepts that show up at Zenefits but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 19 tracked Zenefits questions.
- Junior26% (5)
- Mid/Senior47% (9)
- Staff26% (5)
Every concept in Zenefits interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 6 | 31.6% | 8.1% |
| String | 4 | 21.1% | 10.8% |
| Breadth-First Search | 3 | 15.8% | 4.1% |
| Depth-First Search | 3 | 15.8% | 4.1% |
| Divide and Conquer | 3 | 15.8% | 4.3% |
| Hash Table | 3 | 15.8% | 4.1% |
| Linked List | 3 | 15.8% | 5.6% |
| Stack | 3 | 15.8% | 7.1% |
| Backtracking | 2 | 10.5% | 7.8% |
| Counting | 2 | 10.5% | 2.6% |
| Design | 2 | 10.5% | 4.4% |
| Dynamic Programming | 2 | 10.5% | 3.1% |
| Graph Theory | 2 | 10.5% | 2.9% |
| Sorting | 2 | 10.5% | 2.6% |
| Topological Sort | 2 | 10.5% | 2.9% |
| Two Pointers | 2 | 10.5% | 4.1% |
| Binary Search | 1 | 5.3% | 2.0% |
| Binary Search Tree | 1 | 5.3% | 1.2% |
| Binary Tree | 1 | 5.3% | 1.2% |
| Doubly-Linked List | 1 | 5.3% | 1.5% |
| Heap (Priority Queue) | 1 | 5.3% | 1.2% |
| Math | 1 | 5.3% | 2.9% |
| Matrix | 1 | 5.3% | 1.2% |
| Monotonic Queue | 1 | 5.3% | 1.2% |
| Monotonic Stack | 1 | 5.3% | 1.2% |
| Queue | 1 | 5.3% | 1.2% |
| Recursion | 1 | 5.3% | 2.9% |
| Sliding Window | 1 | 5.3% | 1.2% |
| Tree | 1 | 5.3% | 1.2% |
| Union-Find | 1 | 5.3% | 1.2% |
Practice a Zenefits interview
Take a realistic AI-led mock interview with questions Zenefits actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required