moveworks logo
Moveworks· Staff Software Engineer

Moveworks (Service Now) | Staff Software Engineer | Bangalore | JUNE 2026

Location
Bangalore
Posted
25 Sept 2026
64 reads

Summary

I interviewed for a Staff Software Engineer position at Moveworks in Bangalore in June 2026 and cleared all four rounds, including coding and system design.

How it went

Staff Software Engineer Interview Experience

Below is the interview experience for the role of Staff Software Engineer.


Round 1 (DSA & Coding)

Similar Leetcode problem : https://leetcode.com/problems/shortest-uncommon-substring-in-an-array/description/

A web UI has a drop-list selector widget that matches any substring. To enable our users to be more productive, we want to highlight the shortest possible substring in each entry of the list, so they can memorize those unique shortcuts.

Write a function that will find the shortest substring that uniquely matches each entry in the list provided. In case of ties use the first substring. Return the same list where each string has its unique substring surrounded by and .

Important: while the matching is case insensitive, we want the return values that preserve the original casing. (The string order should also be preserved.)

Example:

Our widget is used in a UI to label pictures of animals. Annotators must select one of the labels provided for each of the thousands of pictures.

We found the unique substrings, underlined here:

- "Bird"    -> "B<u>i</u>rd"
- "Cat"     -> "Ca<u>t</u>"
- "Cow"     -> "<u>Co</u>w"
- "Dog"     -> "Do<u>g</u>"
- "Wallaby" -> "Wa<u>l</u>laby"
So the returned list should be:

["B<u>i</u>rd", "Ca<u>t</u>", "<u>Co</u>w", "Do<u>g</u>", "Wa<u>l</u>laby"]

Round 2 (DSA & Coding)

Problem Similar to wordBreak

Screenshot 2026-08-04 at 2.50.25 PM.png

Round 3 (HLD Round)

Was asked to design the below problem

Screenshot 2026-08-19 at 11.53.20 PM.png

Round 4 (HLD Round)

Was asked to design something similar to elastic search on your own.

Problem statement Given 100M restaurant reviews, design a system for searching the reviews by keywords.

Requirements

Build Search API Output list of all reviews with all the terms 100M Reviews Each has a document id, and content Assume 10 words per review on average Assume English language (130k words in dictionary) Read only system

Example

Best and italian and food

Yes: “This is the best italian food in the city.” Yes: “I love italian food, this is the best!” No: “This is the best italian restaurant in the city.”


Could move past this round, Overall experience was good, hope this helps the community.

Questions asked (2)

  1. 01

    Shortest Unique Substring in List

    Data Structures & Algorithms

    A web UI has a drop‑list selector widget that matches any substring. Write a function that finds the shortest substring that uniquely matches each entry in the provided list (case‑insensitive matching, but preserve original casing in output). If multiple substrings have the same minimal length, choose the first one. Return the list where each string has its unique substring surrounded by <u> and </u>. Example output: ["B<u>i</u>rd", "Ca<u>t</u>", "<u>Co</u>w", "Do<u>g</u>", "Wa<u>l</u>laby"].

    Open the problem
  2. 02

    Design Search System for 100M Restaurant Reviews

    System Design

    Design a system to search 100 million restaurant reviews by keywords. Requirements: build a Search API that returns a list of all reviews containing all the query terms. Each review has a document ID and content (average 10 words). Assume English language (130k words in dictionary). The system is read‑only. Example query: "Best and italian and food" should return reviews that contain all three terms (e.g., "This is the best italian food in the city.") and exclude those that miss any term (e.g., "This is the best italian restaurant in the city.").

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Moveworks recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!