Workday Interview Guide

#1. Group Anagrams

This question is very likely to be asked in your Workday interview

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

ArraysStrings

Reaching Points

Starting from (0, 0), can you reach a target point (tx, ty) by repeatedly applying the transformation (x, y) -> (x, x+y) or (x, y) -> (x+y, y)? Determine if it's possible.

Greedy AlgorithmsRecursionMath

Somewhat likely

If you have a Workday interview, you might get this question

#2. Reaching Points

Greedy AlgorithmsRecursionMath

Starting from (0, 0), can you reach a target point (tx, ty) by repeatedly applying the transformation (x, y) -> (x, x+y) or (x, y) -> (x+y, y)? Determine if it's possible.

This question is somewhat likely to be asked in your Workday interview

Convert Binary Number in a Linked List to Integer

You're given a linked list where each node contains a 0 or 1, representing a binary number. Convert this binary representation into its equivalent integer value.

Linked ListsBit Manipulation

Somewhat likely

If you have a Workday interview, you might get this question

Easy

#3. Convert Binary Number in a Linked List to Integer

Easy

You're given a linked list where each node contains a 0 or 1, representing a binary number. Convert this binary representation into its equivalent integer value.

Linked ListsBit Manipulation

This question is somewhat likely to be asked in your Workday interview

Course Schedule II

You're given a list of courses and their prerequisites. Determine a valid order in which you can take all the courses, respecting the dependencies. If it's impossible to finish all courses, indicate that.

GraphsRecursion

If you have a Workday interview, it's unlikely that you will get this question. Workday does ask it, but it's rare

#4. Course Schedule II

This question is not likely to be asked in your Workday interview

GraphsRecursion

Merge Intervals

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

ArraysSorting

If you have a Workday interview, it's unlikely that you will get this question. Workday does ask it, but it's rare

#5. Merge Intervals

This question is not likely to be asked in your Workday interview

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

ArraysSorting

Serialize and Deserialize Binary Tree

You are given a binary tree. Devise a way to convert the tree into a string representation (serialize) and then reconstruct the tree from that string (deserialize).

TreesRecursion

If you have a Workday interview, it's unlikely that you will get this question. Workday does ask it, but it's rare

#6. Serialize and Deserialize Binary Tree

This question is not likely to be asked in your Workday interview

You are given a binary tree. Devise a way to convert the tree into a string representation (serialize) and then reconstruct the tree from that string (deserialize).

TreesRecursion

Permutations

Given a collection of distinct integers, find all possible permutations (orderings) of the elements. Return a list of these permutations.

ArraysRecursion

If you have a Workday interview, it's unlikely that you will get this question. Workday does ask it, but it's rare

#7. Permutations