Ensto Product Development Engineer Interview Questions and Answers

Gaming aptitude gaming questions easy but iq is very imp

They asked to find the elements which are present more than once. I solved it using map in c++

Q1. Explain about your favorite algorithm
Ans. 
My favorite algorithm is Dijkstra's algorithm for finding the shortest path in a graph.
• Dijkstra's algorithm is a greedy algorithm that finds the shortest path between nodes in a graph.

• It works by maintaining a priority queue of nodes to visit next, updating the shortest distance to each node as it explores the graph.

• The algorithm is commonly used in routing and network optimization.

• Example: Finding the shortest route b
Answered by AI
Add your answer
Q2. Tell about different types of deadlocks
Ans. 
Deadlocks occur when two or more processes are unable to proceed because each is waiting for the other to release a resource.
• Resource deadlocks: Processes hold resources and wait for others to release resources. Example: Process A holds resource X and waits for resource Y, while Process B holds resource Y and waits for resource X.

• Communication deadlocks: Processes wait for messages from each other indefinitely. Example...read more
Answered by AI
Add your answer
Q3. Tell about you project.
Ans. 
Developed a web application for online shopping with user authentication and payment gateway integration.
• Implemented user authentication using JWT tokens

• Integrated Stripe API for payment processing

• Designed responsive UI using React and Bootstrap
Answered by AI
Add your answer

One easy and one medium level question

Q1. Divide a linked list into even and odd without changing order.
Ans. 
Split a linked list into even and odd without changing order.
• Create two new linked lists for even and odd numbers.

• Iterate through the original linked list and append nodes to respective even or odd lists.

• Finally, merge the even and odd lists to get the desired result.
Answered by AI
Add your answer
Q2. Questions related to oops and project were asked
Add your answer

Q1. Prepare upcasting and downcasting questions
Add your answer
Q2. Core Java Overriding and Overloading Questions
Add your answer
Q3. Sort 0 1 and 2s in an array
Ans. 
Sort an array of 0s, 1s, and 2s.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s.

• Traverse the array and swap elements to their respective positions.

• Time complexity: O(n), Space complexity: O(1).
Answered by AI
Add your answer

It was general apti test 30 questions

Two coding questions were there

Electrical engineering

Power system machine power electronics