
Mr Cooper


Mr Cooper Interview Questions and Answers for Freshers
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 ropes i...read more
The task is to find the minimum cost required to connect all the ropes by summing their lengths.
Iterate through the ropes and connect the two shortest ropes at each step to minimize cost
Use a priority queue to efficiently find the shortest ropes
Keep track of the total cost as you connect the ropes
Example: For input [4, 3, 2, 6], connect 2 and 3 (cost 5), then connect 4 and 5 (cost 9), then connect 9 and 6 (cost 15) for a total cost of 29
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 contains a si...read more
Check if a given matrix is idempotent by verifying if M * M = M.
Iterate through the matrix and multiply it with itself to check if it equals the original matrix.
If the condition M * M = M is satisfied, then the matrix is idempotent.
If the condition is not satisfied, then the matrix is not idempotent.
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) + ... + LC...read more
Calculate and print the sum of least common multiples (LCM) for each integer from 1 to N with N.
Iterate from 1 to N and calculate LCM of each number with N
Add all the calculated LCM values to get the final sum
Return the sum for each test case
Q4. 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 number of...read more
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while iterating through the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity of the algorithm should be O(N) where N is the size of the array.
Q5. Golden rules in accounting
Golden rules in accounting are basic principles that guide the recording of financial transactions.
There are three golden rules in accounting: Debit what comes in, Credit what goes out, Debit the receiver, Credit the giver, Debit expenses and losses, Credit income and gains.
For example, when cash is received, it is debited as it comes in. When cash is paid out, it is credited as it goes out.
Similarly, when goods are purchased on credit, the receiver is debited. When goods are...read more
Q6. sort stack ds and real life example
Sorting a stack data structure and its real-life example
Sorting a stack involves popping elements and comparing them to the remaining elements in the stack
Real-life example: arranging books on a shelf in alphabetical order
Another example: sorting a deck of cards by suit and rank
Q7. Experience in US mortgage
I have 3 years of experience in US mortgage processing, including loan origination, underwriting, and closing.
Experience in loan origination, underwriting, and closing processes
Knowledge of US mortgage regulations and guidelines
Proficient in using mortgage processing software like Encompass
Ability to analyze financial documents and credit reports
Strong communication skills for interacting with clients and lenders
More about working at Mr Cooper




Top HR Questions asked in Mr Cooper for Freshers
Interview Process at Mr Cooper for Freshers

Top Interview Questions from Similar Companies








Reviews
Interviews
Salaries
Users/Month

