A good place to work at
Nothing bad to say about the place.
Given a tree, you must find all root-to-leaf paths using DFS and BFS. Track path lists during traversal. DFS uses recursion, and BFS uses a queue storing nodes with current path arrays.
I applied through a staffing agency. The process took 1 week. Didn't have an interview. Instead, I was given a take-home assignment. Email from the recruiter: - Hi, Thank you for your interest in the Solutions Architect role. The team is excited to
It was a 45-minute round. 30 minutes of coding 10 minutes of technical questions 5 minutes of questions I had. Asked an easy-to-medium question on graphs.
Given a tree, you must find all root-to-leaf paths using DFS and BFS. Track path lists during traversal. DFS uses recursion, and BFS uses a queue storing nodes with current path arrays.
I applied through a staffing agency. The process took 1 week. Didn't have an interview. Instead, I was given a take-home assignment. Email from the recruiter: - Hi, Thank you for your interest in the Solutions Architect role. The team is excited to
It was a 45-minute round. 30 minutes of coding 10 minutes of technical questions 5 minutes of questions I had. Asked an easy-to-medium question on graphs.