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-...
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...
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.
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 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 before May 2021.
Round duration - 120 Minutes
Round difficulty - Medium
Round duration - 60 Minutes
Round difficulty - Easy
Given a singly linked list with 'N' nodes containing integer values, your task is to sort the list using insertion sort and output the sorted list.
Insertion Sort is an al...
Implement insertion sort algorithm on a singly linked list with integer values.
Traverse the linked list and for each node, find its correct position in the sorted list.
Remove the node from the original list and insert it at the correct position in the sorted list.
Repeat this process until all nodes are sorted.
Ensure the implementation is in-place, without using extra space.
Handle edge cases like empty list or single no...
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in O(1) time complexity.
Handle cases where the stack is empty appropriately.
Implement the logic for each query type as specified in the input and output sections.
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Integer N
Prime numbers printed on separate lines
Generate and print all prime numbers between 2 and N, inclusive.
Iterate from 2 to N and check if each number is prime
Use a helper function to determine if a number is prime
Print each prime number on a new line
Round duration - 45 Minutes
Round difficulty - Medium
This round was based on oops concepts and their applications and about STLs.
Given a number N
, generate a pattern where the outer rectangle is filled with the number N
, and the inner rectangles contain decreasing numbers down to 1.
The input be...
Generate a rectangular pattern with outer rectangle filled with N and inner rectangles containing decreasing numbers.
Create a 2-D array with dimensions based on input N
Fill the outer rectangle with N and inner rectangles with decreasing numbers down to 1
Adjust the values in the inner rectangles based on the layer number
Return the generated pattern as a 2-D list/array
Round duration - 30 Minutes
Round difficulty - Easy
This around was basically to judge my communication and behavioral skills.
Tip 1 : Basics should be very clear related to DSA.
Tip 2 : Good knowledge of OS will be plus for Qualcomm
Tip 3 : One should revise the college project thoroughly before interview.
Tip 1 : Be brief while writing resume.
Tip 2 : Mention atleast 2 projects.
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...
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 appeared for an interview in Aug 2017.
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...
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
Generate all combinations of digits from an array, allowing and disallowing repetition.
Use recursion or backtracking to generate combinations.
For repetition allowed: e.g., arr={1,2}, combinations are 11, 12, 21, 22.
For repetition not allowed: e.g., arr={1,2,3}, combinations are 123, 132, 213, 231, 312, 321.
Utilize a set to track used digits when repetition is not allowed.
I appeared for an interview in Aug 2017.
I appeared for an interview before May 2016.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Fill the cells in the pyramid
The pyramid is a pattern of numbers or characters arranged in a triangular shape
Each row of the pyramid has one more cell than the previous row
Start filling the pyramid from the top and move downwards
The cells can be filled with any desired numbers or characters
An alternator and generator are devices that convert mechanical energy into electrical energy.
Both alternators and generators are used to generate electricity.
They work on the principle of electromagnetic induction.
Alternators are commonly used in modern vehicles to charge the battery and power the electrical systems.
Generators are often used as backup power sources during power outages.
Examples of alternators include ...
I developed a mobile app for tracking daily water intake and hydration levels.
Researched best practices for hydration tracking
Designed user-friendly interface for inputting water intake
Implemented data visualization for tracking hydration levels
Tested app with focus groups for feedback
Continuously updated app based on user suggestions
SHA Algorithm is a cryptographic hash function that takes an input and produces a fixed-size output.
SHA stands for Secure Hash Algorithm.
It is widely used in various security applications and protocols.
SHA-1, SHA-256, SHA-384, and SHA-512 are common variants of SHA.
It generates a unique hash value for each unique input.
The output is a fixed length, regardless of the input size.
SHA is used for data integrity, password h...
I will solve disputes by promoting open communication, active listening, and finding mutually beneficial solutions.
Encourage open and honest communication between parties involved
Actively listen to each party's concerns and perspectives
Identify common goals and interests to find mutually beneficial solutions
Mediate discussions and facilitate negotiations if necessary
Document agreements and ensure follow-up to prevent f...
I appeared for an interview in Dec 2016.
based on 1 review
Rating in categories
Analog Design Engineer
133
salaries
| ₹21.5 L/yr - ₹38.6 L/yr |
Software Engineer
76
salaries
| ₹18 L/yr - ₹32 L/yr |
Senior NPD Engineer
67
salaries
| ₹20.4 L/yr - ₹25.8 L/yr |
Digital Design Engineer
53
salaries
| ₹19.5 L/yr - ₹33 L/yr |
Application Developer
46
salaries
| ₹14 L/yr - ₹23 L/yr |
Qualcomm
Intel
Molex
TDK India Private Limited