Molex Software Engineer Intern Interview Questions and Answers

Q1. Asked few basic Dsa questions and questions about projects from your resume
Add your answer
Q2. Reverse the linkedlist
Ans. 
Reverse a linked list
• Iterate through the linked list and reverse the pointers

• Use three pointers to keep track of current, previous, and next nodes

• Update the next pointer of each node to point to the previous node
Answered by AI
Add your answer

Q1. About myself, and few questions from OS and database. And why do you find fit for the role
Add your answer

Q1. OOPS questions , project related questions , linked list , trees
Add your answer
Q2. Verilog coding questions
Add your answer
Q3. Digital electronics and signal ans systems
Add your answer

Q1. Macros in depth , technical c++ and dsa questions , verilog coding
Add your answer
Q2. Project related questions , general design questions
Add your answer

It was related to electrical

Q1. Analog circuits related
Add your answer
Q2. Digital circuits related
Add your answer

One round online life coding, with the question being a simple find the smallest element from a list

60 questions - 20 aptitude, 20 CS fundamentals, 20 coding basics

Q1. Next Greater Element for Each Element in an Array
Ans. 
Find the next greater element for each element in an array.
• Use a stack to keep track of elements without a next greater element.

• Iterate through the array and compare elements with the top of the stack.

• Update the stack with the current element if it is greater than the top element.
Answered by AI
Add your answer
Q2. Binary Search in Sorted Rotated Array - No Duplicates
Ans. 
Binary search in a sorted rotated array with no duplicates.
• Find the pivot point where the array is rotated.

• Determine which half of the array to search based on the target value and pivot point.

• Perform binary search in the selected half of the array.
Answered by AI
Add your answer
Q3. Binary Search in Sorted Rotated Array - Duplicates Present
Ans. 
Binary search in a sorted rotated array with duplicates present.
• Perform a modified binary search by checking both ends of the array for duplicates

• Handle cases where duplicates are present at the start, end, or middle of the array

• Consider cases where the array is rotated multiple times
Answered by AI
Add your answer