Workday coding interview
questions, leaked.
8 problems reported across recent Workday interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Workday's assessment hits you with 8 problems across a brutal range: one easy, five medium, two hard. The distribution is deceptive. Arrays, hash tables, and strings appear repeatedly, but the hard problems (Reaching Points, Serialize and Deserialize Binary Tree) demand pattern recognition you might not have drilled. Most candidates walk in confident on array manipulation and leave blindsided by graph traversal or design problems like LRU Cache. StealthCoder runs invisible during the assessment, surfacing a working solution the moment you hit a wall on an unfamiliar pattern.
Top problems at Workday
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Group Anagrams | MEDIUM | 100.0 | 71% | Array · Hash Table · String |
| 02 | Convert Binary Number in a Linked List to Integer | EASY | 88.0 | 81% | Linked List · Math |
| 03 | Course Schedule II | MEDIUM | 88.0 | 53% | Depth-First Search · Breadth-First Search · Graph |
| 04 | LRU Cache | MEDIUM | 88.0 | 45% | Hash Table · Linked List · Design |
| 05 | Reaching Points | HARD | 88.0 | 34% | Math |
| 06 | Merge Intervals | MEDIUM | 88.0 | 49% | Array · Sorting |
| 07 | Serialize and Deserialize Binary Tree | HARD | 88.0 | 59% | String · Tree · Depth-First Search |
| 08 | Permutations | MEDIUM | 88.0 | 81% | Array · Backtracking |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Workday OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array3 · 38%
- hash table2 · 25%
- string2 · 25%
- sorting2 · 25%
- linked list2 · 25%
- math2 · 25%
- depth first search2 · 25%
- breadth first search2 · 25%
- design2 · 25%
- graph1 · 13%
The dataset reveals Workday's real filter: not raw coding speed, but structural thinking across multiple domains. Arrays and hash tables dominate the count, but that's a trap. Depth-first search, breadth-first search, and design problems appear with equal weight, and they require synthesis. Group Anagrams pairs hashing and sorting. LRU Cache combines hash tables, linked lists, and system design. The two hard problems test whether you can reverse-engineer mathematical constraints (Reaching Points) or rebuild a tree from a serialized string. Drill hash tables and arrays first for quick wins, then spend real time on graph traversal and design. If you haven't solved LRU Cache or Course Schedule II, StealthCoder is your safety net when the assessment goes live.
Companies with similar patterns
If you prepped for Workday, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Workday.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Workday interview FAQ
Should I study arrays or hash tables first for Workday?+
Arrays appear in three problems, hash tables in two. Start with arrays for confidence, but don't skip hash tables. Group Anagrams and LRU Cache both require hash-table thinking. You need both solid by assessment day.
How much graph and DFS practice do I need?+
Course Schedule II (medium) and Serialize and Deserialize Binary Tree (hard) both require DFS or BFS. Graph problems appear once explicitly, but tree traversal is buried in other patterns. Spend 3 to 4 hours on DFS/BFS before the assessment.
Is LRU Cache worth the time investment?+
Yes. It's medium difficulty but tests hash tables, linked lists, and design together. Workday includes design problems, and LRU Cache is the classic. It's a single problem that covers three critical topics.
What's the hardest topic Workday tests?+
The two hard problems target math (Reaching Points) and tree serialization (Serialize and Deserialize). If you haven't seen mathematical constraint reversal or tree reconstruction from strings, those are your weak spots. Practice both.
Can I skip sorting if I'm strong on arrays?+
No. Sorting appears in two problems: Group Anagrams and Merge Intervals. Both are medium difficulty and assume you can sort efficiently. Sorting is a prerequisite for this assessment.