i
Mobikwik
Filter interviews by
I applied via Approached by Company and was interviewed before Sep 2023. There was 1 interview round.
I was interviewed in May 2022.
Round duration - 60 Minutes
Round difficulty - Medium
This round was scheduled with the SDE-2, we started with the introduction than he jumped to the dsa questions. First question he asked me was leetcode 3 sum problem, we discussed the approach than I wrote the code for that problem. Second question was of arrays and maps I didn't remember the exact question but that was also some modified version of k sum subarray. Than he asked many questions related to oops, I answered most of them than he asked me for any qiuestions and we dropped the call.
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
The task is to find all distinct triplets in an array that sum up to a specified number.
Iterate through all possible triplets using three nested loops.
Check if the sum of the triplet equals the target sum.
Print the triplet if found, else print -1.
You are provided with an array arr
of size N
and an integer K
. Your objective is to compute the maximum sum of a subset of the array such that this sum does not exceed K
.
Find the maximum sum of a subset of an array that does not exceed a given value K.
Sort the array in descending order to maximize the sum.
Iterate through the array and add elements to the sum until it exceeds K.
Return the sum obtained before exceeding K.
Round duration - 40 Minutes
Round difficulty - Medium
This round was arranged with the Engineering Manager, we started with the introduction then he asked me to explain my project, I did that. After that he asked me one pattern question, I coded that than he asked me one more array question of finding mean, mode, median, I partially solved that question. Than he asked me for any questions and we dropped the call.
Create a grid pattern of size R rows and C columns, where each cell contains a diamond-like shape of size S. The diamond shape is made with characters ‘/’ and ‘\’ for the bord...
Create a grid pattern with diamond shapes of given size in each cell.
Iterate through each cell in the grid and construct the diamond shape based on the size provided.
Use 'e' for the outer space, '/' and '' for the borders, 'o' for the inner space of the diamond.
Adjust the positioning of characters based on the size of the diamond to create the desired pattern.
Given an integer array ARR
of size N
, you need to compute the following three statistical measures:
mean()
to calculate the mean o...Implement functions to calculate mean, median, and mode of an integer array.
Calculate mean by summing all elements and dividing by total count
Calculate median by sorting array and finding middle element(s)
Calculate mode by finding element with highest frequency, return smallest if multiple
Tip 1 : Practice at least 300 Questions from leetcode
Tip 2 : Prepare your project.
Tip 1 : Add at least 4 projects.
Tip 2 : Add your coding profiles and GPA.
I applied via Naukri.com and was interviewed before Oct 2022. There were 2 interview rounds.
Mobikwik interview questions for popular designations
I applied via LinkedIn and was interviewed before Jun 2022. There were 4 interview rounds.
Get interview-ready with Top Mobikwik Interview Questions
I applied via Walk-in and was interviewed in Mar 2022. There was 1 interview round.
I applied via Naukri.com and was interviewed before Sep 2022. There were 2 interview rounds.
I was interviewed in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.
Given a string S
of length N
and an integer K
, find the length of the longest substring that contains at most K
distinct characters.
The first...
Find the length of the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts within the window.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum window size encountered for each test case.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Find the number with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one that appears first.
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
Check if the x-coordinate is even or odd by using bitwise AND operation with 1.
Return 1 if x-coordinate is even, else return 0.
Handle multiple test cases by iterating through each input.
Round duration - 60 minutes
Round difficulty - Easy
I was asked a coding question then, a system design question and some basic operating systems and oops questions
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store seen elements.
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
Develop a web crawler to discover and retrieve web pages.
Implement an indexing system to store and organize the content of web pages.
Design a ranking algorithm to determine the relevance of search results.
Include features like autocomplete, spell check, and personalized search results.
Optimize for speed and scalabil...
Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms
Tip 1 : Mention your projects
Tip 2 : Mention your internships
I applied via Referral and was interviewed before Nov 2021. There were 4 interview rounds.
To exploit/test for vulnerabilities, use penetration testing tools and techniques to simulate attacks and identify weaknesses.
Use vulnerability scanners to identify potential vulnerabilities
Conduct penetration testing to simulate attacks and identify weaknesses
Perform social engineering tests to assess human vulnerabilities
Use fuzzing techniques to identify software vulnerabilities
Conduct code reviews to identify poten...
SSRF is an attack that allows an attacker to send a crafted request from a vulnerable web application. CSRF is an attack that tricks a victim into performing an action on a website without their knowledge or consent.
SSRF stands for Server-Side Request Forgery while CSRF stands for Cross-Site Request Forgery.
SSRF allows an attacker to send a request from a vulnerable server to a third-party server while CSRF tricks a vi...
I applied via Naukri.com and was interviewed in Apr 2021. There were 3 interview rounds.
Top trending discussions
The duration of Mobikwik interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 59 interviews
Interview experience
based on 362 reviews
Rating in categories
Team Lead
68
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
Freecharge
PhonePe
Payed