Moveworks·Software Engineer·Technical Phone Screen
Jun 2026
Moveworks software engineer interview with a pretty gnarly string manipulation problem. The question had multiple steps chained together and I spent way too long just making sure I understood what was being asked before writing a single line of code.
- Given a list of strings, find the character(s) with the highest frequency in each string (including ties), compute the proportion of those characters relative to the string's length, identify the strings with the lowest such proportion, then remove from those strings any character that appears in any other string in the original list, and return the concatenation of what remains.
“This one took me a while to even parse.”