ServiceNow Developer interview questions

first round: path sum 3 Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum. The path does not need to start or end at the root or a leaf, but it must go downwards (i.e., traveling only from parent nodes to child nodes).

The interview process includes four rounds: two technical coding rounds, one system design interview, and an HR interview. The first technical coding round was a qualifying round, and the three subsequent interviews were then scheduled.