Filter interviews by
I applied via LinkedIn and was interviewed in Aug 2024. There were 3 interview rounds.
It was an online assessment. Some coding questions. Some cs fundamental mcqs. SQL query, Rest Api question.
An assignment to create a game using nodejs/ go lang/ java.
I applied via Approached by Company and was interviewed in Aug 2023. There was 1 interview round.
RecyclerView is a flexible view for providing a limited window into a large data set.
RecyclerView recycles views to improve performance and memory usage.
It uses LayoutManager to organize items in a grid, list, or staggered grid layout.
Adapter provides data to be displayed in RecyclerView.
ItemDecoration can be used to add spacing between items or decorations to items.
ItemAnimator can be used to animate item changes in t
Top trending discussions
posted on 20 Aug 2023
I applied via Referral and was interviewed in Jul 2023. There were 4 interview rounds.
Aptitude Question on various standard topics .
Stacks are used in real life for managing undo operations in text editors, backtracking in maze solving, and managing function calls in programming.
Undo operations in text editors - allows users to go back to previous states of a document
Backtracking in maze solving - helps in keeping track of visited paths and backtracking when necessary
Managing function calls in programming - helps in keeping track of function calls
i++ and ++i are both increment operators in C++ but have different behaviors.
i++ is a post-increment operator which increments the value of i after using it in an expression.
++i is a pre-increment operator which increments the value of i before using it in an expression.
Example: int i = 5; int a = i++; // a = 5, i = 6; int b = ++i; // b = 7, i = 7;
I was interviewed in Jun 2022.
I was interviewed in Mar 2022.
AI
C#
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
Insert a node in a Binary Search Tree (BST)
Start at the root node and compare the value of the node to be inserted with the current node
If the value is less than the current node, move to the left child. If greater, move to the right child
Repeat the process until reaching a leaf node, then insert the new node as a left or right child
Design a lift system for efficient vertical transportation
Consider the number of floors in the building
Include safety features like emergency stop button
Optimize for speed and energy efficiency
Implement a user-friendly interface for passengers
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
I applied via Approached by Company and was interviewed in Apr 2022. There were 2 interview rounds.
Given an array of digits, find the largest multiple of 3 that can be formed from the digits.
Sort the array in descending order.
If the sum of digits is divisible by 3, return the array as a string.
If the sum of digits modulo 3 is 1, remove the smallest digit that has a remainder of 1 when divided by 3, or the two smallest digits that have a remainder of 2 when divided by 3.
If the sum of digits modulo 3 is 2, remove the ...
I applied via Approached by Company and was interviewed before Jan 2023. There were 3 interview rounds.
Design and code a parking lot application
To ensure no data corruption during asynchronous streaming and processing, use data validation, error handling, and checksums.
Implement data validation techniques to check the integrity of the streamed data.
Handle errors and exceptions properly to prevent data corruption.
Use checksums or hash functions to verify the integrity of the data.
Implement reliable communication protocols like TCP/IP to ensure data integrity.
Co...
I was interviewed before May 2021.
Round duration - 150 Minutes
Round difficulty - Medium
3 coding questions and 20 mcq's
Given an integer array ARR
and a positive integer K
, your task is to determine two non-overlapping subarrays of length K
that yield the maximum combined sum.
The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.
Iterate through the array and calculate the sum of each subarray of length K
Store the maximum sum obtained from the first subarray
Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray
Store the maximum sum obtained from the second subarray
Return the sum of the two maximum
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
The task is to find the count of distinct subsequences in a given string.
Use dynamic programming to solve the problem.
Create a 2D array to store the count of distinct subsequences for each prefix of the string.
Initialize the first row of the array with 1, as there is only one subsequence of an empty string.
For each character in the string, calculate the count of distinct subsequences by considering two cases: including...
Given two integer arrays/ lists ARR1
and ARR2
of sizes N
and M
respectively, you are required to determine their intersection. An intersection is defined as the set of...
The task is to find the intersection of two integer arrays/lists.
Read the number of test cases
For each test case, read the size and elements of the first array/list
Read the size and elements of the second array/list
Find the intersection of the two arrays/lists
Print the intersection elements in the order they appear in the first array/list
Round duration - 120 Minutes
Round difficulty - Medium
Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...
The task is to find the number of islands in a grid consisting of 0s and 1s.
An island is a group of 1s connected horizontally, vertically, or diagonally
The grid is surrounded by 0s on all four edges
Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands
Initialize a visited array to keep track of visited cells
For each unvisited cell with a value of 1, p...
Determine the number of permutations of list A
= [1, 2, ..., N] such that for every index i
, either A[i]
is divisible by i
or i
is divisible by A[i]
.
The input start...
The goal is to find the number of permutations of a list satisfying certain conditions.
Iterate through all permutations of the list
Check if each permutation satisfies the given conditions
Count the number of permutations that satisfy the conditions
Return the count for each test case
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
The first line cont...
An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.
Check if the given matrix satisfies the property M*M = M
Iterate through each element of the matrix and perform the matrix multiplication
Compare the result with the original matrix
If they are equal, return true; otherwise, return false
Round duration - 120 Minutes
Round difficulty - Easy
This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.
Design attendance management system
Create a database to store employee information
Implement a user interface for employees to mark their attendance
Develop a system to track and record attendance data
Generate reports and analytics based on attendance data
Round duration - 20 Minutes
Round difficulty - Easy
This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.
Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.
Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.
Some of the top questions asked at the Swiggy Associate Software Engineer interview -
based on 2 interviews
Interview experience
Delivery Boy
873
salaries
| ₹0.4 L/yr - ₹5 L/yr |
Fleet Manager
583
salaries
| ₹2.5 L/yr - ₹5.6 L/yr |
Sales Manager
526
salaries
| ₹2.4 L/yr - ₹9 L/yr |
Assistant Manager
498
salaries
| ₹3 L/yr - ₹13.5 L/yr |
Assistant Store Manager
441
salaries
| ₹1.7 L/yr - ₹4.2 L/yr |
Zomato
Dunzo
FoodPanda
Rapido