Filter interviews by
I applied via LinkedIn and was interviewed before Oct 2022. There were 4 interview rounds.
Design a poster for a comedy event.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I applied via LinkedIn and was interviewed before May 2020. There was 1 interview round.
I applied via Walk-in and was interviewed in May 2021. There was 1 interview round.
I appeared for an interview in Nov 2020.
I applied via Company Website and was interviewed before Jun 2023. There was 1 interview round.
I appeared for an interview before May 2021.
Round duration - 90 Minutes
Round difficulty - Medium
1 easy and 2 medium-hard DSA problems to solve
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...
Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.
Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level
Return the current level as the number of levels cleared
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate valid configurations recursively and backtrack when a solution is not possible.
Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...
Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.
Bob can move to any adjacent vertex in a single step
Bob must return to vertex 'O' after exactly 'N' steps
Calculate the number of different ways Bob can complete the journey
Return the result modulo 1000000007
Consider the constraints provided
Round duration - 60 Minutes
Round difficulty - Medium
2 DSA problems and computer subject questions
Given an integer K
, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.
The input begins with an integer ...
Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.
Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.
Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.
Sort the generated strings in lexicographically increasing order before outputting them.
You are provided with three strings A
, B
, and C
. The task is to determine if C
is formed by interleaving A
and B
. C
is considered an interleaving of A
and B
if:
Check if a string is formed by interleaving two other strings.
Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.
Use dynamic programming to efficiently solve the problem.
Handle edge cases like empty strings or unequal lengths of A, B, and C.
Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.
Round duration - 60 Minutes
Round difficulty - Easy
DSA round
You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...
Find the intersection point of two lines on a 2D plane given their coordinates.
Calculate the slopes of both lines using the given coordinates.
Use the slope-intercept form of a line to find the equations of the two lines.
Solve the equations simultaneously to find the intersection point.
Return the coordinates of the intersection point with precision up to 6 decimal places.
Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true
. Otherwise, return false
.
The first line of input contains...
Detect cycles in a directed graph and return true if a cycle exists, false otherwise.
Use Depth First Search (DFS) to detect cycles in the directed graph.
Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.
If a vertex is visited and is present in the recursion stack, then a cycle exists.
Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.
Round duration - 30 Minutes
Round difficulty - Easy
It is a managerial round
A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.
A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.
URLs typically consist of a protocol (such as HTTP ...
Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects
Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
3 coding questions on hackerrank medium to hard
Sql round test, contains 1 query and 2 mcq
I applied via LinkedIn and was interviewed before Dec 2023. There were 4 interview rounds.
Assignment with sample data, and questions for SQL query, which had to be explained later in the interview rounds
based on 1 interview
Interview experience
Product Designer
4
salaries
| ₹17.9 L/yr - ₹36 L/yr |
Product Manager
3
salaries
| ₹13.4 L/yr - ₹17 L/yr |
Moneycontrol.com
Business Standard
livemint.com
BloombergQuint