Filter interviews by
I applied via LinkedIn and was interviewed in Nov 2022. There were 2 interview rounds.
CMOS devices are the building blocks of digital circuits, consisting of a PMOS and an NMOS transistor.
CMOS stands for Complementary Metal-Oxide-Semiconductor
PMOS and NMOS transistors are used to create logic gates
CMOS devices have low power consumption and high noise immunity
The operation of a CMOS device involves charging and discharging the gate capacitance to control the flow of current
The output of a CMOS device is...
Top trending discussions
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Dec 2015. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed before May 2020. There were 3 interview rounds.
Clone a linked list with random pointers.
Create a new node for each node in the original list.
Store the mapping between the original and cloned nodes in a hash table.
Traverse the original list again and set the random pointers in the cloned list using the hash table.
Return the head of the cloned list.
I appeared for an interview in Feb 2025, where I was asked the following questions.
I have over 5 years of experience in software development, specializing in web applications and cloud technologies.
Developed a full-stack web application using React and Node.js, improving user engagement by 30%.
Led a team of 4 developers in creating a microservices architecture for a scalable e-commerce platform.
Implemented CI/CD pipelines using Jenkins and Docker, reducing deployment time by 50%.
Worked with Agile met...
I applied via Referral and was interviewed in Nov 2023. There were 6 interview rounds.
Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.
Using Bitwise OR operation to find the smallest missing number in an array.
Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask
Iterate through the bitmask to find the first unset bit, which represents the smallest missing number
Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Pseudo code for a scenario
Define variables and data structures needed
Write the main logic using conditional statements and loops
Handle edge cases and error conditions
Test the pseudo code with sample inputs
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
2 problem was given to solve
1) Smallest Negative balance - -----%20America%20-%20Weekly%20Algorithm%20Challenges/Week%2021%20Algorithm%20Challenge/Smallest%20Negative%20Balance.md
2) Find the absolute difference between alpha & beta from the array.
Alpha -An element k in a array occurs k consecutive time
Beta - An element k in an array occurs k consecutive time starting from index k
Sample input
Arr[] = {2,2,2,4,4,4,4,1,2,2]
Output
Alpha - 3
Beta - 1
Absolute difference - 1
Note : consider array index starts with 1
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
posted on 8 Jul 2021
based on 1 interview
Interview experience
Senior Validation Engineer
4
salaries
| ₹14 L/yr - ₹18 L/yr |
Physical Design Engineer
3
salaries
| ₹6.8 L/yr - ₹8.1 L/yr |
Samsung Semiconductor
STJ Electronics
Tokai Rika Minda
Dexcel Electronics Designs