Legrand Technical Support Engineer Interview Questions and Answers

Tomarrow, power system

Machine power system drive

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

Prevent the duplicate accounts

30min and ask one coding question

30min and ask 2 coding question

Q1. Can you explain the difference between a stack and a queue and provide a real-world example where each would be used.
Ans. 
A stack is a Last In First Out (LIFO) data structure, while a queue is a First In First Out (FIFO) data structure.
• Stack: LIFO - Last In First Out. Example: browser history where the last page visited is the first to be accessed.

• Queue: FIFO - First In First Out. Example: a line at a grocery store where the first person in line is the first to be served.
Answered by AI
Add your answer
Q2. Given an array of integers, write a function to find the two numbers that add up to a specific target. How would you optimize this solution?
Ans. 
Function to find two numbers in array that add up to target. Optimize solution.
• Use a hash map to store each number and its index as you iterate through the array.

• For each number, check if the difference between the target and the number exists in the hash map.

• Return the indices of the two numbers that add up to the target.
Answered by AI
Add your answer