Problem database last updated: June 20, 2025
8 problems · 1 Easy, 5 Medium, 2 Hard · Ranked #176 of 458
1 Easy
13% · avg 23%
5 Medium
63% · avg 59%
2 Hard
25% · avg 18%
Based on 8 reported problems, Workday interviews are slightly harder than average - 25% Hard vs 18% across all companies. The majority (63%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Workday puts unusual emphasis on design (25% of problems, 4.3x the industry average), linked-list (25% of problems, 3.5x the industry average), breadth-first-search (25% of problems, 3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (37.5%), hash-table (25%), string (25%), sorting (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order. | Medium | Very Likely | arrayhash-tablestring | Solve |
Permutations Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. | Medium | Very Likely | arraybacktracking | Solve |
Course Schedule II There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b... | Medium | Very Likely | depth-first-searchbreadth-first-searchgraph | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Very Likely | hash-tablelinked-listdesign | Solve |
Serialize and Deserialize Binary Tree Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitte... | Hard | Very Likely | stringtreedepth-first-search | Solve |
Reaching Points Given four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false othe... | Hard | Very Likely | math | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Very Likely | arraysorting | Solve |
Convert Binary Number in a Linked List to Integer Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary repre... | Easy | Very Likely | linked-listmath | Solve |
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Permutations
SolveGiven an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Course Schedule II
SolveThere are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Serialize and Deserialize Binary Tree
SolveSerialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitte...
Reaching Points
SolveGiven four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false othe...
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Convert Binary Number in a Linked List to Integer
SolveGiven head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary repre...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Workday interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Workday interviews focus heavily on array, hash-table, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Workday interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Workday has been reported to ask 8 distinct coding problems. The most common topics are array, hash-table, string. 1 are Easy difficulty, 5 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 8 reported problems, Workday interviews are slightly harder than average - 25% Hard vs 18% across all companies. 63% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Workday coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Workday interview with AIarrow_forward
