Zenefits Interview Questions — 21 DSA Problems

17 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Zenefits LeetCode questions for software engineering interviews.

• Majority Element (EASY) — Array, Hash Table, Divide and Conquer, Sorting, Counting
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Graph Valid Tree (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Verify Preorder Sequence in Binary Search Tree (MEDIUM) — Array, Stack, Tree, Binary Search Tree, Recursion, Monotonic Stack, Binary Tree
• Flatten 2D Vector (MEDIUM) — Array, Two Pointers, Design, Iterator
• Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Majority Element II (MEDIUM) — Array, Hash Table, Sorting, Counting
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Reverse Linked List (EASY) — Linked List, Recursion
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Valid Parentheses (EASY) — String, Stack
• Excel Sheet Column Title (EASY) — Math, String
• Min Stack (MEDIUM) — Stack, Design
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Valid Palindrome (EASY) — Two Pointers, String
• Convert Sorted List to Binary Search Tree (MEDIUM) — Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree
• N-Queens II (HARD) — Backtracking
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Shortest Distance from All Buildings (HARD) — Array, Breadth-First Search, Matrix