MasterCard Software Engineer2 Interview Questions and Answers

Hacker rank coding test

Q1. Reverse a linked list in k sizes
Ans. 
Reverse a linked list in k sizes
• Break the linked list into groups of size k

• Reverse each group individually

• Connect the reversed groups back together
Answered by AI
Add your answer
Q2. Unbounded knapsack
Add your answer

Q1. Java theory questions
Add your answer

Q1. Manegerial round, managerial questions
Add your answer

LC Medium Hackerearth Test

Q1. Linked List & Binary Tree Medium Hard Problems
Add your answer

Q1. System Design Discussion focused on DB Design, OOPs, Scalability
Add your answer

Q1. Hiring Manager Round. Mostly resume walkthrough & followed by a System Design problem focused on Scalability
Add your answer

Question base on Tree data structures

Q1. Explain GC collector in Java
Ans. 
GC collector in Java is responsible for managing memory by reclaiming unused objects and freeing up memory space.
• GC stands for Garbage Collector

• Automatically manages memory by reclaiming unused objects

• Prevents memory leaks and optimizes memory usage

• Different types of GC algorithms like Serial, Parallel, CMS, G1

• Example: System.gc() can be used to suggest garbage collection
Answered by AI
Add your answer
Q2. Dynamic programming algorithm question
Add your answer

Q1. Low level design for Car rental system
Ans. 
Design a car rental system at a low level
• Use object-oriented programming to model cars, customers, rentals, etc.

• Implement a database to store information about available cars, customer bookings, etc.

• Include features like booking, returning, and searching for cars

• Consider implementing a pricing system based on factors like car type, duration of rental, etc.
Answered by AI
Add your answer

Q1. Salary discussion
Add your answer

There was MCQs with two coding questions. one easy and one medium.

Q1. It was a coding round where questions related tree traversing was asked
Add your answer

Q1. In depth Java questions containing multithreading, garbage collections etc.
Add your answer

Q1. System design round. Design LLD for Flipkart shopping cart
Add your answer

Q1. Discussion with Manager with some basic HR questions.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

test timing: 7-8 pm
2 programming questions
webcam proctored

Q1. 
Minimum Cost to Reach End Problem
You are provided with an array ARR of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...read more
Ans. 
Find minimum cost to reach end of array by jumping with constraints
• Use dynamic programming to keep track of minimum cost at each index

• Iterate through the array and update the minimum cost based on reachable indices within K steps

• Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Answered by AI
Add your answer