New Relic | Round 1 (Technical - DSA) | Rejected
Summary
I interviewed for an SDE-2 role at New Relic, completed one technical DSA round where I solved a medium problem and attempted a hard problem, and was ultimately rejected.
Full Experience
YOE - 4 Interview for role - SDE-2
Round 1 (Technical - DSA)
The interviewer started with a brief introduction and then moved to the coding questions. Codility platform was used and the questions were framed in a real life scenario type sitution.
Questions:
-
https://leetcode.com/problems/product-of-array-except-self/ (Medium) Solved easily within 20 mins, interviewer wanted the most optimized solution from start, made me run 2 test cases
-
https://leetcode.com/problems/binary-tree-maximum-path-sum/ (Hard) Strugged initially but got the idea but could not give a complete solution with running code, time ran out was not able to run any test case
Overall, the interviewer was good. The round lasted 1 hour.
Interview Questions (2)
Product of Array Except Self
Given an integer array nums, return an array answer such that answer[i] is the product of all the elements of nums except nums[i]. The solution must run in O(n) time and use constant extra space (excluding the output array).
Binary Tree Maximum Path Sum
Given a non-empty binary tree, find the maximum sum of the values along any path. A path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.