Upload Button Icon Add office photos

Nielsen

Compare button icon Compare button icon Compare

Filter interviews by

Nielsen Software Developer Interview Questions and Answers

Updated 24 Feb 2025

Nielsen Software Developer Interview Experiences

6 interviews found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I appeared for an interview in Jan 2025.

Round 1 - Coding Test 

Basic .net concept question and 2 leetcode medium question.
1) find a target element within a rotated search array (complexity < 0(N))

Round 2 - Technical 

(1 Question)

  • Q1. How would you handle scenerios where if you have 1000 request comming and you can handle 10 request at max

Interview Preparation Tips

Interview preparation tips for other job seekers - I had a technical interview with a solution architect who has 19 years of experience, and he was asking questions as if it were a solution architect-level interview. Not a single question related to C# or anything database related for which I was interviewing.
How would you scale your system, how would you handle millions of request if your server can handle maximum of 10000 request and so on
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via Job Portal and was interviewed in Nov 2024. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

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

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Shallow copy and deep copy
  • Q2. What is Pure component
  • Ans. 

    A Pure component is a component in React that does not have any state or lifecycle methods, resulting in improved performance.

    • Pure components are used to prevent unnecessary re-renders in React applications.

    • Pure components implement shouldComponentUpdate method with shallow comparison of props and state.

    • Examples of Pure components include functional components and class components that extend PureComponent class.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Improve the knowledge of javascript basics and for react developer role, focus on coding side.
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Who do you test your django apps?
  • Ans. 

    I test my Django apps using automated testing tools and manual testing methods.

    • I use Django's built-in testing framework to write unit tests for individual components of the app.

    • I also use tools like pytest and Selenium for automated testing of the app's functionality.

    • I perform manual testing to ensure the app works as expected in real-world scenarios.

    • I use tools like Django Debug Toolbar to identify and fix any perfor

  • Answered by AI
  • Q2. Count the number of vowels in a string.
  • Ans. 

    Count the number of vowels in a given string.

    • Iterate through each character in the string and check if it is a vowel (a, e, i, o, u).

    • Increment a counter for each vowel found.

    • Return the total count of vowels in the string.

  • Answered by AI

Skills evaluated in this interview

Nielsen interview questions for designations

 Senior Software Developer

 (2)

 Software Engineer

 (7)

 Java Developer

 (2)

 Senior Software Engineer

 (5)

 Lead Software Engineer

 (2)

 Software Engineer Trainee

 (1)

 Front end Developer

 (2)

 Full Stack Developer

 (1)

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

It was good. contains lot of theoretical questions.

Round 2 - Coding Test 

1 hr. asked basic concepts.

Interview Preparation Tips

Interview preparation tips for other job seekers - Go for it.
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Technology questions were asked as per experience
Round 2 - HR 

(1 Question)

  • Q1. Hr related questions were asking more of behaviourial

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. How to invoke the xml file using LibXML?
  • Ans. 

    To invoke an XML file using LibXML, use the xmlReadFile() function.

    • Include the libxml/parser.h header file.

    • Use the xmlReadFile() function to read the XML file and create a xmlDocPtr object.

    • Use the xmlDocGetRootElement() function to get the root element of the XML document.

    • Use the xmlNodeGetContent() function to get the content of a node.

    • Use the xmlFreeDoc() function to free the memory allocated for the xmlDocPtr object...

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This was a test round where 10 aptitude based questions were to be solved in 60 minutes

  • Q1. You have 5 pirates and 100 gold coins. The challenge is to determine how the pirates will divide the coins among themselves based on their ranking and the rules they follow.
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

