Workday Coding Interview Questions
100 Workday coding interview problems with full optimal solutions — 31 easy, 55 medium, 14 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Workday interviewer values, and a FAQ section.
Showing 13 problems of 100
- #54hardsometimes asked
54. Edit Distance
Compute the minimum number of operations (insert, delete, replace) to convert one string to another. Workday uses this for string-DP fluency — same shape as detecting close-match HRIS records during deduplication.
- #57hardsometimes asked
57. Minimum Window Substring
Given two strings s and t, find the minimum window in s that contains all characters of t. Workday uses this for sliding-window mastery — same shape as finding the shortest payroll-period window covering all of a multi-state employee's tax jurisdictions.
- #69hardrarely asked
69. Word Ladder
Find the shortest transformation sequence from beginWord to endWord changing one letter at a time, where each intermediate is in wordList. Workday uses this for BFS-on-graph reasoning — same shape as finding the shortest role-transition chain through approved promotion paths.
- #80hardsometimes asked
80. Sliding Window Maximum
Return the maximum in each sliding window of size k. Workday uses this for monotonic-deque fluency — same shape as computing peak headcount over a rolling pay-period window.
- #88hardsometimes asked
88. Serialize and Deserialize Binary Tree
Design serialize/deserialize for a binary tree. Workday uses this for protocol-design + recursion mastery — same shape as transmitting an org-chart snapshot across services without losing structure.
- #90hardsometimes asked
90. Integer to English Words
Convert a non-negative integer to its English-words representation. Workday uses this for grouping/edge-case discipline — same shape as generating human-readable payslip amounts ($1,234,567 -> 'One Million Two Hundred Thirty Four Thousand...').
- #93hardrarely asked
93. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log min(m, n)). Workday uses this for binary-search-on-partition mastery — the hardest of their binary-search variants.
- #94hardsometimes asked
94. Trapping Rain Water
Compute how much water can be trapped after raining on a histogram. Workday uses this for two-pointer mastery — same shape as 'how much pay-period overflow is held by the maximum-flexible-spending walls'.
- #95hardrarely asked
95. Regular Expression Matching
Implement regex matching with '.' and '*'. Workday uses this for 2D DP with branching choice — same shape as evaluating wildcard-based permission patterns against role strings.
- #97hardrarely asked
97. Largest Rectangle in Histogram
Find the largest rectangular area in a histogram. Workday uses this for monotonic-stack mastery — same shape as computing the largest contiguous block of FTEs across departments where each meets a minimum FTE-count threshold.
- #98hardrarely asked
98. Maximal Rectangle
Find the largest rectangle of 1s in a binary matrix. Workday uses this as the 2D extension of Largest Rectangle in Histogram — same shape as finding the largest cohort of co-employed-in-region records across employees and timeline.
- #99hardrarely asked
99. First Missing Positive
Find the smallest missing positive integer in O(n) and O(1) space. Workday uses this for array-as-hash-map fluency — same shape as finding the next unassigned employee ID in a partially-allocated range.
- #100hardsometimes asked
100. Wildcard Matching
Match a string against a pattern with '?' (single char) and '*' (any sequence). Workday uses this directly for RBAC pattern matching — same shape as evaluating policies like 'admin:*:write' against role strings.