i
DeHaat
Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed before Feb 2023. There was 1 interview round.
Top trending discussions
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
I applied via Campus Placement
I appeared for an interview in Apr 2024.
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 Aug 2024. There were 2 interview rounds.
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 appeared for an interview in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
You are provided with two nodes,...
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
Round duration - 50 Minutes
Round difficulty - Easy
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
based on 1 interview
Interview experience
Assistant Manager
126
salaries
| ₹2.7 L/yr - ₹10.1 L/yr |
Senior Executive
58
salaries
| ₹3.4 L/yr - ₹6.6 L/yr |
Manager
44
salaries
| ₹7 L/yr - ₹16 L/yr |
Sales Executive
40
salaries
| ₹2.5 L/yr - ₹4.8 L/yr |
Executive
31
salaries
| ₹2.5 L/yr - ₹5.3 L/yr |
Ninjacart
Crofarm
Agrostar
BIGHAAT AGRO