Skip to main content

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 24 problems of 100

  • #7mediumfrequently asked

    7. Maximum Subarray

    Find the contiguous subarray with the largest sum. Workday uses this to test Kadane's pattern for finding the best fiscal-quarter window of an employee's incremental bonuses.

  • #21mediumfrequently asked

    21. Min Stack

    Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Workday uses this as a stand-in for 'efficient running aggregates' — the same pattern used for tracking the lowest pay-grade in a permission-stack snapshot.

  • #22mediumfrequently asked

    22. Two Sum II - Input Array Is Sorted

    Find two numbers in a 1-indexed sorted array that sum to a target. Workday uses this to test two-pointer pattern recognition on sorted ledger data — common shape for paid-vs-owed reconciliations.

  • #27mediumfrequently asked

    27. House Robber

    Maximize the sum of values you can take from a row of houses without taking two adjacent. Workday uses this as a DP warmup — same shape as scheduling non-overlapping shift-bonuses across consecutive pay periods.

  • #31mediumfrequently asked

    31. Add Two Numbers

    Given two numbers as reversed linked lists, add them and return as a linked list. Workday uses this to test carry-propagation discipline — same as adding two arbitrary-precision payroll totals stored as digit lists.

  • #35mediumfrequently asked

    35. 3Sum

    Find all unique triplets in an array that sum to zero. Workday uses this as a sort + two-pointer composition test — same shape as 'find three pay-grade adjustments that net to zero'.

  • #41mediumfrequently asked

    41. Search in Rotated Sorted Array

    Search a target in a sorted-then-rotated array in O(log n). Workday uses this to test modified binary search — same shape as querying a payroll-cycle log that has been wrapped around midnight.

  • #47mediumfrequently asked

    47. Group Anagrams

    Group strings into anagram clusters. Workday uses this for canonical-key bucketing — same shape as grouping department-code aliases that all refer to the same cost center.

  • #49mediumfrequently asked

    49. Jump Game

    Given an array of max-jump lengths, determine if you can reach the last index. Workday uses this as a greedy-reasoning test — same shape as 'can a workflow proceed from any starting step given variable hop allowances'.

  • #50mediumfrequently asked

    50. Merge Intervals

    Given a collection of intervals, merge all overlapping intervals. Workday uses this canonically for time-and-attendance — same shape as merging overlapping clock-in/out windows to compute total worked hours.

  • #59mediumfrequently asked

    59. Word Search

    Determine if a word exists in a grid of letters using adjacent cells. Workday uses this for DFS-with-backtracking + visited-marking — same shape as searching for a specific approval-chain path through a workflow graph.

  • #61mediumfrequently asked

    61. Validate Binary Search Tree

    Determine if a binary tree is a valid BST. Workday uses this to test recursion with bounds — same pattern as validating an org-chart's pay-grade ordering: every manager outranks all reports.

  • #62mediumfrequently asked

    62. Binary Tree Level Order Traversal

    Return the level-order (BFS) traversal of a binary tree's values, grouped by level. Workday uses this for tier-by-tier org-chart processing — same shape as emitting all VPs first, then all directors, then all managers.

  • #66mediumfrequently asked

    66. Word Break

    Determine if a string can be segmented into a sequence of dictionary words. Workday uses this for DP-on-strings — same shape as validating that a free-form job-title string can be decomposed into known role tokens.

  • #67mediumfrequently asked

    67. LRU Cache

    Design an LRU cache with O(1) get and put. Workday uses this for hash-map + doubly-linked-list composition — same shape as caching the most-recently-viewed employee records in an HR app.

  • #70mediumfrequently asked

    70. Number of Islands

    Count the number of islands in a 2D grid of '1' (land) and '0' (water). Workday uses this for grid-DFS counting — same shape as counting connected groups of co-located employees on a floor plan.

  • #71mediumfrequently asked

    71. Course Schedule

    Determine if you can finish all courses given prerequisite dependencies. Workday uses this for cycle-detection in workflow DAGs — same shape as validating that an approval-chain definition doesn't loop back on itself.

  • #73mediumfrequently asked

    73. Kth Largest Element in an Array

    Find the kth largest element without sorting the entire array. Workday uses this to test heap fluency — same shape as finding the top-k highest-paid employees per department for compensation reports.

  • #79mediumfrequently asked

    79. Product of Array Except Self

    Return an array where output[i] is the product of all elements except nums[i], without division and in O(n). Workday uses this for prefix/suffix product fluency — same shape as computing aggregate-without-self metrics across departments.

  • #84mediumfrequently asked

    84. Coin Change

    Find the minimum number of coins to make a target amount. Workday uses this for unbounded-knapsack DP — same shape as allocating the minimum number of pay-frequency cycles to reach a target year-to-date amount.

  • #85mediumfrequently asked

    85. Top K Frequent Elements

    Return the k most frequent elements in an array. Workday uses this for bucket-sort vs heap decisions — same shape as 'top-k most-used permission codes across an org'.

Workday Coding Interview Questions — Full Solutions — InterviewChamp.AI