ServiceNow Coding Interview Questions
26 ServiceNow coding interview problems with full optimal solutions — 15 easy, 8 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an ServiceNow interviewer values, and a FAQ section.
Showing 5 problems of 26
- #1easyfrequently asked
1. Two Sum
Given an array of integers and a target, return indices of the two numbers that add up to target. ServiceNow asks this to confirm you reach for a hash map for O(n) lookups — the same pattern they use in ticket de-duplication and SLA pair-matching.
- #2easyfrequently asked
2. Valid Parentheses
Given a string of brackets, decide if every opener has a matching closer in the correct order. ServiceNow asks this to confirm you reach for a stack — the same data structure their workflow engine uses to nest sub-flows and rollback approval steps.
- #3easyfrequently asked
3. Merge Two Sorted Lists
Splice two sorted linked lists into one sorted list. ServiceNow asks this to test whether you handle dummy-head + tail-pointer mechanics cleanly — the same shape they use when merging two prioritized ticket queues.
- #6easyfrequently asked
6. Search Insert Position
Find the index where a target should be inserted in a sorted array to keep it sorted. ServiceNow uses this to verify binary-search fluency — the same primitive their SLA timer scheduler uses to insert new deadlines into an ordered heap.
- #12easyfrequently asked
12. Maximum Depth of Binary Tree
Find the maximum depth of a binary tree by counting the longest root-to-leaf path. ServiceNow uses this to probe tree-recursion fundamentals, reflecting their heavy use of hierarchical data models in CMDB and approval-chain trees.