MoneyGram International Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

Contained mix of coding, oops and general programming questions

Coding was live coding round
It was around 12pm
They used their own coding environment, I coded in java

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Ans. 
Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.
• Iterate through the array and keep track of the maximum sum subarray seen so far.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Consider the case where all elements in the array are negative.

• Handle the case where the array contains only one element.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

It was a collection of HLD AND LLD
Was around 12pm
This was conducted on bluejeans

Q1. Design a URL shortener with a database and all necessary components.
Ans. 
Design a URL shortener with database and necessary components
• Use a unique identifier for each URL to generate short links

• Store the original URL and corresponding short link in a database

• Implement a redirect mechanism to redirect short links to original URLs

• Consider implementing analytics to track usage and performance

• Ensure scalability and reliability of the system
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was a friendly managerial round with director of my team, he was very for me to come on board and explained truthfully how payu is.

Round duration - 30 Minutes
Round difficulty - Easy

Just a normal HR discussion, he informed me that I've been selected and we discussed about the salary part

Q1. Can you describe your experience working in a corporate environment?
Add your answer

Q1. Basic details which generally hr ask.
Add your answer

Q1. About urself, related to profile for which you are applying
Add your answer

Q1. Deep dive into java concepts. Max diameter of a tree in java.
Ans. 
Max diameter of a tree in Java is the longest path between any two nodes in a tree.
• The diameter of a tree can be calculated by finding the longest path between any two nodes in the tree.

• This can be done by finding the longest path from the root to a leaf node, and then finding the longest path from another leaf node to the root.

• The sum of these two paths gives the diameter of the tree.
Answered by AI
Add your answer

Q1. Lld of loan and borrower design. Design dbs schema. About connection pool, db isolation.
Add your answer

Q1. Hiring manager round, more about previous experience and some hypothetical questions.
Add your answer

Search in Rotated sorted array

45 min analytical questions

Q1. Send + more = money
Add your answer
Q2. Find the angle at 3:20
Ans. 
To find the angle at 3:20, we need to calculate the minute hand's position relative to the hour hand.
• Calculate the angle made by the hour hand with the 12 o'clock position at 3:20 (20 minutes past 3)

• Calculate the angle made by the minute hand with the 12 o'clock position at 3:20

• Find the difference between the two angles to get the angle at 3:20
Answered by AI
Add your answer