Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Mobikwik Team. If you also belong to the team, you can get access from here

Mobikwik Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Mobikwik Software Developer Intern Interview Questions, Process, and Tips

Updated 17 May 2022

Mobikwik Software Developer Intern Interview Experiences

1 interview found

I appeared for an interview in May 2022.

Round 1 - Face to Face 

(2 Questions)

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.

  • Q1. 

    Triplets with Given Sum Problem

    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.

    Explanation:

    A t...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    K Sum Subset Problem Statement

    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.

    E...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

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.

  • Q1. 

    Diamond Pattern Grid Problem

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Mean, Median, and Mode Problem Statement

    Given an integer array ARR of size N, you need to compute the following three statistical measures:

    1. Mean: Implement the function mean() to calculate the mean o...
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Maharaja Agrasen Institute Of Technology. Eligibility criteriaNAMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Oops, Computer networks, Operating systems, projectsTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 300 Questions from leetcode
Tip 2 : Prepare your project.

Application resume tips for other job seekers

Tip 1 : Add at least 4 projects.
Tip 2 : Add your coding profiles and GPA.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Interview Preparation Tips

Round: Technical Interview
Experience: Finally, I got the offer from PayU. I was very Happy. Thanks AmbitionBox for helping me in my preparation

Skills: Algorithm, data structures
College Name: Na

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

  • Q1. 

    Zigzag Traversal of Binary Tree

    Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.

    Note:

    In zigzag order, level 1 is printed from left to right...
  • Ans. 

    Implement a function to print the zigzag traversal of a binary tree.

    • Traverse the tree level by level, alternating the direction of traversal for each level.

    • Use a queue to keep track of nodes at each level.

    • Print the nodes in zigzag order as per the given pattern.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

  • Q1. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for better efficiency

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q2. What was the use of DBMS in your project, and how did you handle the problems that arose?
  • Ans. 

    DBMS was used to store and manage data in the project, handled problems by optimizing queries and database design.

    • Used DBMS to store and manage project data efficiently

    • Optimized queries for better performance

    • Designed database schema to handle data effectively

    • Resolved concurrency issues by implementing proper locking mechanisms

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPayU interview preparation:Topics to prepare for the interview - Array ,DP ,Graph ,Recursion, Tree ,Queue,BSTTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do atleast 1 good projects
Tip 2 : Practice Atleast 300 Questions
Tip 3 : Should be able to explain your project

Application resume tips for other job seekers

Tip 1 : Always be true with the resume
Tip 2 : Do not put false things on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

  • Q1. 

    Trapping Rain Water Problem Statement

    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...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 mins
Round difficulty - Medium

At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts

  • Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
  • Ans. 

    Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.

    • Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.

    • Implement methods for getting and setting key-value pairs in the cache.

    • When a new item is added to the cache, check if it exceeds the maximum capacity. I...

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
  • Q3. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • If there are even elements, return the one that is farther from the head node

    • Handle edge cases like linked list of size 1 or empty list

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 mins
Round difficulty - Medium

It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaGood ProjectsRazorpay interview preparation:Topics to prepare for the interview - Projects, Development, NoSQL, Data Structure, OOPS, DBMS, Algorithm.Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions 
Tip 3 : Know the complexities of the code that you’ve written.

Application resume tips for other job seekers

Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. 1 - Easy Medium Question. Discuss the approach with interviewer and then implement it. The code should work, thats important.
Round 3 - Technical 

(1 Question)

  • Q1. LLD round to design Chess.
Round 4 - One-on-one 

