M2P Fintech Senior IOS Developer Interview Questions and Answers

Develop a Movie SDK that will utilize a provided API to retrieve movie details.

Q1. About the current company.
Add your answer
Q2. Current and Expected CTC
Add your answer
Q3. Total Years of Experience
Add your answer
Q4. Relevant skills based on the JD
Add your answer

He really helped me by telling me the topics and a few questions which the assigned interviewer usually asks.

The interview first ask me to open LEETCODE and gave me a HARD question about STACK - related to bracket question.

He first asked me to write the Pseudo code but I started writing proper code. After a period of time, I got stuck and he gave me a small hint I solved the question then he ask me to submit the code and it submitted successfully. This one question took 40 minutes. He didn't even ask me more questions, also he was yawning and it seemed like he was not interested at all. At the end of the interview, I asked him if he will ask more questions, and he said it is fine it was a hard and lengthy question.

The next day I got the rejection mail.

Android Assignment - Create an android project for a given scenario.

Q1. Questions related to Android & Kotlin
Add your answer

Q1. Basic questions about activity lifecycle, fragments, and components.
Add your answer
Q2. Questions about Kotlin extension functions, scoping functions, sealed classes, Coroutines
Add your answer

Round duration - 180 Minutes
Round difficulty - Medium

Q1. Can you design a simple waste management app, given a mock server and some icons?
Ans. 
Tip 1 : Use retrofit
Tip 2 : follow best practices
Tip 3 : make good layouts/UI
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Basic DSA - Live coding
Happened on Sunday morning for 45 min. The interviewer is friendly.

Q1. 
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...read more
Ans. Brute Force Approach
The basic idea is to traverse the array and count the frequency of each element. 
 
We will run two nested loops till ‘N’ and store the count of each array element in ‘maxCount’. If for any element, ‘maxCount' becomes greater than ‘N’ / 2, we will return that element as the majority element. 
 
If no majority element is found, we will return -1.
Space Complexity: O(1)Explanation:
O(1)
...read more
Answered Anonymously
Add your answer
Q2. 
Find Row With Maximum 1's in a Sorted 2D Matrix
You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...read more
Ans. Brute Force
Our intuition is to traverse the given matrix row by row, and keep on counting the number of ‘1’s in each row and compare the count with max. And finally, return the index of the row with the maximum ‘1’s. This is a brute force kind of approach.
 
Just remember one thing while considering two rows have the same number of 1’s then we need to return the row with a lower index.
Space Complexity: O(1)Explanati...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Technical - Android Round

Round duration - 90 Minutes
Round difficulty - Medium

Taken by Engineering Head

Round duration - 15 Minutes
Round difficulty - Medium

Taken by VP

Q1. 1. OOPS Concepts in detail. 2. Ask question about android like android components Activity, services ,content providers and broadcast receiver. 3. Give some scenario to explain activity lifecycle and frag...read more
Add your answer

Q1. 1. Salary Expectation 2. Discuss about joining date.
Add your answer