Mobikwik Operations Executive Interview Questions and Answers

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...read more
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
Add your answer

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...read more
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
Add your answer
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
Add your answer

Q1. Tell me about your self
Add your answer
Q2. About your past experience
Add your answer
Q3. Check your confidence level
Add your answer
Q4. General question
Add your answer

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...read more
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
Add your answer
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...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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
Add your answer
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...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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
View 1 more answer
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...read more
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
Add your answer
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...read more
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
Add your answer