Money Honey Financial Services Software Developer Interview Questions and Answers

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.
Ans. 
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.
Answered by AI
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
Ans. 
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
Answered by AI
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. 
 

There were one medium and one easy coding question of DSA one of the array and another of string.

Q1. It was a good interview, where I was asked one easy DSA question, and asked many things related to API, requests types in API, errors code in the API, and bash scripts. It was 1.5 hours long interview.
Add your answer

Q1. It was the Hiring Manager round, where I was asked about the HLD of Phonepe.
Add your answer

1 dp
2 dynamic graph

Q1. Data structure and algorithms
Add your answer
Q2. Data structure and algorithm
Add your answer

Had 2 data structure questions of easy and medium level.

Q1. Got 2 DSA questions with further modifications of medium level
Add your answer

Moderate coding question

Assignment based on a app

Q1. What is inheritance in java?
Ans. 
Inheritance in Java allows a class to inherit properties and behavior from another class.
• Inheritance allows for code reusability and promotes a hierarchical relationship between classes.

• Subclasses can access the methods and fields of their superclass.

• Example: class Dog extends Animal {} - Dog inherits properties and behavior from Animal class.
Answered by AI
Add your answer
Q2. Difference between OOP and POP
Ans. 
OOP focuses on objects and classes, while POP focuses on procedures and functions.
• OOP emphasizes data encapsulation and inheritance

• POP emphasizes sequential execution of procedures

• Example of OOP: Java, C++

• Example of POP: C, Pascal
Answered by AI
Add your answer

Q1. Where do you see in next 5 years?
Add your answer
Q2. What is preferred job location
Add your answer

About 2 hours long interview in 3 sets one technical and 2 HR rounds

Java, HTML, CSS, BASIC aptitude questions

Q1. Linked list code, core Java questions, project discussion
Add your answer

Q1. Compensation discussion
Add your answer

Core Java, HTML, CSS, BASIC aptitude questions

Q1. Linked list coding, CORE JAVA, Project discussion
Add your answer

Q1. Compensation discussion
Add your answer