Filter interviews by
I appeared for an interview in Apr 2025, where I was asked the following questions.
Find the top k most frequently occurring items in an array of strings.
Use a hash map to count occurrences of each item. Example: ['apple', 'banana', 'apple'] -> {'apple': 2, 'banana': 1}.
Sort the items based on their counts. Example: [('apple', 2), ('banana', 1)] sorted by count.
Select the top k items from the sorted list. Example: If k=1, return ['apple'].
A flipping coins game where players guess the outcome of coin flips to win points.
Players take turns guessing 'Heads' or 'Tails' for each coin flip.
Each correct guess earns the player a point.
The game continues for a set number of rounds or until a player reaches a target score.
Example: If a player guesses 'Heads' and the coin lands on 'Heads', they score a point.
At the end of the game, the player with the most points ...
I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.
Implement an iterator to flatten 2D vector
Use Dijkstra's algorithm to find the shortest path to get all keys
Implement Dijkstra's algorithm to find the shortest path in a graph
Consider the keys as nodes in the graph and the paths between keys as edges
Keep track of the keys collected and update the shortest path accordingly
Top trending discussions
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Array: [2,1,5,6,3,8], K ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
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.
I applied via Campus Placement and was interviewed before Dec 2015. There were 5 interview rounds.
Reverse a linked list
Iteratively swap the next and previous pointers of each node
Use three pointers to keep track of the current, previous, and next nodes
Update the head pointer to the last node after reversing
I appreciate the company's commitment to innovation and employee development.
Strong focus on innovation in software development
Opportunities for professional growth and development
Positive company culture and work environment
I am impressed by the company's innovative projects and collaborative work environment.
Impressed by innovative projects
Desire to work in a collaborative environment
Excited about potential for growth and learning opportunities
I appeared for an interview in Sep 2016.
Normalization organizes data to reduce redundancy and improve integrity in databases.
Identify functional dependencies: Determine which attributes depend on others.
First Normal Form (1NF): Ensure all entries in a column are atomic. E.g., split 'Phone Numbers' into separate entries.
Second Normal Form (2NF): Remove partial dependencies. E.g., if 'StudentID' determines 'StudentName', separate into a new table.
Third Normal ...
Understanding join and groupby queries is essential for data manipulation in SQL databases.
JOIN combines rows from two or more tables based on a related column. Example: SELECT * FROM A JOIN B ON A.id = B.a_id;
INNER JOIN returns records with matching values in both tables. Example: SELECT * FROM A INNER JOIN B ON A.id = B.a_id;
LEFT JOIN returns all records from the left table and matched records from the right table. E...
Web server handles HTTP requests and responses, while application server executes application logic.
Web server serves static content like HTML, CSS, JS files
Application server executes dynamic code like Java, Python, Ruby
Web server communicates with client, application server communicates with database
Examples of web servers: Apache, Nginx, IIS
Examples of application servers: Tomcat, JBoss, WebSphere
This question involves coding a pattern based on specified rules, typically using loops and conditionals.
Identify the pattern structure (e.g., stars, numbers).
Use nested loops for rows and columns.
Example: For n=3, output could be: * ** ***
Consider edge cases like n=0 or negative values.
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
I appeared for an interview before May 2021.
Round duration - 120 minutes
Round difficulty - Easy
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.
Given a 2-dimensional boolean matrix mat
of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
Iterate through the matrix to find elements with value 1
Store the row and column indices of these elements
Update the entire row and column for each element found to be 1
Round duration - 60 minutes
Round difficulty - Easy
It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Tip 1 : Clear basics
Tip 2 : Prepare well
Tip 3 : Do at-least 2 projects
Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly
I applied via Campus Placement and was interviewed in Oct 2019. There were 5 interview rounds.
Find sum of k smallest numbers in a BST.
Traverse the BST in-order and add the k smallest numbers to a sum variable.
Use a priority queue to keep track of the k smallest numbers.
If k is greater than the number of nodes in the BST, return the sum of all nodes.
If k is 0, return 0.
Design algorithm and database for seat booking system of BookMyShow and handle failed payments.
Create a database with tables for movies, theaters, seats, bookings, and payments
Use a locking mechanism to prevent double booking of seats
If payment fails, release the locked seats and notify the user
Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;
Code for time stamp in C
Use the time.h header file
Call the time() function to get the current time in seconds
Convert the time to a string using strftime() function
Use the format string to specify the desired format of the time stamp
Rearrange array in consecutive pair multiplication in descending order.
Create a new array to store the multiplied values
Use a loop to iterate through the original array and multiply consecutive pairs
Write a compare function to sort the new array in descending order
Code to rearrange an array in maximum-minimum form.
Sort the array in descending order.
Create a new array and alternate between adding the maximum and minimum values from the sorted array.
Return the new array.
Time complexity: O(nlogn)
Space complexity: O(n)
stoi() function converts a string to an integer.
stoi() is a C++ function that takes a string as input and returns an integer.
It is used to convert a string of digits into an integer.
It can also handle negative numbers and ignore leading whitespace.
Example: int num = stoi("123"); // num is now 123
Code for finding the longest common substring in an array of strings.
Iterate through the first string and check for all possible substrings
Check if the substring is present in all other strings
Keep track of the longest common substring found so far
Return the longest common substring
Answers to common technical questions in a software engineering interview
A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.
A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.
Common Linux commands include ls...
I applied via AmbitionBox and was interviewed before Sep 2020. There were 3 interview rounds.
Unique key allows null values, primary key does not.
Primary key is a unique identifier for a record in a table
Unique key allows null values, primary key does not
A table can have only one primary key, but multiple unique keys
Primary key is automatically indexed, unique key is not necessarily indexed
HAVING clause is used in SQL to filter data based on aggregate functions.
It is used with GROUP BY clause to filter data based on aggregate functions
It is used to filter data after grouping has been done
It is similar to WHERE clause but operates on grouped data
Example: SELECT department, AVG(salary) FROM employees GROUP BY department HAVING AVG(salary) > 50000;
based on 2 interview experiences
Difficulty level
Duration
based on 1 review
Rating in categories
Claims Specialist
37
salaries
| ₹5.1 L/yr - ₹10.2 L/yr |
Senior Analyst
35
salaries
| ₹7.7 L/yr - ₹19.9 L/yr |
Business Analyst
22
salaries
| ₹9.2 L/yr - ₹24 L/yr |
Team Coordinator
21
salaries
| ₹7.2 L/yr - ₹20 L/yr |
Resolution Specialist
21
salaries
| ₹4.3 L/yr - ₹7 L/yr |
Uber
Amazon