i
ConveGenius
Filter interviews by
I applied via Referral and was interviewed in Aug 2023. There was 1 interview round.
Top trending discussions
I appeared for an interview in Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
3 coding Questions:
1st : Easy question based on simple loop iteration
2nd :Medium level Dp question
3rd : Medium level tree question(where we were not just required to complete the tree function but to build whole bst from
scratch)
It was conducted from 1:30 - 3:00 pm.
The coding platform was very good (as auto indentation and auto completion of brackets were there)
having camera on.
You are given the stock prices for N
days. Each day i
signifies the price of a stock on that day. Your goal is to calculate the maximum profit that can be achieved by buyin...
Calculate maximum profit by buying and selling stocks on different days.
Iterate through the stock prices and buy on the day when the price is lower than the next day's price, and sell on the day when the price is higher than the next day's price.
Keep track of the total profit earned by summing up the differences between buying and selling prices.
Return the total profit as the maximum profit that can be earned.
You are given a binary tree with 'N' unique nodes, and a specific start node from where the fire will begin. The task is to determine the time in minute...
The task is to determine the time in minutes required to burn the entire binary tree starting from a given node.
Traverse the tree from the given start node to calculate the time taken to burn the entire tree.
Use a queue to keep track of nodes and their burning time.
Increment the burning time for each level of nodes until the entire tree is burned.
Round duration - 75-80 minutes
Round difficulty - Hard
This was a completely technical coding round where I was asked to solve the problems of data structures.
The codepad where i was asked to code was fine,
The interviewer was very friendly and was helpful and understanding.
I also asked him about his work and experience in the company and some other questions.
Given an N*M matrix filled with integer numbers, your task is to find the maximum path sum starting from any cell in the first row and ending at any cell in the last row. Y...
Round duration - 45 minutes
Round difficulty - Easy
It was held on Gmeet platform
The interviewer was very experienced person and was very nice too.
He made me comfortable by first introducing himself in a very detailed way and then asking me mine introduction
Since I feel that his internet connection was not very good so he turned off his camera but I decided not to turn off mine as in online interviews your face reviles your confidence
the interviewer mostly asked me questions about my interests in technical field and the project that I have done
Tip 1 : Practice atleast(easy and medium questions from leetcode under(Top Interview Questions)) and all the questions from Gfg under(must to do coding questions for interviews))
Tip 2 : Don't learn each and every question you solved but try to solve question in a way that you can solve its variation during interviews
Tip 3 : Do one project(one is enough) which you can explain with full technical details (why you used this technology, and all logics you applied in implementation)
Tip 4: Atleast read the round 1 (Coding round) Archives from (Geeks for geeks or Glassdoor). To get your mind prepared for the types of questions that company usually asks.(Coding round is the toughest Step in the whole Process to clear)
Tip 1: Have at least one project which you have made yourself and you should know all the technical questions related to that project (I feel project domain hardly matters like web development or android or ML/AI)
Tip 2: You should Put only those skills in resume :
1. Which the company requires (eg if you know company doesn't require Networking domain knowledge so
don't include it unnecessary if you are not much confident in it)
2. For on campus internships resume shortlisting is very easy so don't add anything unnecessary which might
cause you pain during interview.
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.
posted on 26 Sep 2024
I am a software developer with 5 years of experience in Java and Python. I have a passion for problem-solving and creating innovative solutions.
5 years of experience in Java and Python
Passionate about problem-solving
Innovative solutions driven
In 5 years, I see myself as a senior software developer leading a team and working on cutting-edge technologies.
Leading a team of developers on innovative projects
Working with cutting-edge technologies like AI and blockchain
Continuing to learn and grow in my career
Possibly pursuing further education or certifications
Contributing to open source projects
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
Basic JavaScript Interview
Closure is a function that has access to its own scope, as well as the outer scope in which it was defined.
Closure allows a function to access variables from its outer scope even after the outer function has finished executing.
It is created whenever a function is defined within another function.
Closure is commonly used in JavaScript for maintaining state in asynchronous operations.
Promises are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in JavaScript.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained together using .then() method.
They help avoid callback hell and make code more readable.
Example: Fetching data from an API returns a promise that resolves with the da
I appeared for an interview in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Timing was 3PM to 5 PM
There were 4 coding questions based on Dynamic Programming , Graphs, Mathematical analysis , Trie data structure.
You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...
The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with start time, end time, and profit given.
Sort the jobs based on their end times in ascending order.
Initialize an array 'dp' to store the maximum profit that can be earned by scheduling jobs up to that index.
For each job, find the maximum profit by either including or excluding the current job based on non-overlapping co...
Round duration - 60 Minutes
Round difficulty - Easy
The interviewer was very soft spoken and helpful. There were in total 3 questions of easy-medium difficulty based on DP, Graphs and Sorting . It was around 11 AM timing.
Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...
Calculate the probability that a knight remains on an N x N chessboard after making K moves.
Use dynamic programming to calculate the probability of the knight staying on the board after each move.
Consider all possible moves the knight can make from its current position.
Keep track of the probabilities at each position on the board after each move.
Normalize the probabilities at the end to get the final result.
Example: Fo...
Round duration - 60 Minutes
Round difficulty - Medium
The round had 1 DS and Algo problem and 1 system Design question based on building any management portal.
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.
Create a mapping of each cell to its corresponding destination cell if it contains a snake or ladder.
Keep track of visited cells to avoid revisiting them during the traversal.
Consider the constraints and handle cases where t...
Round duration - 30 Minutes
Round difficulty - Easy
It was more of Hiring Manager round where he asked about my skills , my projects and how could i be valuable to firm. It was quit easy going round
Tip 1 : Always focus on the basics of the Data Structures
Tip 2 : Practice System Design very well
Tip 3 : Take Practice Contests on weekly basis for time constraints
Tip 1 : Mention atleast 2 projects with thorough knowledge
Tip 2 : Keep the Resume one page only with no false information
I appeared for an interview in Jun 2022.
Round duration - 60 Minutes
Round difficulty - Medium
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...
Determine the maximum profit achievable with at most K transactions by buying and selling stocks.
Iterate through the array and keep track of the minimum price to buy and maximum profit to sell.
Use dynamic programming to calculate the maximum profit with at most K transactions.
Consider edge cases like when K is 0 or when the array is empty.
Example: For input N = 6, PRICES = [3, 2, 6, 5, 0, 3], K = 2, the output should b
Given a matrix ARR
with dimensions N
x M
, your task is to identify the rectangle within the matrix that has the maximum sum of its elements.
The first line...
Find the rectangle with the maximum sum of elements in a given matrix.
Iterate through all possible rectangles in the matrix and calculate the sum of each rectangle.
Keep track of the maximum sum encountered so far.
Optimize the solution by using Kadane's algorithm for 1D array to find maximum sum subarray in each row.
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.
Keep track of visited cells and the number of dice throws required to reach each cell.
Consider the presence of snakes and ladders while calculating the next possible moves.
Return the minimum number of dice throws to reach th
Round duration - 70 Minutes
Round difficulty - Medium
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...
Find the length of the longest increasing path in a 2D matrix by moving in four directions from each cell.
Use dynamic programming to keep track of the length of the longest increasing path starting from each cell.
Explore all four directions from each cell and recursively find the longest increasing path.
Optimize the solution by storing the length of the longest increasing path starting from each cell to avoid redundant
Round duration - 45 Minutes
Round difficulty - Medium
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Based on the pivot point, apply binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
Tip 1 : Practice as many questions as possible from any of the good coding platform.
Tip 2 : Core CS fundamentals should be strong and can't be neglected before interview.
Tip 3 : Some hands-on dev projects are really good to have as companies nowadays(mostly startups) look some good hands-on experience even in freshers.
Tip 1 : Should be single page, to the point and precise resume.
Tip 2 : Only put truth on the resume.
It was a coding test with 3 medium-hard questions
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 1 interview
Interview experience
Software Engineer
7
salaries
| ₹12 L/yr - ₹18 L/yr |
Program Manager
7
salaries
| ₹8 L/yr - ₹11.2 L/yr |
Data Analyst
7
salaries
| ₹5.5 L/yr - ₹9 L/yr |
Associate Product Manager
6
salaries
| ₹9 L/yr - ₹11.5 L/yr |
Manager
5
salaries
| ₹13.1 L/yr - ₹25 L/yr |
Udaan
Swiggy
CARS24
Oyo Rooms