Money Honey Financial Services Associate Software Engineer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions on DSA and OS.

Q1. 
LRU Cache Design Problem Statement
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...read more
Ans. 
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...read more
Answered by AI
Add your answer
Q2. 
Maximum of All Subarrays of Size K
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 ...read more
Add your answer
Q3. What is virtual memory?
Add your answer

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.

Q1. Write an efficient program to find the sum of the contiguous subarray within a one-dimensional array of numbers that has the largest sum.
Add your answer

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.

Q1. 
DFS Traversal Problem Statement
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...read more
Add your answer

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. 
 

Round duration - 90 minutes
Round difficulty - Medium

The coding round consisted of 3 coding questions. 1st question was of 20 marks, 2nd and 3rd of 50 marks.

Q1. 
Minimum Number of Operations Problem Statement
Given an array 'ARR' consisting of 'N' positive integers, determine the minimum number of operations needed to make all elements of the array equal. You may ...read more
Add your answer
Q2. 
Avoiding Traps Problem Statement
Given an array of obstacles' coordinates, determine the minimal jump length to reach beyond all obstacles starting from coordinate 0 while avoiding landing on any obstacle...read more
Ans. 
Find the minimal jump length to bypass all obstacles while avoiding landing on any obstacle.
• Iterate through the obstacle coordinates to find the maximum coordinate.

• Calculate the minimum jump length needed to bypass all obstacles.

• Ensure the jump length consistently avoids all obstacle points.

• The final jump can overshoot the line's end point.
Answered by AI
Add your answer
Q3. 
Longest Consecutive Sequence Problem Statement
You are given an unsorted array/list ‘ARR’ of ‘N’ integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence ...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Timing: 10:15 - 11:00 am.
The interview was online from home.

Round duration - 45 minutes
Round difficulty - Medium

Timing: 2:15 - 3:00 PM
The interview was online from home.
There were a few audio cuts in the video call but we were able to manage regardless.

Q1. 
Reverse a String Problem Statement
Given a string STR containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
Input:
The input starts with a single i...read more
Ans. 
Reverse a given string containing characters from [a-z], [A-Z], [0-9], and special characters.
• Iterate through the characters of the string in reverse order and append them to a new string.

• Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

• Handle special characters and numbers along with alphabets while reversing the string.

• Ensure to print each reversed string ...read more
Answered by AI
Add your answer