i
Mobikwik
Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2024. There were 3 interview rounds.
Delegate pattern is a design pattern in which an object delegates some of its responsibilities to another object.
Create a protocol defining the methods that the delegate should implement
Declare a delegate property in the delegating class
Set the delegate property to the object that will act as the delegate
Call the delegate methods from the delegating class
There are designated initializers in Swift that have specific behaviors, such as convenience init and required init.
Designated initializers are primary initializers for a class and must call a designated initializer from its superclass.
Convenience initializers are secondary initializers that must call another initializer in the same class.
Required initializers must be implemented by all subclasses of a class.
The bridge between SwiftUI and UIKit is represented by the UIViewRepresentable and UIViewControllerRepresentable protocols.
UIViewRepresentable and UIViewControllerRepresentable protocols allow SwiftUI views to interact with UIKit views and controllers respectively.
UIViewRepresentable is used to wrap a UIKit view and make it available to SwiftUI.
UIViewControllerRepresentable is used to wrap a UIKit view controller and m...
Flickr photo app with custom animation
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
Sort array of cards in red, blue, green colors.
Use a custom sorting function to sort the array based on color order.
Assign a numerical value to each color (e.g. red: 0, blue: 1, green: 2) and sort based on these values.
Implement a sorting algorithm like bubble sort or quicksort to rearrange the array based on color order.
I applied via Job Portal and was interviewed in Dec 2024. There was 1 interview round.
Search for target element in a rotated sorted array.
Use binary search to find the pivot point where rotation happens.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the target element is on the left or right side of the pivot.
I appeared for an interview in Apr 2021.
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.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
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.
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...
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
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...
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
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short
Tip 2 : Add skills iff you are sure
I appeared for an interview in Apr 2021.
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.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
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.
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...
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
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...
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
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
I appeared for an interview in Apr 2021.
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.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
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.
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...
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
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...
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.
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
I appeared for an interview in May 2022.
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
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...
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.
Round duration - 50 mins
Round difficulty - Easy
I was asked to design url shortner
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
Round duration - 50 mins
Round difficulty - Medium
This was hiring manager round
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
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
Tip 1 : Prepare resume iteratively
Tip 2 : show ur resume to seniors and ask for suggestions
I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.
Mcqs based on cs fundamentals and 2_3 coding questions
Merge two sorted linked lists into one.
Create a new linked list to store the merged list.
Compare the values of the nodes from both lists and add the smaller value to the new list.
Move the pointer of the list with the smaller value to the next node.
Repeat the comparison and addition until one of the lists is empty.
Add the remaining nodes from the non-empty list to the new list.
Return the new merged list.
I applied via Campus Placement and was interviewed in Oct 2023. There were 4 interview rounds.
Basic mathematics and analytical thinking questions
Basic programming questions
based on 1 interview
Interview experience
Team Lead
69
salaries
| ₹2.2 L/yr - ₹7 L/yr |
Assistant Manager
56
salaries
| ₹4.5 L/yr - ₹12.6 L/yr |
Senior Executive
55
salaries
| ₹2.7 L/yr - ₹6.7 L/yr |
Software Developer
49
salaries
| ₹7.9 L/yr - ₹30.6 L/yr |
Software Development Engineer II
48
salaries
| ₹11 L/yr - ₹30 L/yr |
Paytm
Freecharge
HighRadius
Razorpay