Filter interviews by
Top trending discussions
I applied via Walk-in and was interviewed in Aug 2022. There were 5 interview rounds.
Verbal and written language test.
posted on 13 Nov 2022
posted on 10 Jun 2022
I applied via Referral and was interviewed in Dec 2022. There were 2 interview rounds.
I have over 5 years of experience in banking operations, including managing daily transactions, reconciliations, and customer inquiries.
Managed daily transactions and ensured accuracy
Performed reconciliations to identify discrepancies
Handled customer inquiries and resolved issues promptly
I applied via LinkedIn and was interviewed in May 2022. There were 3 interview rounds.
I was interviewed in Mar 2022.
Round duration - 90 minutes
Round difficulty - Medium
Only Java allowed
Given an integer array ARR
of size N
containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...
Keep two index variables and traverse from the end.
Round duration - 60 minutes
Round difficulty - Easy
Basic intro and coding questions
An integer N
is provided, and the task is to determine if N
is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.
Two nested for loops and check if sum equal to given number
Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.
ARR = [5, 3, 8,...
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
Here is the algorithm :
Round duration - 60 minutes
Round difficulty - Medium
More difficult than the previous round
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...
Do a level order traversal and update a hashmap based on horizontal distances from the root.
Round duration - 70 minutes
Round difficulty - Medium
There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.
Tip 1 : Have a basic understanding of recycler view
Tip 2 : Recycler with multiple view types
Tip 1 : Basic flow and lifecycle of activities and fragments.
Tip 2 : Knowledge about launch modes and view models.
Round duration - 30 minutes
Round difficulty - Easy
HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.
Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions
Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)
posted on 1 Jun 2022
I applied via Campus Placement and was interviewed in Dec 2021. There were 5 interview rounds.
posted on 22 Apr 2022
I applied via Naukri.com and was interviewed in May 2022. There was 1 interview round.
To solve construction problems, quality, safety, progress, and time schedule, a project manager should prioritize communication, risk management, and continuous improvement.
Establish clear communication channels with all stakeholders
Identify potential risks and develop contingency plans
Regularly review and improve quality control processes
Ensure compliance with safety regulations and provide training to workers
Monitor
I applied via Referral and was interviewed in Nov 2021. There were 3 interview rounds.
Assistant Manager
4
salaries
| ₹5.7 L/yr - ₹6.1 L/yr |
Executive
4
salaries
| ₹2.3 L/yr - ₹4.5 L/yr |
Business Development Head
4
salaries
| ₹7.3 L/yr - ₹9 L/yr |
Operations Executive
3
salaries
| ₹9.6 L/yr - ₹10 L/yr |
Senior Executive
3
salaries
| ₹4 L/yr - ₹4.5 L/yr |
Chegg
Airtel Payments Bank
Edubridge Learning
Knorr-Bremse