M&T Bank Interview Questions and Answers

Q1. Tell me about yourself, and my internship related questions
Add your answer

Q1. Mutual funds and hedge fund related questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The test was scheduled around 5 evening and it had 3 coding questions. First question was on Dynamic Programming and other was medium question and was easy and the third was based on graph. And there were 20 mcq questions on Data structures, DBMS and OS

Q1. 
Matrix Word Search Problem
Explanation: You are given an 'M' x 'N' matrix of characters named CHARACTER_MATRIX and a string WORD. Your task is to identify and list all the occurrences of the string within...read more
Ans. 
Matrix Word Search Problem - Find occurrences of a given word in all eight possible directions within a matrix.
• Iterate through each cell in the matrix and check for the starting character of the word.

• For each occurrence of the starting character, check all eight directions for the complete word.

• Keep track of the coordinates of each character in the word for each occurrence found.

• Ensure boundaries are not crossed while ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Normal Coding question on Graphs and some basics from DBMS

Q1. 
Transitive Closure of Directed Graph Problem Statement
Given a directed graph with 'V' vertices and 'E' edges, determine if a vertex i is reachable from vertex j for all pairs of vertices (i, j). A vertex...read more
Ans. 
Determine reachability between all pairs of vertices in a directed graph.
• Use Floyd Warshall algorithm to find transitive closure of the graph.

• Initialize a V x V matrix with 1s on the diagonal and 0s elsewhere.

• Update matrix by checking if there is a path from i to j through k.

• Repeat the process for all vertices to get the transitive closure matrix.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

He asked me to read about Morse language in wikepedia and asked me to write a code on it i. e. If the input Morse code and in output we should get it in English

Q1. 
Morse Code to English Problem Statement
You are provided with a string of morse code(s) of length N. Your task is to convert this morse code into the corresponding alphanumeric code consisting of lowercas...read more
Ans. 
Convert Morse code to alphanumeric code using a predefined table.
• Iterate through the morse code string and convert each morse code to its corresponding alphanumeric character using the given table.

• Join the converted characters to form the final alphanumeric string.

• Handle spaces between morse code characters by adding a space in the final alphanumeric string.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interview was held in the evening on a weekday, Interview was nice and quite experienced, he asked me about my previous experience in the area and they told me about the team and work for which they were hiring, we did some discussion on that. Meanwhile, I was also asked a few questions on Database and SQL.

Q1. 
Find Magic Index in Sorted Array
Given a sorted array A consisting of N integers, your task is to find the magic index in the given array, where the magic index is defined as an index i such that A[i] = i...read more
Ans. 
Find the magic index in a sorted array where A[i] = i.
• Iterate through the array and check if A[i] = i for each index i

• Utilize binary search for a more efficient solution

• Handle cases where there are multiple magic indices or none at all
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the afternoon. There were some glitches with the teams meeting but it got sorted out in a few minutes. This round was purely coding based. He started with questions on arrays, linked lists, and string manipulation with an increasing level of hardness. The tricky part was that the online editor I was given for writing the code was not an IDE but a simple text editor, so I wasn't getting any help in terms of code completion or syntax errors or syntax highlighting.

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
The task is to find all pairs of elements in an array that add up to a given target.
• Iterate through the array and for each element, check if the difference between the target and the element exists in a hash set.

• If it exists, add the pair to the result. If not, add the element to the hash set.

• Handle cases where the same element is used twice in a pair.

• Return (-1, -1) if no pair is found.
Answered by AI
Add your answer