Nykaa Applications Engineer Interview Questions and Answers for Experienced

Q1. 2 questions both are from array and string
Add your answer

1hr test 2 DSA problems

Q1. 2DSA problems 1 from DP and 1 from heaps
Ans. 
Dynamic programming and heap problems are common in technical interviews for Applications Engineer roles.
• Dynamic programming (DP) involves breaking down a problem into smaller subproblems and solving each subproblem only once. Example: finding the longest increasing subsequence in an array.

• Heaps are data structures that satisfy the heap property. Example: finding the kth largest element in an array using a heap.
Answered by AI
Add your answer

It consists of Code based on DSA-concepts

Q1. It was a problem-solving round using DSA
Add your answer

Q1. Technical and Behavioral questions
Add your answer

Dynamic Programming, Greedy Algorithm

Topics:
data types
scripting

Q1. About prev experience
Add your answer
Q2. About pre experience
Add your answer
Q3. Why you are interested for this role
Add your answer

Datatypes,
scripting

Q1. Total 3 round was there First 2 questions from the data structure and algorithm and third round was design
Add your answer
Q2. Reverse the linked list
Ans. 
Reverse a linked list
• Create three pointers: current, prev, and next

• Iterate through the linked list, updating pointers accordingly

• Set the head of the linked list to the new tail
Answered by AI
Add your answer
Q3. Diameter of binary tree
Ans. 
The diameter of a binary tree is the number of nodes on the longest path between two leaves in the tree.
• The diameter of a binary tree can be calculated by finding the height of the left subtree, the height of the right subtree, and adding them together.

• The diameter may or may not pass through the root of the tree.

• Example: For the binary tree below, the diameter is 4 (nodes 1, 2, 4, 7).

• 1

• / \

• 2 3

• / \
Answered by AI
Add your answer