Mobikwik Lead Engineer Interview Questions and Answers

Q1. Find connected components in a graph
Ans. 
Use Depth First Search (DFS) to find connected components in a graph
• Start by initializing all vertices as unvisited

• Iterate through each vertex and perform DFS to find connected components

• Keep track of visited vertices to avoid revisiting

• Example: For a graph with vertices {A, B, C} and edges {(A, B), (B, C)}, the connected components are {A, B, C}
Answered by AI
Add your answer

Q1. Design chess game
Ans. 
Design a chess game with proper board setup, piece movements, and win conditions.
• Create a 8x8 grid to represent the chess board

• Assign initial positions to each type of chess piece (pawn, rook, knight, bishop, queen, king)

• Implement rules for each piece's movement (e.g. pawn moves forward, rook moves horizontally/vertically)

• Check for valid moves and capture opponent's pieces

• Implement win conditions (checkmate, stalemate)

• ...read more
Answered by AI
Add your answer

Leetcode medium and hard

zigzag traversal of BT
merge K sorted Linked List

Q1. Focussed mainly on Java, Spring and HLD
Add your answer

Q1. LLD of booking system, designing a thread safe array blocking queue
Add your answer

Q1. Normal salary discussion
Add your answer

Q1. DSA round containing 2 coding questions along with some Java Questions
Add your answer

Q1. Design Round along with some puzzles
Add your answer

Q1. Managerial Round
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Contained mix of coding, oops and general programming questions

Coding was live coding round
It was around 12pm
They used their own coding environment, I coded in java

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Ans. 
Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.
• Iterate through the array and keep track of the maximum sum subarray seen so far.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Consider the case where all elements in the array are negative.

• Handle the case where the array contains only one element.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

It was a collection of HLD AND LLD
Was around 12pm
This was conducted on bluejeans

Q1. Design a URL shortener with a database and all necessary components.
Ans. 
Design a URL shortener with database and necessary components
• Use a unique identifier for each URL to generate short links

• Store the original URL and corresponding short link in a database

• Implement a redirect mechanism to redirect short links to original URLs

• Consider implementing analytics to track usage and performance

• Ensure scalability and reliability of the system
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was a friendly managerial round with director of my team, he was very for me to come on board and explained truthfully how payu is.

Round duration - 30 Minutes
Round difficulty - Easy

Just a normal HR discussion, he informed me that I've been selected and we discussed about the salary part

Q1. Can you describe your experience working in a corporate environment?
Add your answer

Q1. Technical questions
Add your answer

Q1. Technical Questions
Add your answer

Q1. Salary Discussion
Add your answer