Filter interviews by
I applied via Referral and was interviewed before Oct 2023. There was 1 interview round.
Uber system design involves creating a scalable and efficient platform for matching riders with drivers.
Use of geolocation technology for real-time tracking of drivers and riders
Implementing a dynamic pricing algorithm based on demand and supply
Building a user-friendly mobile app for seamless booking and payment process
Utilizing a robust backend infrastructure to handle millions of requests simultaneously
I applied via LinkedIn and was interviewed in Jul 2022. There were 5 interview rounds.
Test is on C language, test is like multiple choice questions and finally one C code.
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
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 before Oct 2020.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:00 PM.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Iterate through intervals and merge overlapping ones
Sort merged intervals based on starting times
Handle edge cases like empty input or single interval
Use a data structure like list or array to store merged intervals
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Based on the pivot point, perform binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
Round duration - 60 minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerearth. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Hackerearth & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 11:00 A.M to 12:00 P.M
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
Find the minimum number of fountains to activate to water the entire garden.
Iterate through the array to find the coverage of each fountain.
Keep track of the farthest coverage reached by activating fountains.
Activate the fountain that covers the farthest point not yet covered.
Repeat until the entire garden is watered.
Given a directed weighted graph comprised of vertices labeled 1 to N and M edges, where each edge connects two nodes u and v with a weight w representing the distance be...
Bellman Ford algorithm is used to find the shortest path in a graph with negative weights.
Initialize distances from source to all vertices as infinity, and distance to source as 0.
Relax all edges V-1 times to find shortest path.
If any distance is updated in Vth iteration, then there is a negative weight cycle.
Return the distance to destination vertex after V-1 iterations.
Example: For the given graph, shortest path from
Round duration - 30 minutes
Round difficulty - Easy
This was a Google Meet Video Call. The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
I applied via Referral and was interviewed before Jan 2021. There were 5 interview rounds.
posted on 2 Apr 2024
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Its basically a test comprising 32 mcq
12- logical reasoning
20- core C,DBMS, OS , Computer Networks
2 coding Questions
I applied via Campus Placement and was interviewed in Jul 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Few standard dsa questions were asked.
Projects are specific tasks or assignments that require a set of skills and resources to achieve a particular goal or outcome.
Projects involve defining objectives and deliverables
They require planning, execution, and monitoring
Projects often have timelines and budgets
Examples: Data analysis project to identify customer trends, Project to implement a new software system
I am a data analyst with a strong background in statistics and data visualization.
I have a Bachelor's degree in Statistics from XYZ University.
I have 3 years of experience working as a data analyst at ABC Company.
Proficient in using tools like Excel, SQL, and Tableau for data analysis.
I have experience in creating reports and dashboards to present data insights to stakeholders.
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
6
salaries
| ₹10 L/yr - ₹19 L/yr |
Associate Engineer
5
salaries
| ₹16 L/yr - ₹20 L/yr |
QA Engineer
5
salaries
| ₹9 L/yr - ₹14.4 L/yr |
Staff Engineer
5
salaries
| ₹39 L/yr - ₹53 L/yr |
Senior Mobile Engineer
5
salaries
| ₹15 L/yr - ₹25.2 L/yr |
MediaTek India Technology
Qualcomm
Texas Instruments
NXP Semiconductors