Zenefits LeetCode interview questions

Explore Zenefits questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 21

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Median of Two Sorted Arrays Array Binary Search Divide and Conquer HARD	Hard	100.0%	0.5%
Valid Parentheses String Stack Bracket Sequences EASY	Easy	100.0%	0.5%
Generate Parentheses String Dynamic Programming Backtracking +1 MEDIUM	Medium	100.0%	0.8%
Trapping Rain Water Array Two Pointers Dynamic Programming +2 HARD	Hard	100.0%	0.7%
N-Queens II Backtracking Algorithm X HARD	Hard	100.0%	0.8%
Convert Sorted List to Binary Search Tree Linked List Divide and Conquer Tree +2 MEDIUM	Medium	100.0%	0.7%
Valid Palindrome Two Pointers String EASY	Easy	100.0%	0.5%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	100.0%	0.5%
Min Stack Stack Design MEDIUM	Medium	100.0%	0.6%
Excel Sheet Column Title Math String EASY	Easy	100.0%	0.5%
Majority Element Array Hash Table Divide and Conquer +3 EASY	Easy	100.0%	0.7%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	100.0%	0.7%
Reverse Linked List Linked List Recursion EASY	Easy	100.0%	0.8%
Course Schedule Depth-First Search Breadth-First Search Graph Theory +2 MEDIUM	Medium	100.0%	0.5%
Course Schedule II Depth-First Search Breadth-First Search Graph Theory +1 MEDIUM	Medium	100.0%	0.6%
Majority Element II Array Hash Table Sorting +2 MEDIUM	Medium	100.0%	0.6%
Sliding Window Maximum Array Queue Sliding Window +3 HARD	Hard	100.0%	0.5%
Flatten 2D Vector Array Two Pointers Design +1 MEDIUM	Medium	100.0%	0.5%
Verify Preorder Sequence in Binary Search Tree Array Stack Tree +4 MEDIUM	Medium	100.0%	0.5%
Graph Valid Tree Depth-First Search Breadth-First Search Union-Find +1 MEDIUM	Medium	100.0%	0.5%

Showing 1–20 of 21 matching problems · All Problems

Zenefits LeetCode Interview Questions | Grind Practice