Nielsen React Js Frontend Developer Interview Questions and Answers for Experienced

60 min covered all reasoning topics

Coding test according to language

Round duration - 70 minutes
Round difficulty - Medium

Timing: Window for 2 days
Environment: Online
Time: 50 Min. for 50 MCQ and 20 min for 2 Coding Questions

Q1. 
Number Pattern Problem Statement
Design a seating arrangement for a high-security meeting. There are 'N' rows of tables set up where the first row contains one table, the second row contains two tables, a...read more
Ans. 
Design a seating arrangement for a high-security meeting with specific table assignments for security personnel and guests.
• Create a loop to iterate through each row from 1 to N.

• Assign tables on either end of each row to security personnel.

• For rows with only one table, assign it to security personnel.

• Display the seating arrangement with the number of people at each table.

• Example: For 4 rows, the output pattern is 1, 11,
Answered by AI
Add your answer
Q2. 
Insert Interval Problem Statement
You are provided with a list of 'N' non-overlapping intervals, each defined by two integers, 'start' and 'end', sorted in ascending order by 'start' values. Your task is ...read more
Ans. 
The task is to insert a given interval into a list of non-overlapping intervals while maintaining sorted order.
• Iterate through the list of intervals to find the correct position to insert the given interval.

• Merge any overlapping intervals with the given interval.

• Update the list of intervals accordingly.

• Handle edge cases such as when the given interval completely overlaps with existing intervals.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing: Morning
Environment: On MS-Teams

Q1. 
Quick Sort Problem Statement
Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...read more
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by choosing a pivot point and partitioning the array into two parts recursively.
• Choose a pivot element (e.g., rightmost element) to partition the array into two subarrays.

• Recursively apply quick sort to the subarrays until the entire array is sorted.

• Time complexity can be optimized to NlogN in the worst case by selecting the pivot strategically.

• Ensure the...read more
Answered by AI
Add your answer

Apt + coding questions, medium difficulty

Q1. Basics qs on oops and known programming language
Add your answer

Q1. In-depth of oops and live coding questions
Add your answer

Q1. Basics qs like y and what
Add your answer

1st Round is Up to an hr in that we have to perform Coding as per the test provided & also SQL round involve in it we have to show as output as per the test is concerned to provide valid outputs.

2nd round was an aptitude test of 90 mins it was like 100 Questions we have to solve and submit that it involved Logical Reasoning, Mathematical problems, Word Problems, etc.

Q1. Tell me about your projects and what you have done in your previous company.
Add your answer
Q2. On basis of Projects, the Technical questions that were asked, and also other situations given on that basis what I will do in the Logical process need to explain the steps.
Add your answer
Q3. Basics Of Java OOPs Concepts Questions
Add your answer

60 min normal apptitude question

Q1. What is the difference between encapsulation and abstraction, sql query 2nd highest salary, what is inheritance
Add your answer
Q2. Tell me about project what is oops
Add your answer

Q1. Normal question related to project
Add your answer
Q2. He asked about me stock market
Add your answer