ZScaler LeetCode interview questions

Explore ZScaler 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 / 16

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Apply Operations to Make Sum of Array Greater Than or Equal to k Math Greedy Enumeration MEDIUM	Medium	100.0%	0.4%
Maximum Strong Pair XOR I Array Hash Table Bit Manipulation +2 EASY	Easy	97.1%	0.8%
Maximum Strong Pair XOR II Array Hash Table Bit Manipulation +2 HARD	Hard	97.1%	0.3%
Day of the Year Math String EASY	Easy	97.1%	0.5%
Largest Number After Digit Swaps by Parity Sorting Heap (Priority Queue) EASY	Easy	97.1%	0.7%
Optimal Account Balancing Array Dynamic Programming Backtracking +2 HARD	Hard	85.6%	0.5%
Minimum Replacements to Sort the Array Array Math Greedy HARD	Hard	85.6%	0.5%
Minimum Increment to Make Array Unique Array Greedy Sorting +1 MEDIUM	Medium	73.1%	0.6%
Set Matrix Zeroes Array Hash Table Matrix MEDIUM	Medium	73.1%	0.6%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	73.1%	0.5%
Number of Divisible Triplet Sums Array Hash Table MEDIUM	Medium	63.2%	0.7%
Word Ladder Hash Table String Breadth-First Search +1 HARD	Hard	63.2%	0.5%
Integer to English Words Math String Recursion HARD	Hard	63.2%	0.4%
Reverse Nodes in k-Group Linked List Recursion HARD	Hard	63.2%	0.7%
Search in Rotated Sorted Array Array Binary Search MEDIUM	Medium	63.2%	0.5%
Contains Duplicate Array Hash Table Sorting EASY	Easy	63.2%	0.6%

Showing 1–16 of 16 matching problems · All Problems

ZScaler LeetCode Interview Questions | Grind Practice