MasterCard Software Developer Interview Questions, Process, and Tips

Q1. Array basics, java basics oops and all
Add your answer

1hr - 2 questions - basic arrays and maps only

Q1. 2 questions , one on maps and other on dp with strings and then 2 questions on probability
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Check If The String Is A Palindrome
You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignor...read more
Ans. 
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
• Convert the string to lowercase and remove all symbols and whitespaces.

• Reverse the modified string and compare it with the original string.

• If they are equal, then the string is a palindrome.

• If not, then the string is not a palindrome.
Answered by AI
View 2 more answers
Q2. Square Root (Integral)
Given a number N, find its square root. You need to find and print only the integral part of square root of N.
For eg. if number given is 18, answer is 4.
Input format :
Integer ...read more
Ans. 
The task is to find the integral part of the square root of a given number.
• Use the built-in square root function to find the square root of the number.

• Convert the result to an integer by rounding down or using the floor function.

• Print the integer part of the square root as the output.
Answered by AI
View 1 more answer
Q3. Min Steps to one using DP
You are given a positive integer 'N’. Your task is to find and return the minimum number of steps that 'N' has to take to get reduced to 1.
You can perform any one o...read more
Ans. 
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
• Use dynamic programming to solve the problem efficiently.

• Create an array to store the minimum steps required for each number from 1 to N.

• Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.

• Return the minimum steps for N.
Answered by AI
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Medium

They started Fundamentals of OOP- Inheritance, Polymorphism

Q1. SQL Qusestions
SQL queries (basic, nested, and the on containing where,having,group by,order by, like, etc..)
SQL Joins, and which is the fastest?
DDL vs DML
Ans. 
The question is about SQL queries, SQL joins, and the difference between DDL and DML.
• SQL queries can be basic or nested and can involve various clauses like WHERE, HAVING, GROUP BY, ORDER BY, LIKE, etc.

• SQL joins are used to combine rows from different tables based on a related column between them.

• The fastest join depends on the specific scenario and the data involved.

• DDL (Data Definition Language) is used to define and...read more
Answered by AI
Add your answer
Q2. OS Questions
What are the benefits of a multiprocessor system?
Explain demand paging?
What is virtual memory?
deadlock
Ans. 
Benefits of multiprocessor system, demand paging, virtual memory, and deadlock explained.
• Benefits of a multiprocessor system include increased processing power, improved performance, and better resource utilization.

• Demand paging is a memory management technique where pages are loaded into memory only when they are needed.

• Virtual memory is a memory management technique that allows the execution of processes that are lar...read more
Answered by AI
Add your answer
Q3. Maximum Subarray Sum
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since w...read more
Ans. 
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
• Initialize two variables, maxSum and currentSum, both set to the first element of the array.

• Iterate through the array from the second element.

• For each element, update currentSum by adding the element to it.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• After iterating ...read more
Answered by AI
View 3 more answers

Round duration - 30 Minutes
Round difficulty - Medium

Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom

Q1. Basic HR Questions
Do you have any regrets?
How do you respond to change?
Ans. 
Answering basic HR questions about regrets and response to change.
• I believe that regrets are a part of life and learning from them is important.

• I respond to change by being adaptable and open-minded.

• I embrace change as an opportunity for growth and improvement.

• I have learned from past experiences and have become more resilient.

• I actively seek feedback and continuously strive to improve myself.

• I have successfully adapte...read more
Answered by AI
Add your answer