Mr Cooper Interview Questions, Process, and Tips

SQL coding and Ssis technical skills

Q1. SQL server Database concepts
Add your answer

Q1. Tell me about yourself
Ans. 
I am a software developer with 5 years of experience in developing web applications using Java and JavaScript.
• 5 years of experience in software development

• Proficient in Java and JavaScript

• Developed web applications using Java and JavaScript
Answered by AI
Add your answer
Q2. What do you know about our company
Ans. 
Our company is a leading software development firm specializing in creating innovative solutions for various industries.
• Established in 2005

• Headquartered in Silicon Valley

• Known for developing cutting-edge mobile applications

• Clients include Fortune 500 companies

• Received multiple industry awards for excellence in software development
Answered by AI
Add your answer

Q1. In this they will give 45 mins to solve a problem
Add your answer

Q1. Why are you looking for a change?
Add your answer
Q2. Where do you see yourself in 5 years?
Add your answer
Q3. Tell me about yourself.
Add your answer

Grammar, Arithmetic and Logical reasoning

Q1. Tell me about yourself
Add your answer
Q2. About the company and Mortgage
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The round consisted of 3 coding Questions and 20 Technical MCQs.

Q1. 
Connect Ropes Problem Statement
Given a number of ropes denoted as 'N' and an array containing the lengths of these ropes, your task is to connect the ropes into one single rope. The cost to connect two r...read more
Ans. Greedy approach
When closely observed, it can be seen that the ropes which are connected first add up to the total cost more number of times than the ones which are connected later. So, to reduce this cost, that is being added again and again, shorter ropes are connected first moving on to longer ones.

 
Below is the algorithm :

 
1. Sort the 'LENGTH' array.
2. Pick the first two elements of the 'LENGTH' array, remove th...read more
Answered Anonymously
Add your answer
Q2. 
Idempotent Matrix Verification
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
Input:
The first line cont...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q3. 
Sum of LCM Problem Statement
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:
LCM(1, N) + LCM(2, N) + ....read more
Ans. Brute force approach
 
Using the mathematical formula, A*B = LCM(A,B) * GCD(A,B) where ‘A’ and ‘B’ are the two integers, and GCD(A,B) denotes the Greatest common divisor of ‘A’ and ‘B’.
For example, suppose 
 
A = 20 and B = 30
Factors of A = {1,2,4,5,10,20}
Factors of B = {1,2,3,5,6,10,15,30}
 
The greatest common factor is 10, hence GCD(20,30) = 10.
 
So LCM(A,B) = A*B / GCD(A,B)
 
All we need to fin...read more
Answered Anonymously
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

This round is a Long Coding Round. Every Candidate was assigned with a mentor who guides them, We were given a real-life scenario for which we have to construct a database with required tables. We should draw an ER Diagram to demonstrate the Database. After the Database Completion, We have to Start Coding the Application. The Design(like Placing the button or background colour) is not given much importance. They mainly test the practical knowledge of candidates in OOPS and expertise in a C, C++, Java, Android or any other language were OOPS Concepts can be applied.

Round duration - 180 Minutes
Round difficulty - Medium

This Round is a technical Interview. I was asked Questions to test my Technical Knowledge.

Q1. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. Sorting
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
• Sort the Array and just return.
Space Complexity: O(1)Explanation:
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:
O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Answered Anonymously
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy