Filter interviews by
Clear (1)
I was interviewed in Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.
Consider 'N' individuals standing in a circle, numbered consecutively from 1 to N, in a clockwise direction. Initially, the person at position 1 starts counting and will skip K-...
This question is about finding the position of the last person surviving in a circle of N people, where each person kills the Kth person in a clockwise direction.
Implement a function that takes the number of test cases, N, and K as input
For each test case, simulate the killing process by iterating through the circle and skipping K-1 people
Keep track of the position of the last person surviving and return it as the outp
Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...
The task is to find the minimum number of conference rooms required to organize all the meetings.
Sort the meetings based on their start time.
Initialize a priority queue to store the end times of the meetings in ascending order.
Iterate through the sorted meetings and check if the start time of the current meeting is greater than the end time of the meeting at the top of the priority queue.
If it is, remove the meeting fr...
Round duration - 75 minutes
Round difficulty - Medium
A google Doc was shared with us and we were supposed to write code there.
Use of IDEs was not allowed so we had to write correct code on Google Docs which was later checked by them through online IDEs.
The Interviewer were friendly and observative and helped us through code if we made some silly error.
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
The question is about finding the minimum number of throws required to reach the last cell on a Snake and Ladder board.
The board is represented as a 2D matrix with N rows and N columns.
Each square on the board can have a snake or ladder, represented by a non-negative number.
The destination of a snake or ladder is the value at the corresponding square.
You can only take a snake or ladder once per move.
If the destination ...
You are given an array/list HEIGHTS
of length N
, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.
The task is to find the largest rectangle possible in a given histogram and return its area.
Iterate through the histogram and maintain a stack to keep track of the indices of the bars in non-decreasing order of heights.
For each bar, calculate the area of the rectangle that can be formed using that bar as the smallest bar.
To calculate the area, pop the bars from the stack until a bar with a smaller height is encountered...
Round duration - 60 minutes
Round difficulty - Easy
The face to face round was held on Google Meet where initially Interviewer asked a DS/Algo problem and then Later Manager Joined and asked about our resume projects in detail.
The time was 10:00 AM
Given an M x N matrix of integers ARR
, your task is to identify the rectangle within the matrix that has the greatest sum of its elements.
The first line of input co...
The task is to find the maximum sum rectangle in a given matrix of integers.
Iterate through all possible rectangles in the matrix
Calculate the sum of each rectangle
Keep track of the maximum sum rectangle found so far
Return the maximum sum
Assume you initially have an empty array called ARR
. You are required to return the updated array after executing Q
number of queries on this array.
There are two types of que...
The problem requires updating an array based on a series of queries, where each query can either insert a value or perform a bitwise XOR operation on all elements.
Use a loop to iterate through each query and update the array accordingly
For type 1 query, append the value to the end of the array
For type 2 query, perform a bitwise XOR operation on each element of the array with the given value
Return the updated array afte
Tip 1 : Prepare OS,DBMS,OOPs too
Tip 2 : Mention atleast one project or past work experience in your resume
Tip 3 : Try maintaining 8+ CGPA as sometimes shortlist is done based on CGPA
Tip 4 : Try past interview questions from Coding Ninjas Site.
Tip 1 : Try to Keep Resume 1 Pager
Tip 2 : Have atleast one project or past work experience mentioned
Tip 3 : Don't put false things on Resume as questions are asked in detail from Resume
Top trending discussions
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I was interviewed in Sep 2017.
Use bitwise operations to find the sum of two numbers without using mathematical operators.
Use bitwise XOR to find the sum of two numbers without carrying.
Use bitwise AND and left shift to find the carry.
Repeat the process until there is no carry left.
To delete a node from a linked list when only given a reference to the node, we can copy the data of the next node to the given node and delete the next node.
Copy the data of the next node to the given node
Update the next pointer of the given node to skip the next node
Delete the next node
I applied via Campus Placement
The question asks to fill the blanks in a pyramid where each number is the sum of the numbers in the bottom two cells.
Start from the bottom row and work your way up, calculating the sum of the numbers in the bottom two cells for each blank space.
Use a loop to iterate through each row and column of the pyramid.
Store the calculated sum in the corresponding blank space.
Repeat the process until all the blanks are filled.
Moore's Law is the observation that the number of transistors in a dense integrated circuit doubles about every two years.
Named after Intel co-founder Gordon Moore
First stated in 1965
Has been a driving force behind technological advancements
Predicts exponential growth in computing power
Has been challenged in recent years due to physical limitations
A process is an instance of a program while a thread is a subset of a process.
A process has its own memory space while threads share memory space
Processes are heavyweight while threads are lightweight
Processes communicate through inter-process communication while threads communicate through shared memory
Examples of processes include web browsers, text editors, etc. while examples of threads include GUI updates, backgro
Multi-core processors provide faster and more efficient computing.
Improved performance and speed
Ability to handle multiple tasks simultaneously
Reduced power consumption
Better multitasking capabilities
Enhanced user experience
Examples: Intel Core i7, AMD Ryzen 9
I am a software engineer with a loving family.
I have been working as a software engineer for 5 years.
My wife is a teacher and we have two children.
We enjoy spending time together outdoors and traveling.
My parents live in a different state but we keep in touch regularly.
Family is very important to me and I prioritize spending time with them.
Developed a web-based project management tool and a mobile app for tracking expenses
Created a responsive UI using React and Bootstrap
Implemented user authentication and authorization using Firebase
Integrated Google Maps API for location tracking in the mobile app
Used Node.js and MongoDB for backend development
Collaborated with a team of four to complete the projects
I have 5 years of experience in software engineering with expertise in Java and Python.
Developed and maintained web applications using Java and Spring framework
Designed and implemented RESTful APIs using Python and Flask
Worked on database management and optimization using MySQL and MongoDB
Collaborated with cross-functional teams to deliver high-quality software products
Participated in code reviews and provided construc
My academic interests include computer science, artificial intelligence, and machine learning.
Computer science
Artificial intelligence
Machine learning
Explain Big O notation
Big O notation is used to describe the time complexity of an algorithm
It helps us understand how the algorithm's performance changes with input size
O(1) means constant time, O(n) means linear time, O(n^2) means quadratic time
We want algorithms with lower Big O values for better performance
I am open to relocation based on the job opportunity and growth prospects.
Open to relocation for the right opportunity
Willing to move for career growth
Flexible with location based on job requirements
Yes, I would love to have a pizza slice!
I am a big fan of pizza and would never say no to a slice!
Pizza is the perfect food for any occasion, whether it's a quick lunch or a late-night snack.
I particularly enjoy pepperoni and mushroom pizza, but I'm open to trying new toppings as well.
posted on 23 Sep 2017
I was interviewed in Sep 2017.
An SR flip-flop can be implemented using NAND gates.
Use two NAND gates to create the SR flip-flop.
Connect the output of one NAND gate to the input of the other NAND gate.
Connect the Set (S) and Reset (R) inputs to the inputs of the NAND gates.
The output of the first NAND gate is the Q output, and the output of the second NAND gate is the Q̅ output.
The answer describes the steps to find and display the temperature of N rooms.
Create an array to store the temperature of each room
Iterate through each room and prompt the user to enter the temperature
Store the temperature in the corresponding array index
Display the temperature of each room
I was interviewed in Aug 2017.
I was interviewed in Aug 2017.
I lack experience in a specific technology required for the role.
I may not have experience with a specific programming language or framework mentioned in the job description.
I may not have worked on projects similar to what your company is working on.
I may not have experience with certain tools or technologies that are crucial for the role.
I was interviewed in Dec 2016.
I was interviewed in Sep 2016.
Code for scheduling in C
Define a struct for the task with fields like start time, end time, priority, etc.
Create an array of tasks and sort them based on priority and start time
Implement a scheduling algorithm like Round Robin or Priority Scheduling
Use system calls like fork() and exec() to create and execute processes
Implement synchronization mechanisms like semaphores or mutexes to avoid race conditions
I was interviewed in Sep 2016.
based on 1 review
Rating in categories
Analog Design Engineer
150
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
72
salaries
| ₹0 L/yr - ₹0 L/yr |
Design Engineer
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Digital Design Engineer
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Application Developer
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Analog Devices
NXP Semiconductors
Microchip Technology
STMicroelectronics