i
Mr
Cooper
Filter interviews by
I applied via Company Website and was interviewed in Sep 2024. There were 2 interview rounds.
Easy aptitude and verbal questions
I applied via Campus Placement
General Maths and English knowledge need.
I applied via Recruitment Consulltant and was interviewed before Nov 2023. There were 3 interview rounds.
General questions which includes English and maths
I applied via Referral and was interviewed before Aug 2023. There were 3 interview rounds.
It was moderate in difficulty
I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.
It was mostly easier , just general English and general maths. Should be good in addition , subtraction, finding the difference between two images. And etc. Also good English. Not the best , but good will suffice.
Our company is a leading provider of innovative solutions in the process management sector, focusing on efficiency and quality.
Founded in [Year], the company has grown to serve clients across various industries, including finance and healthcare.
We prioritize customer satisfaction, evidenced by our [specific award or recognition] for outstanding service.
Our team is dedicated to continuous improvement, utilizing the late...
Top trending discussions
Code for rand7 using rand5 function
Use rand5 twice to generate a number in [1,25] with equal probability
If the number is greater than 21, discard and try again
Otherwise, return (number mod 7) + 1
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions on DSA and OS.
Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:
get(key)
- Retrieve the value associated with the...Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.
Implement a doubly linked list to keep track of the order of keys based on their usage.
Use a hashmap to store key-value pairs for quick access and updates.
When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.
When the cache reaches...
Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...
Find the maximum elements for each subarray of size K in a given array.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque that are out of the current window.
Keep track of the maximum element in each subarray of size K.
Return the maximum elements for each subarray.
Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.
Virtual memory allows programs to use more memory than is physically available on the system.
It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.
Virtual memory uses a combination of RAM and disk...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Implement LRU cache
LRU stands for Least Recently Used
It is a cache eviction policy that removes the least recently used item
It can be implemented using a doubly linked list and a hash map
Newly accessed items are moved to the front of the list
When the cache is full, the item at the end of the list is removed
Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.
Virtual memory uses a combination of RAM and hard disk space to store data.
It allows programs to use more memory than is physically available.
If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.
Even if we had infinite RAM, virtual memory would still be n...
Find maximum length of subarray where max <= 2*min.
Iterate through array and keep track of max and min values.
Update max length when condition is met.
Time complexity: O(n)
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me two coding questions in this round.
Efficient program to find sum of largest contiguous subarray within a one-dimensional array.
Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.
Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.
Return max_sum as the result.
Round duration - 60 minutes
Round difficulty - Easy
This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal problem to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Round duration - 60 minutes
Round difficulty - Easy
This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.
Round duration - 60 minutes
Round difficulty - Easy
This was the third round of the onsite interview.
Practice DP based questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer Coding Ninjas and Geeks For Geeks.
Application resume tips for other job seekersKeep it short. Mention the academic and professional projects you've done. Add your educational details properly with percentage or CGPA obtained.
Final outcome of the interviewSelectedbased on 7 interview experiences
Difficulty level
Duration
based on 6 reviews
Rating in categories
Process Associate
834
salaries
| ₹2 L/yr - ₹3.5 L/yr |
Senior Process Associate
248
salaries
| ₹2.6 L/yr - ₹4.5 L/yr |
Senior Software Engineer
66
salaries
| ₹12 L/yr - ₹22.1 L/yr |
Senior Analyst
49
salaries
| ₹5.3 L/yr - ₹12.6 L/yr |
Process Specialist
49
salaries
| ₹3.7 L/yr - ₹5.4 L/yr |
Goldman Sachs
FactSet
Kotak Securities
Morningstar