I recently interviewed at ServiceNow for a Software Engineer position. The interview process consisted of an online test followed by four rounds of technical interviews and a techno-managerial round.
The online test included a question on the Longest Increasing Subsequence problem. The first technical interview focused on making the largest number possible from a given array, the two coin problem, and Java basics. The second technical interview involved the Jump Game 2 problem, finding the length between two nodes in a tree. The third technical interview covered a range of topics including Letter Combinations of a Phone Number, OddEven Nodes in a LinkedList, Kadanes Algorithm, implementation of a Binary Search Tree, and LRU cache. The final techno-managerial round included questions related to my current work, HashMap internals, the Java Memory Model, and Garbage Collection algorithms.
I was ultimately selected for the position.