Nielsen | MTS - 2 | Interview Questions
Summary
I cold-emailed a recruiter and successfully secured an interview with Nielsen, progressing through three rounds covering Problem Solving/DSA, Low-Level Design, and Hiring Manager questions, ultimately receiving a job offer for the MTS - 2 role.
Full Experience
I cold-emailed a recruiter, and luckily, got a call from them after a few days.
The first round of the interview was scheduled for the following day.
Round 1 (1 hour) - Problem Solving / DSA
https://leetcode.com/problems/next-greater-element-i/https://leetcode.com/problems/binary-tree-maximum-path-sum/
Round 2 (1 hour) - LLD
Design a Task Management System that allows users to create, assign, update, and track tasks. The system should support multiple users, task priorities, due dates, and status tracking. Users should be able to categorize tasks, add comments, and receive notifications for task updates.Round 3 (1 hour) - Hiring Manager
The interviewer asked in-depth questions about my past projects, current work at my company, team leadership experiences, and various behavioral scenarios.I received positive feedback for this round the following day.
Verdict: Selected
Interview Questions (3)
The next greater element of some element x in an array is the first element to its right that is strictly greater than x. You are given two 0-indexed integer arrays nums1 and nums2 of unique elements, where nums1 is a subset of nums2. Find all the next greater elements for each of nums1's elements in the corresponding places of nums2. Return an integer array ans of length nums1.length where ans[i] is the next greater element for nums1[i]. If there is no next greater element for nums1[i] in nums2, then set ans[i] = -1.
A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root. The path sum of a path is the sum of the node's values in the path. Given the root of a binary tree, return the maximum path sum of any non-empty path.
Design a Task Management System that allows users to create, assign, update, and track tasks. The system should support multiple users, task priorities, due dates, and status tracking. Users should be able to categorize tasks, add comments, and receive notifications for task updates.