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).
Interview questions [1]
Question 1
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).
I applied online. I interviewed at ServiceNow (Santa Clara, CA)
Interview
2 interviews, one with hiring manager and other one was coding interview. Online assessment no leetcode style coding, allowed to use LLM, cursor. do not know why companies still do coding interviews when LLMs are writing code for you
HR round only, recruiter went rogue. Recruiter never emailed me back even though it went quite well, seems maybe the role was filled already by the time. The least they could do was email me back why instead of going rogue
Process was a moderate, had call from recruiter then followed by technical interview with two people. Later had an interview with hiring manager . I was given coding assessment which was medium difficult