Nykaa Senior Software Engineer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round where the interviewer asked me 2 DSA based problems.

Q1. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Ans. 
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
• Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks at different points.

• Keep track of the maximum profit that can be achieved by considering all possible combinations of buy and sell transactions.

• Ensure that y...read more
Answered by AI
View 1 more answer
Q2. 
Number of Bit Flips Problem Statement
Ninja is practicing binary representations and stumbled upon an interesting problem. Given two numbers 'A' and 'B', you are required to determine how many bits need t...read more
Ans. 
Calculate the number of bit flips required to convert one number to another in binary representation.
• Convert both numbers to binary representation

• Count the number of differing bits between the two numbers

• Output the count of differing bits as the number of bit flips required

• Example: A = 13 (1101), B = 7 (0111) -> 2 bit flips required
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round where the interviewer asked me 2 DSA based problems.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in top-down order

• Traverse the leaf nodes in left-right order

• Traverse the right boundary nodes in bottom-up order

• Handle cases where duplicates occur in boundary nodes
Answered by AI
Add your answer
Q2. 
Reverse Linked List in Groups of K
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...read more
Ans. 
Reverse a linked list in groups of size K by reversing nodes in each group.
• Iterate through the linked list in groups of size K

• Reverse each group of nodes

• Handle cases where the number of elements in the last group is less than K
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked behavioral problems.

Q1. OOPS, java, data structure
Add your answer
Q2. Coding assignment for binary search
Ans. 
Implement binary search algorithm to find a target string in a sorted array of strings.
• Ensure the array of strings is sorted before performing binary search.

• Compare the target string with the middle element of the array and adjust the search range accordingly.

• Repeat the process until the target string is found or the search range is exhausted.
Answered by AI
Add your answer

Q1. What is your Notice period
Add your answer
Q2. Expectation from new job
Add your answer

Q1. Discussion with Lead Engineer around basics of javascript, HTML, CSS, and Resume based question
Add your answer

Q1. Discussion with Technical Architect around Some advanced concepts of javascript, React, Some aptitude questions.
Add your answer

Q1. Discussion with hiring manager. Understanding around the project, roles and responsibility of the position I was being hired for.
Add your answer

Aptitude test was on hacker earth

No coding test was taken by the interviewrrwe

Asked dome simple LinkedIn list and array questions.

Q1. Some basic Java and opps and SQL query
Add your answer