Service Now·Software Engineer·Technical Phone Screen
Jul 2026
ServiceNow SWE interview with a dynamic programming problem on wildcard pattern matching. Pretty standard algorithmic round, nothing too surprising, but the problem had some tricky edge cases that caught me slipping.
- Implement wildcard pattern matching between a string and a pattern that supports '?' (matches any single character) and '*' (matches any sequence of characters), where the pattern must cover the entire input string.
“I jumped straight to recursion and got a working solution but it was obviously exponential.”