Filter interviews by
I appeared for an interview 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
posted on 5 Dec 2017
I applied via Campus Placement and was interviewed in Dec 2017. There was 0 interview round.
I appeared for an interview 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 and was interviewed in Dec 2016. There were 5 interview rounds.
UDP is preferred over TCP in this project due to its low latency and lightweight nature.
UDP is a connectionless protocol, which means it does not establish a direct connection between the sender and receiver.
UDP is faster than TCP as it does not have the overhead of establishing and maintaining a connection.
UDP is suitable for applications where real-time data transmission is crucial, such as video streaming or online ...
To clear the 7th bit in a 32-bit register, perform a bitwise AND operation with a mask that has all bits set to 1 except the 7th bit.
Create a mask with the 7th bit set to 0 and all other bits set to 1
Perform a bitwise AND operation between the register and the mask
Store the result back in the register
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.
I appeared for an interview in Nov 2016.
Need more context. What needs to be done with the large rectangle?
What are the dimensions of the rectangle?
Is it a 2D or 3D object?
What is the context of the problem?
Are there any constraints or limitations?
What tools or programming languages can be used?
Derive a formula to determine how many smaller rectangles fit into a bigger rectangle given their dimensions.
Calculate the number of times the smaller rectangle can fit into the bigger rectangle horizontally and vertically
Divide the width of the bigger rectangle by the width of the smaller rectangle to get the horizontal count
Divide the height of the bigger rectangle by the height of the smaller rectangle to get the ve...
At least 4 points are required to draw a rectangle.
A rectangle has 4 sides and 4 corners, so at least 4 points are needed to define those corners.
The points must be arranged in a specific order to form a closed shape with 4 sides.
Additional points can be used to add details or modify the shape of the rectangle.
The number of points required may vary depending on the software or tool used to draw the rectangle.
Answering how to calculate new coordinates of a scaled rectangle and providing a program for it.
To calculate new coordinates, multiply the original coordinates by the scaling factor
Scaling factor can be calculated by dividing the new length/breadth by the original length/breadth
Program can take input of original coordinates, scaling factor, and output new coordinates
Example: Original coordinates: (0,0), (0,5), (5,5), (...
posted on 10 May 2015
Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities
For unsorted array, use nested loops to compare each element with every other element until the sum is found
For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found
Complexity for unsorted array is O(n^2) and for sorted array is O(n)
Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.
Incrementing a pointer moves it to the next memory location of the same data type
Decrementing a pointer moves it to the previous memory location of the same data type
The address of operator (&) returns the memory address of a variable
The value at operator (*) returns the value sto
To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.
Check if the point's x-coordinate is greater than the left edge of the rectangle
Check if the point's x-coordinate is less than the right edge of the rectangle
Check if the point's y-coordinate is greater than the top edge of the rectangle
Check if the point's y-coordinate is less than the b...
To find line that divides rectangle into 2 equal halves through a point inside it.
Find the center of the rectangle
Draw a line from the center to the given point
Extend the line to the opposite side of the rectangle
The extended line will divide the rectangle into 2 equal halves
There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?
There are 2^8 (256) possible combinations of 8-bit signed numbers.
There are 2^16 (65,536) possible combinations of 16-bit signed numbers.
To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.
Therefore, the total number of possible combinations is 256 +
Find duplicates in an array of elements in 0(n) time and 0(1) space.
Use the property of inputs to your advantage
Iterate through the array and mark elements as negative
If an element is already negative, it is a duplicate
Return all the negative elements as duplicates
posted on 7 May 2017
I appeared for an interview in Feb 2017.
malloc is a function in C that dynamically allocates memory on the heap. It is used to allocate memory for variables or data structures.
malloc is used in C programming language.
It is used to allocate memory on the heap.
malloc is different from 'new' in C++ as it does not call constructors for objects.
C++ is a general-purpose programming language while Objective C is a superset of C used for iOS and macOS development.
C++ is widely used for developing applications, games, and system software.
Objective C is mainly used for iOS and macOS development.
C++ supports both procedural and object-oriented programming paradigms.
Objective C is an object-oriented language with dynamic runtime features.
C++ has a larger community a...
Class container is a class that holds objects of other classes, while class composition is a way to combine multiple classes to create a new class.
Class container holds objects of other classes, acting as a collection or container.
Class composition combines multiple classes to create a new class with its own behavior and attributes.
In class container, the objects are typically stored in a data structure like an array o...
Divide the horses into groups of 5 and race them. Take the top 2 from each race and race them again. Finally, race the top 2 horses to determine the top 3.
Divide the horses into 3 groups of 5 and race them.
Take the top 2 horses from each race and race them again.
Finally, race the top 2 horses to determine the top 3.
Developing a real-time data processing system for a high-traffic e-commerce website
Implemented a distributed system architecture to handle large volumes of data
Optimized algorithms for efficient data processing and storage
Utilized caching mechanisms to improve system performance
Worked closely with cross-functional teams to troubleshoot and resolve issues
Example: Successfully reduced data processing time by 50% by imple
Seeking new challenges and opportunities for growth.
Looking for a more challenging role to further develop my skills
Interested in exploring new technologies and industries
Seeking better career advancement opportunities
Want to work in a more collaborative team environment
The width of a tree is the maximum number of nodes at any level in the tree.
To calculate the width of a tree, we can perform a level order traversal and keep track of the maximum number of nodes at any level.
We can use a queue data structure to perform the level order traversal.
At each level, we count the number of nodes in the queue and update the maximum width if necessary.
I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.
Phases of compiler include lexical analysis, syntax analysis, semantic analysis, code generation, and optimization.
Lexical analysis: breaking down input into tokens
Syntax analysis: checking if tokens form valid syntax
Semantic analysis: checking if syntax is semantically correct
Code generation: generating machine code from input
Optimization: improving generated code performance
C is preferred over C++ for certain applications due to its simplicity and efficiency.
C is a simpler language compared to C++ and has a smaller runtime footprint.
C is often used for low-level programming, embedded systems, and operating systems.
C allows for more control over memory management and can be faster in certain scenarios.
C++ introduces additional features like object-oriented programming and templates, which
Classes are blueprints for creating objects, while structures are similar but with different default access levels.
Classes and structures are used to define the structure and behavior of objects in object-oriented programming.
Classes are reference types and are allocated on the heap, while structures are value types and are allocated on the stack.
Memory allocation for classes is managed by garbage collection, while mem...
I appeared for an interview before May 2016.
based on 1 review
Rating in categories
Software Engineer
73
salaries
| ₹9.7 L/yr - ₹38.9 L/yr |
Senior NPD Engineer
67
salaries
| ₹20.4 L/yr - ₹25.9 L/yr |
Analog Design Engineer
59
salaries
| ₹14.6 L/yr - ₹41.9 L/yr |
Design Engineer
54
salaries
| ₹10.1 L/yr - ₹40.2 L/yr |
Digital Design Engineer
52
salaries
| ₹17 L/yr - ₹37 L/yr |
Qualcomm
Intel
TDK India Private Limited
Molex