# Top 3 Moveworks Coding Interview Questions from 2025


# Introduction
In this blog post, we'll share the most commonly asked coding interview questions at Moveworks.  If you don't have months to study for your interviews, you can use AI tools like [Chatmagic](https://www.chatmagic.app) to generate solutions quickly and efficiently - helping you pass the interviews and get the job offer!

	
# Problem #1: [Text Justification](https://leetcode.com/problems/text-justification)
> Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified. You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces ' ' when necessary so that each line has exactly maxWidth characters. Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line does not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right. For the last line of text, it should be left-justified, and no extra space is inserted between words. Note:  A word is defined as a character sequence consisting of non-space characters only. Each word's length is guaranteed to be greater than 0 and not exceed maxWidth. The input array words contains at least one word.    Example 1:  Input: words = ["This", "is", "an", "example", "of", "text", "justification."], maxWidth = 16 Output: [    "This    is    an",    "example  of text",    "justification.  " ] Example 2:  Input: words = ["What","must","be","acknowledgment","shall","be"], maxWidth = 16 Output: [   "What   must   be",   "acknowledgment  ",   "shall be        " ] Explanation: Note that the last line is "shall be    " instead of "shall     be", because the last line must be left-justified instead of fully-justified. Note that the second line is also left-justified because it contains only one word. Example 3:  Input: words = ["Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"], maxWidth = 20 Output: [   "Science  is  what we",   "understand      well",   "enough to explain to",   "a  computer.  Art is",   "everything  else  we",   "do                  " ]   Constraints:  1 <= words.length <= 300 1 <= words[i].length <= 20 words[i] consists of only English letters and symbols. 1 <= maxWidth <= 100 words[i].length <= maxWidth  

Topics: Array, String, Simulation


# Problem #2: [Shortest Uncommon Substring in an Array](https://leetcode.com/problems/shortest-uncommon-substring-in-an-array)
> You are given an array arr of size n consisting of non-empty strings. Find a string array answer of size n such that:  answer[i] is the shortest substring of arr[i] that does not occur as a substring in any other string in arr. If multiple such substrings exist, answer[i] should be the lexicographically smallest. And if no such substring exists, answer[i] should be an empty string.  Return the array answer.   Example 1:  Input: arr = ["cab","ad","bad","c"] Output: ["ab","","ba",""] Explanation: We have the following: - For the string "cab", the shortest substring that does not occur in any other string is either "ca" or "ab", we choose the lexicographically smaller substring, which is "ab". - For the string "ad", there is no substring that does not occur in any other string. - For the string "bad", the shortest substring that does not occur in any other string is "ba". - For the string "c", there is no substring that does not occur in any other string.  Example 2:  Input: arr = ["abc","bcd","abcd"] Output: ["","","abcd"] Explanation: We have the following: - For the string "abc", there is no substring that does not occur in any other string. - For the string "bcd", there is no substring that does not occur in any other string. - For the string "abcd", the shortest substring that does not occur in any other string is "abcd".    Constraints:  n == arr.length 2 <= n <= 100 1 <= arr[i].length <= 20 arr[i] consists only of lowercase English letters.  

Topics: Array, Hash Table, String, Trie


# Problem #3: [Word Break II](https://leetcode.com/problems/word-break-ii)
> Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order. Note that the same word in the dictionary may be reused multiple times in the segmentation.   Example 1:  Input: s = "catsanddog", wordDict = ["cat","cats","and","sand","dog"] Output: ["cats and dog","cat sand dog"]  Example 2:  Input: s = "pineapplepenapple", wordDict = ["apple","pen","applepen","pine","pineapple"] Output: ["pine apple pen apple","pineapple pen apple","pine applepen apple"] Explanation: Note that you are allowed to reuse a dictionary word.  Example 3:  Input: s = "catsandog", wordDict = ["cats","dog","sand","and","cat"] Output: []    Constraints:  1 <= s.length <= 20 1 <= wordDict.length <= 1000 1 <= wordDict[i].length <= 10 s and wordDict[i] consist of only lowercase English letters. All the strings of wordDict are unique. Input is generated in a way that the length of the answer doesn't exceed 105.  

Topics: Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization