Filter interviews by
I appeared for an interview in Jul 2024.
One 2D array traversal question
One DFS question
MongoDB is used instead of MySQL for its flexibility, scalability, and ability to handle unstructured data.
MongoDB is a NoSQL database, making it more flexible for handling unstructured data compared to the structured data model of MySQL.
MongoDB is schema-less, allowing for easier scalability and changes to the data structure without downtime.
MongoDB is designed for horizontal scalability, making it suitable for applic...
I appeared for an interview in Jul 2024.
Implement a small feature in steps.
I applied via Campus Placement and was interviewed in Oct 2023. There were 3 interview rounds.
2 hour coding rounding with 3 question 2 question were on trees medium level one question of graph hard level.
I appeared for an interview 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.
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
3 Moderate questions were asked. I managed to solve 2 completely and 1 partially.
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Basic coding only not to worry much
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Excellent team player with good communication skills
I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.
Developed a web-based inventory management system using React and Node.js
Created a mobile app for tracking fitness goals using Flutter
Implemented RESTful APIs for communication between frontend and backend systems
Sorting of an array and aptitude
Majorily on SQL and Databases
Use CSS to align two images with same width and height on a page
Set both images to have the same width and height using CSS
Use flexbox or grid layout to align the images horizontally or vertically
Adjust margins or padding to fine-tune the alignment
I applied via Campus Placement
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
There were 2 questions.
1. Knapsack
2. Median in an array
based on 3 interviews
1 Interview rounds
based on 1 review
Rating in categories
Customer Support Specialist
41
salaries
| ₹8 L/yr - ₹13 L/yr |
Software Engineer
38
salaries
| ₹26 L/yr - ₹76 L/yr |
Senior Software Engineer
18
salaries
| ₹38 L/yr - ₹81.5 L/yr |
Software Engineer2
13
salaries
| ₹36 L/yr - ₹50 L/yr |
Customer Support Executive
13
salaries
| ₹9.3 L/yr - ₹12 L/yr |
Udaan
Swiggy
CARS24
BlackBuck