They took us to the lab for this on and we were each given a paper with a program on it. It was all mixed as in each person got a different paper, You have around an hour to finish coding. after which you have to explain your code. They also gave wrong or incorrect inputs and see how your code handles these exceptions.

  • Q1. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. 

    Reverse a given string containing alphabets, numbers, and special characters.

    • Iterate through the string from the end to the beginning and append each character to a new string.

    • Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

    • Handle special characters and numbers along with alphabets while reversing the string.

    • Ensure to consider the constraints provided in th...

  • Answered by AI
  • Q2. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Implement a function to find K largest elements in an unsorted array in non-decreasing order.

    • Create a min heap of size K and insert the first K elements of the array

    • For each remaining element, if it is larger than the root of the heap, replace the root with the element and heapify

    • Finally, the heap will contain the K largest elements in non-decreasing order

  • Answered by AI
  • Q3. 

    Remove Character from String Problem Statement

    Given a string str and a character 'X', develop a function to eliminate all instances of 'X' from str and return the resulting string.

    Input:

    The first lin...
  • Ans. 

    Develop a function to remove all instances of a given character from a string.

    • Iterate through the string and build a new string excluding the specified character.

    • Use a StringBuilder or similar data structure for efficient string manipulation.

    • Handle edge cases like empty string or character not found in the input string.

    • Ensure the function completes within the given time constraint.

  • Answered by AI
  • Q4. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and column to determine the numbers to print

    • Use a combination of spaces and numbers to align the pattern correctly

    • Increment the numbers in each row based on the row number

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Compared to the other round this is more tech oriented. Lot more tech questions. It is of normal difficulty and is not that hard to clear, you only need to know the basics.
Very basic of Data Structure and Oracle knowledge enough. Lots of simple questions from data structures(insert into heaps etc). They did not ask to write code for DS, but rather to explain the logic through diagrams. For some complicated question, they expect how much you brainstorm ideas in solving

  • Q1. 

    Convert Binary Tree to Mirror Tree

    Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.

    Input:

    An integer ‘T’ denoting the number o...
  • Ans. 

    Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.

    • Traverse the tree in postorder fashion and swap the left and right children of each node.

    • Use recursion to solve the problem efficiently.

    • Modify the binary tree in place without creating a new tree.

  • Answered by AI
  • Q2. 

    Heap Sort Problem Statement

    Given an array ARR consisting of N integers, your task is to use the Heap sort algorithm to arrange the array in non-decreasing order.

    Input:

    The first line of the input cont...
  • Ans. 

    Implement the Heap sort algorithm to arrange an array in non-decreasing order.

    • Implement the Heap sort algorithm to sort the given array in non-decreasing order

    • Use a max heap to sort the array in non-decreasing order

    • Time complexity of Heap sort is O(n log n)

  • Answered by AI
  • Q3. What is indexing in the context of databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on specific columns in a database table to speed up queries that search for data in those columns.

    • Indexes work similar to the index of a book, allowing the database to quickly locate the desired data without having to scan the entire table.

    • Examples of indexes in...

  • Answered by AI
  • Q4. Which data structure is better for your use case: a B Tree or a Hash Table?
  • Ans. 

    Hash Table is better for fast lookups and insertions, while B Tree is better for range queries and ordered traversal.

    • Use Hash Table for fast lookups and insertions with O(1) average time complexity.

    • Use B Tree for range queries and ordered traversal with O(log n) time complexity.

    • Consider the size of the dataset and the specific operations needed to determine the best data structure.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This round lasted for around 30 minutes. It more of a character analysis round with a lot of HR type questions.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAthenahealth interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

10 Aptitude questions with difficulty level hard were asked in this test.

  • Q1. What is the minimum number of planes required to go around the world?
  • Ans. 

    The minimum number of planes required to go around the world is one.

    • One plane can fly around the world without needing to stop.

    • The plane can refuel mid-air or carry enough fuel for the entire journey.

    • Examples: Non-stop flights like the Boeing 787 Dreamliner or Airbus A350 can circumnavigate the globe with one plane.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on data structures and algorithms. Questions about previous projects done and my roles on it and my leadership capabilities. Few technical questions from Threads and multi-processing.

  • Q1. 

    Search in a Row-wise and Column-wise Sorted Matrix Problem Statement

    You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...

  • Ans. 

    Given a sorted N * N matrix, find the position of a target integer 'X'.

    • Start from the top-right corner of the matrix and compare the target with the element at that position.

    • Based on the comparison, move left or down in the matrix to narrow down the search.

    • Repeat the process until the target is found or the search goes out of bounds.

    • Return the position of the target if found, else return {-1, -1}.

  • Answered by AI
  • Q2. 

    Rectangular Numbers Problem Statement

    Ninja has a number 'N'. Your task is to generate a pattern where the outer rectangle is filled with the number 'N', and as you move inward, the numbers decrease conse...

  • Ans. 

    Generate a pattern with outer rectangle filled with number 'N' and decreasing consecutively inward.

    • Start by filling the outermost rectangle with the number 'N'.

    • Decrease the numbers consecutively as you move inward towards the center.

    • Continue this pattern until you reach the center of the rectangle.

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

