Nielsen Interview Questions, Process, and Tips

Q1. Basic Spark, Python, SQL Questions.
Add your answer
Q2. Some Data Modelling Questions.
Add your answer

Q1. Interview taken by VP of particular product vertical, questions pertaining to resume, product experience, fav. product and why, very important for them to understand if you are a good culture fit, and you ...read more
Add your answer

Problem statement: Shared an email very similar to how it will be in the job, containing a product request from a stakeholder. Job is to create a product backlog/ product requirements document with use cases and your take and approach on how to solve the problem.

Q1. One on one interview with another VP of a different product vertical. nielsen Product leadership is a little old school in the sense, most of them have been in the company for 12+ years, value authenticity...read more
Add your answer

Q1. Interview was with a Tech head(pretty high up), who the candidate will be working with. Personal experience was not very comfortable in this one, person difficult to read. Very point blank questions. Every...read more
Add your answer

3 simple coding questions

Q1. Merge sort with list
Ans. 
Merge sort is a divide and conquer algorithm that recursively divides the input array into smaller subarrays, sorts them, and then merges them back together.
• Divide the input list into two halves

• Recursively apply merge sort to each half

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Similar to coin exchange DP
Add your answer
Q3. SQL query medium level
Add your answer

Q1. Given the start and end times of the meetings, how can you determine if you are able to attend all of them?
Add your answer

Q1. About projects which previously worked
Add your answer
Q2. Embedded peripherals
Add your answer

Q1. Coding threads with rtos
Ans. 
Coding threads with RTOS involves creating and managing multiple threads in real-time operating systems.
• Understand the RTOS scheduling algorithm to prioritize threads.

• Use synchronization mechanisms like semaphores and mutexes to avoid race conditions.

• Implement thread-safe data structures to share data between threads.

• Consider the stack size and priority of each thread to prevent stack overflow and ensure timely executi
Answered by AI
Add your answer
Q2. Linux questions
Add your answer

Q1. Minimum in Rotated Sorted array
Ans. 
Find the minimum element in a rotated sorted array.
• Perform binary search to find the pivot point where the array is rotated.

• Compare the element at pivot point to the first element to determine which half to search for the minimum.

• Continue binary search in the appropriate half to find the minimum element.
Answered by AI
Add your answer
Q2. API and DB Schema for Instagram based application.
Ans. 
API for Instagram application to interact with user data and DB schema to store user information and posts.
• API endpoints for user authentication, posting photos, liking photos, following users, etc.

• DB schema with tables for users, posts, comments, likes, followers, etc.

• Example API endpoint: /users/{userId}/posts to retrieve all posts by a specific user.

• Example DB schema: Users table with columns for username, email, pr
Answered by AI
Add your answer

Q1. Resume introspection, AWS, K8s
Add your answer

Q1. SQL: Find the nth highest salary of employee?
Ans. 
Use SQL query with ORDER BY and LIMIT to find the nth highest salary of an employee.
• Use ORDER BY clause to sort salaries in descending order

• Use LIMIT to specify the nth highest salary

• Example: SELECT salary FROM employees ORDER BY salary DESC LIMIT n-1, 1
Answered by AI
Add your answer
Q2. SQL: Types of Joins in SQL?
Ans. 
Types of joins in SQL include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.
• INNER JOIN: Returns rows when there is at least one match in both tables.

• LEFT JOIN: Returns all rows from the left table and the matched rows from the right table.

• RIGHT JOIN: Returns all rows from the right table and the matched rows from the left table.

• FULL JOIN: Returns rows when there is a match in one of the tables.
Answered by AI
Add your answer
Q3. Algorithm: BinarySearch algorithm using Recursion, explanation and implementation.
Ans. 
BinarySearch algorithm using Recursion finds the target element in a sorted array by dividing the array in half at each step.
• Divide the array in half and compare the target element with the middle element

• If the target element is smaller, search the left half recursively

• If the target element is larger, search the right half recursively

• Repeat until the target element is found or the array is empty
Answered by AI
Add your answer
Q4. Given a string s and t find that s is a subsequence string in t or not?
Ans. 
Check if string s is a subsequence of string t.
• Iterate through both strings using two pointers.

• Compare characters of s and t, moving pointer in t only if characters match.

• If all characters of s are found in t in order, return true.

• Example: s = 'abc', t = 'ahbgdc' => true
Answered by AI
Add your answer