Filter interviews by
I applied via Referral
Top trending discussions
I applied via Campus Placement
Very basic aptitude test. basic aptitude mcqs are there
There was one assignment given on talent acquisition topic.
I applied via Walk-in and was interviewed before Jan 2020. There was 1 interview round.
I applied via Referral and was interviewed in Dec 2021. There was 1 interview round.
A cross cheque is a type of cheque that has two parallel lines drawn across its face, indicating that it can only be deposited into the bank account of the payee.
A cross cheque is a safer form of payment as it cannot be cashed by anyone other than the intended recipient.
The two parallel lines on a cross cheque can be either general or special crosses.
A general cross cheque can only be deposited into a bank account, whi...
posted on 11 Oct 2021
I was interviewed in May 2021.
Round duration - 90 Minutes
Round difficulty - Hard
Test Description/Instruction as Mentioned on the portal and mail :
1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
The image is represented as a 2D array of positive integers
The starting pixel and new color are given
Adjacent pixels are connected in up, down, left, or right directions
Diagonal pixels are not considered adjacent
Implement the Flood Fill Algorithm to replace the color of the given pixel and it...
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
Implement Kruskal's algorithm to find the minimum spanning tree
Use a disjoint set data structure to keep track of connected components
Sort the edges in non-decreasing order of their weights
Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle
Return the sum of weigh
Merge Sort Algorithm -
Merge sor...
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.
Then it merges the two sorted halves to produce a single sorted array.
The time complexity of merge sort is O(n log n), where n is the size of the input array.
The algorithm is efficient ...
Tip 1 : Practice Atleast 300 Questions on leetcode (150 easy, 100 medium and 50 hard )
Tip 2 : Make atleast one big project which includes (DB, backend and frontend). Because in Hiring Manager round we have to discuss our resume for about 45mins to 1 Hr so having 1 or 2 big projects on the resume is always good to have otherwise HM will go towards core subjects Like OOP/OS/Networks which are often tricky.
Tip 3 : Think out of the box while solving a Question think of all the variants in which this questions can be asked. Let's take an example of simple question like two sum here we have to find a pair in an array whose sum is equal to given value. Now what if Interviewer asked to find three numbers instead of 2 or maybe find k numbers whose sum is equal to a given number. So it is always good to think out of the box and generalise the solution.
Tip 4 : Always try to solve each question in different ways. You should know both the bruteforce solution and the optimal one.
Tip 5 : When you solve a Question try to learn as much possible from a single Question for eg if you try to solve a Tree question then it is good to know both the iterative and recursive solution as sometimes Interviewer may introduce some constraints that due to huge test case recursive solution is not possible.
Tip 6 : 3-4 days before the interview start preparing using interviewbit as it contains all the important questions topic wise. I usually solve Interviewbit before the interview. No doubt Leetcode is good in terms of UI, Test cases and Easy to use but Interviewbit is more organised. I myself have done all the Interviewbit Questions multiple times.
Tip 1 : Try to add Experience at the top with detailed explanation of work done by you
Tip 2 : If No Experience: try to add more and more personal projects with the skills required in JD
Tip 3 : If No projects and Experience: Try to add Coding profiles, Achievements (Hackathons and Coding Competitions )
posted on 24 Nov 2021
I applied via Instahyre and was interviewed in Oct 2021. There were 3 interview rounds.
Count occurrences of given element in a sorted array.
Use binary search to find the first and last occurrence of the element.
Subtract the indices to get the count of occurrences.
Handle edge cases like element not present in array.
Given a binary tree, find the path with the largest sum of node values.
Use depth-first search to traverse the tree and keep track of the current path sum.
At each node, compare the current path sum with the maximum path sum seen so far.
Return the path with the maximum sum.
If the tree is empty, return an empty path.
I applied via Company Website and was interviewed in Aug 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2021. There were 3 interview rounds.
Udaan
Swiggy
CARS24
BlackBuck