DSA based questions were asked in this round. Questions on implementation of Linux directory structure were also asked.

  • Q1. 

    Binary Array Sorting Problem Statement

    You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.

    Input:

     The fir...
  • Ans. 

    Yes, the binary array sorting problem can be solved in linear time and constant space using a single traversal.

    • Use two pointers approach to swap 0s to the left and 1s to the right.

    • Maintain two pointers, one for 0s and one for 1s, and swap elements accordingly.

    • Example: Input: [1, 0, 1, 0, 1], Output: [0, 0, 1, 1, 1]

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Ans. 

    The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.

    • Iterate through the array from right to left and use a stack to keep track of elements.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Store the next greater element for each element in the output array.

  • Answered by AI
  • Q3. What is the difference between Binary Search Trees (BST) and Tries?
  • Ans. 

    BST is a binary tree structure where each node has at most two children, while Tries are tree structures used for storing strings.

    • BST is used for searching, inserting, and deleting elements in a sorted manner.

    • Tries are used for storing and searching strings efficiently.

    • BST has a hierarchical structure with left and right child nodes.

    • Tries have nodes representing characters, forming a tree-like structure for strings.

    • Exa...

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. Questions about previous projects and current one were asked. I was also asked about aptitude problems from the first round and how I understood and approached towards solution?

  • Q1. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate valid configurations recursively and backtrack when a solution is not possible.

  • Answered by AI
  • Q2. 

    Form a Triangle Problem Statement

    You are provided with an integer array/list ARR of length N. Your task is to determine if it is possible to construct at least one non-degenerate triangle using the value...

  • Ans. 

    Check if it is possible to form a non-degenerate triangle using the sides provided in the array.

    • Check if the sum of any two sides is greater than the third side for all combinations.

    • If any such combination exists, return true; otherwise, return false.

    • Handle multiple test cases as per the constraints provided.

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Behavioral questions and team skills were discussed in this round.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAthenahealth interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Quantitative, verbal, reasoning and basic technical questions.
Duration: 1 hour
Total Questions: 50

Round: Technical + HR Interview
Experience: Questions based on data structures, algorithms, and object oriented programming concepts.
Tested basic knowledge in Finance sector especially related to the company.

College Name: Delhi Technological University, Delhi

Nielsen Interview FAQs

How many rounds are there in Nielsen Software Developer interview?
Nielsen interview process usually has 1-2 rounds. The most common rounds in the Nielsen interview process are Technical, Coding Test and One-on-one Round.
How to prepare for Nielsen Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Nielsen. The most common topics and skills that interviewers at Nielsen expect are C#, Software Development, .Net, Azure and Typescript.
What are the top questions asked in Nielsen Software Developer interview?

Some of the top questions asked at the Nielsen Software Developer interview -

  1. Who do you test your django ap...read more
  2. What is Pure compon...read more
  3. Count the number of vowels in a stri...read more

Tell us how to improve this page.

Nielsen Software Developer Interview Process

based on 6 interviews

Interview experience

3.3
  
Average
View more
Nielsen Software Developer Salary
based on 33 salaries
₹8.6 L/yr - ₹15 L/yr
14% more than the average Software Developer Salary in India
View more details

Nielsen Software Developer Reviews and Ratings

based on 4 reviews

4.0/5

Rating in categories

3.5

Skill development

4.5

Work-life balance

4.0

Salary

2.1

Job security

4.0

Company culture

3.5

Promotions

3.1

Work satisfaction

Explore 4 Reviews and Ratings
Data Analyst
211 salaries
unlock blur

₹2 L/yr - ₹9.1 L/yr

Analyst
204 salaries
unlock blur

₹1.8 L/yr - ₹9 L/yr

Senior Research Executive
163 salaries
unlock blur

₹7 L/yr - ₹12.6 L/yr

Manager
162 salaries
unlock blur

₹8.9 L/yr - ₹23 L/yr

Software Engineer
145 salaries
unlock blur

₹4.8 L/yr - ₹19 L/yr

Explore more salaries
Compare Nielsen with

EXL Service

3.7
Compare

Access Healthcare

3.9
Compare

S&P Global

4.1
Compare

Straive

3.4
Compare
Did you find this page helpful?
Yes No
write
Share an Interview