(1 Question)

  • Q1. Hiring manager round. Grilling on resume and past experience questions

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

  • Q1. 

    Find the Third Greatest Element

    Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.

    Input:

    The first line contains a single integer 'T' representing the numb...
  • Ans. 

    Find the third largest element in an array of distinct integers.

    • Sort the array in descending order and return the element at index 2.

    • Handle cases where the array has less than 3 elements separately.

    • Use a set to store distinct elements for efficient processing.

  • Answered by AI
  • Q2. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...

  • Ans. 

    Find the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found so far

    • Return the longest palindromic substring

  • Answered by AI
  • Q3. 

    Ninja and Geometry Problem Statement

    In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...

  • Ans. 

    Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

    • Implement a function to calculate the intersection point of two lines on a 2D plane

    • Handle precision up to six decimal places in the output

    • Return -1.000000 -1.000000 if the lines do not intersect

    • Ensure the lines 'AB' and 'PQ' are distinct

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short
Tip 2 : Add skills iff you are sure

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

  • Q1. 

    Find the Third Greatest Element

    Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.

    Input:

    The first line contains a single integer 'T' representing the numb...
  • Ans. 

    Find the third largest element in an array of distinct integers.

    • Sort the array in descending order and return the element at index 2.

    • Handle cases where there are less than 3 elements in the array.

    • Consider edge cases like negative integers and duplicates.

  • Answered by AI
  • Q2. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through each character in the string and expand around it to find palindromes

    • Keep track of the longest palindrome found so far

    • Return the longest palindromic substring with the smallest start index

  • Answered by AI
  • Q3. 

    Ninja and Geometry Problem Statement

    In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...

  • Ans. 

    Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

    • Implement a function to calculate the intersection point of two lines on a 2D plane

    • Handle precision up to six decimal places in the output

    • Return -1.000000 -1.000000 if the lines do not intersect

    • Ensure the lines 'AB' and 'PQ' are distinct

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteriaAbove 7 CGPAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Hard

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

  • Q1. 

    Find the Third Greatest Element

    Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.

    Input:

    The first line contains a single integer 'T' representing the numb...
  • Ans. 

    Find the third largest element in an array of distinct integers.

    • Sort the array in descending order and return the element at index 2.

    • Handle cases where the array has less than 3 elements separately.

    • Consider using a set to ensure distinct elements in the array.

  • Answered by AI
  • Q2. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindromic substring with the smallest start index

  • Answered by AI
  • Q3. 

    Ninja and Geometry Problem Statement

    In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...

  • Ans. 

    Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

    • Use the formula for finding the intersection point of two lines in 2D space.

    • Handle precision issues that may arise due to floating-point arithmetic.

    • Return -1.000000 -1.000000 if the lines do not intersect.

    • Ensure the lines 'AB' and 'PQ' are distinct.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
 

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 50 mins
Round difficulty - Medium

First round was coding round, where i was asked 2 DS algo questions, 1 was easy and other was of medium difficulty

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) algorithm to find the shortest path.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse through the matrix.

    • Return -1 if no valid path exists.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 50 mins
Round difficulty - Easy

I was asked to design url shortner

  • Q1. Can you explain how you would design a URL shortener?
  • Ans. 

    Design a URL shortener system

    • Generate a unique short code for each URL

    • Store the mapping of short code to original URL in a database

    • Redirect users from short URL to original URL when accessed

    • Consider implementing features like custom short codes, expiration dates, and analytics

    • Ensure scalability and performance by using distributed systems and caching

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 mins
Round difficulty - Medium

This was hiring manager round

  • Q1. Can you discuss a coding problem you encountered, your past projects, and any behavioral questions related to your experiences?
  • Ans. 

    Discussed coding problem, past projects, and behavioral questions in SDE - 1 interview.

    • Coding problem: Discussed how I optimized a sorting algorithm in a previous project.

    • Past projects: Talked about a web application I developed using React and Node.js.

    • Behavioral questions: Shared how I handled a conflict within a team during a project.

    • Example: Explained how I implemented a feature in a mobile app that improved user en

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating System, DBMS, OOPSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare DS and algo well(i prepared from GFG)
Tip 2 : Must know basics of DBMS and OS
Tip 3 : Be confident and genuine

Application resume tips for other job seekers

Tip 1 : Prepare resume iteratively
Tip 2 : show ur resume to seniors and ask for suggestions

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Approached by Company and was interviewed in Sep 2022. There were 2 interview rounds.

Round 1 - Coding Test 

Find number of group of 1s in a 2D array of Os and 1s, Second question is to design a data structure which can perform crud operation.

Round 2 - Assignment 

Design a Ride sharing app, lld question, in java

Interview Preparation Tips

Interview preparation tips for other job seekers - Java specific questions, medium level DSA, LLD rounds

Tell us how to improve this page.

Team Lead
69 salaries
unlock blur

₹2.2 L/yr - ₹7 L/yr

Assistant Manager
56 salaries
unlock blur

₹4.5 L/yr - ₹12.6 L/yr

Senior Executive
55 salaries
unlock blur

₹2.7 L/yr - ₹6.7 L/yr

Software Developer
49 salaries
unlock blur

₹7.9 L/yr - ₹30.6 L/yr

Software Development Engineer II
48 salaries
unlock blur

₹11 L/yr - ₹30 L/yr

Explore more salaries
Compare Mobikwik with

Paytm

3.3
Compare

Freecharge

3.8
Compare

HighRadius

2.9
Compare

Razorpay

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview