Filter interviews by
I applied via Approached by Company and was interviewed in Jan 2024. There was 1 interview round.
Using Java Stream operations to manipulate student objects
Use Stream API to perform operations on a collection of student objects
Apply filter, map, reduce, and other stream operations to transform and manipulate data
Use lambda expressions to define the operations to be performed on each student object
Example: filtering students based on a certain criteria, mapping student names to uppercase, calculating the average gra...
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 before May 2016.
posted on 6 Apr 2022
I appeared for an interview before Apr 2021.
Round duration - 75 minutes
Round difficulty - Medium
This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were of Medium to Hard level of difficulty.
Given two strings, S
and X
, your task is to find the smallest substring in S
that contains all the characters present in X
.
S = "abdd"
X = "bd"
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using DFS and keep track of the current path and its sum.
At each node, check if the current sum equals 'K' and add the path to the result.
Continue traversal to the left and right child nodes recursively.
Return the list of paths that sum up to 'K'.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 60 minutes and 2 questions related to Operating Systems.
You are provided with a binary tree containing 'N' nodes. Your task is to determine if this tree is a Partial Binary Search Tree (BST). Return t...
Validate if a binary tree is a Partial Binary Search Tree (BST) by checking if each node's left subtree contains nodes with data less than or equal to the node's data, and each node's right subtree contains nodes with data greater than or equal to the node's data.
Check if each node's left subtree follows BST property (data <= node's data) and right subtree follows BST property (data >= node's data)
Recursively che...
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Round duration - 60 Minutes
Round difficulty - Hard
In this round, I was asked 3 coding questions out of which I had to implement the first two and for the last question I was only asked the optimal approach. The main challenge in this round was to implement the first two questions in a production ready manner without any bugs and so I had to spent some time thinking about some Edge Cases which were important with respect to the question.
You are given an array arr
of length N
. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...
Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.
A power set of a set 'ARR' i...
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
What people are saying about Qualcomm
Hirepro , 2 easy to medium coding questions with technical questions
To insert a node at the middle of a linked list, find the middle node and adjust pointers accordingly.
Find the middle node using slow and fast pointers
Adjust pointers to insert the new node at the middle
I appeared for an interview before Mar 2024.
I applied via Company Website and was interviewed before Jan 2023. There were 2 interview rounds.
Simple Python Coding questions.
I appeared for an interview before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
Round duration - 30 mins
Round difficulty - Easy
This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?
Tip 1 : Do participate in all the coding contests, long challenges held by codechef, codeforces
Tip 2 : Practice all kinds of problems on leetcode, gfg, coding ninjas
Tip 3 : When you are writing a written exam for a particular company, make sure you get to know about the company in detail.
Tip 1 : Make your resume short and sweet(mostly 1 page, max 2 pages) is preferred.
Tip 2 : Make sure your resume is crisp rather than descriptive
Tip 3 : Do not lie on your resume
I appeared for an interview in May 2025, where I was asked the following questions.
Led a team to develop a scalable cloud-based application for real-time data analytics in the finance sector.
Designed a microservices architecture to enhance scalability and maintainability.
Implemented CI/CD pipelines using Jenkins and Docker for automated testing and deployment.
Utilized AWS services like Lambda and S3 for serverless computing and data storage.
Collaborated with cross-functional teams to gather requireme...
posted on 27 Jul 2024
Designed and implemented a cloud-based data analytics platform for real-time monitoring of network performance.
Led a team of 5 engineers in developing the platform using AWS services such as EC2, S3, and Lambda functions
Integrated data visualization tools like Tableau for generating reports and dashboards
Implemented machine learning algorithms for predictive analysis of network outages
Collaborated with stakeholders to ...
based on 1 interview experience
Difficulty level
Duration
Senior Engineer
1.5k
salaries
| ₹22 L/yr - ₹40 L/yr |
Software Engineer
1.1k
salaries
| ₹16.9 L/yr - ₹30 L/yr |
Engineer
918
salaries
| ₹16.7 L/yr - ₹30 L/yr |
Senior Software Engineer
750
salaries
| ₹23.9 L/yr - ₹40 L/yr |
Senior Leader Engineer
524
salaries
| ₹34.7 L/yr - ₹60 L/yr |
Nvidia
Intel
Mercedes-Benz Research and Development India
Tata Electronics