Zenefits
21 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 4. Median of Two Sorted Arrays | Hard | 100% | TopicsArrayBinary SearchDivide and Conquer |
| 20. Valid Parentheses | Easy | 100% | TopicsStringStackBracket Sequences |
| 22. Generate Parentheses | Medium | 100% | TopicsStringDynamic ProgrammingBacktrackingBracket Sequences |
| 42. Trapping Rain Water | Hard | 100% | TopicsArrayTwo PointersDynamic ProgrammingStackMonotonic Stack |
| N-Queens II | Hard | 100% | TopicsBacktrackingAlgorithm X |
| Convert Sorted List to Binary Search Tree | Medium | 100% | TopicsLinked ListDivide and ConquerTreeBinary Search TreeBinary Tree |
| 125. Valid Palindrome | Easy | 100% | TopicsTwo PointersString |
| 146. LRU Cache | Medium | 100% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 155. Min Stack | Medium | 100% | TopicsStackDesign |
| Excel Sheet Column Title | Easy | 100% | TopicsMathString |
| 169. Majority Element | Easy | 100% | TopicsArrayHash TableDivide and ConquerSortingCountingBoyer–Moore Majority Vote Algorithm |
| 200. Number of Islands | Medium | 100% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 206. Reverse Linked List | Easy | 100% | TopicsLinked ListRecursion |
| 207. Course Schedule | Medium | 100% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 210. Course Schedule II | Medium | 100% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort |
| Majority Element II | Medium | 100% | TopicsArrayHash TableSortingCountingBoyer–Moore Majority Vote Algorithm |
| Sliding Window Maximum | Hard | 100% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query |
| Flatten 2D Vector | Medium | 100% | TopicsArrayTwo PointersDesignIterator |
| Verify Preorder Sequence in Binary Search Tree | Medium | 100% | TopicsArrayStackTreeBinary Search TreeRecursionMonotonic StackBinary Tree |
| 261. Graph Valid Tree | Medium | 100% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Shortest Distance from All Buildings | Hard | 100% | TopicsArrayBreadth-First SearchMatrix |
