Matrix Partners Senior Systems Engineer Interview Questions, Process, and Tips

Q1. About projects in resume
Add your answer
Q2. Resume related questions
Add your answer

Q1. MVC , C#, ASP.net
Add your answer

Q1. Managerial question
Add your answer

Q1. Types of garbage collectors
Add your answer

Q1. Salary negotiation
Add your answer

Q1. Black scholes assumptions
Add your answer
Q2. Put call parity and its proof
Ans. 
Put call parity is a principle that establishes a relationship between the prices of European call and put options.
• Put call parity states that the price of a European call option and a European put option with the same strike price and expiration date should be equal.

• The formula for put call parity is C + PV(K) = P + S, where C is the price of the call option, PV(K) is the present value of the strike price, P is the pr...read more
Answered by AI
Add your answer

X being snv what is the expectation of e^x

Q1. Everything about resume, touchpoints on all core and advance java concepts. Why and what's of collections, hashmap working deep down on hashmap working
Add your answer

Q1. Implement a blocking queue
Ans. 
A blocking queue is a data structure that allows insertion and removal of elements in a FIFO (First In First Out) manner. If the queue is empty, the removal operation will block until an element is available.
• Use a circular buffer to implement the queue

• Use a mutex to synchronize access to the queue

• Use a condition variable to block the removal operation if the queue is empty

• Implement methods for adding and removing eleme
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.

Q1. 
Best Time to Buy and Sell Stock Problem Statement
Given an array prices representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can ac...read more
Ans. 
Find the maximum profit by buying and selling a stock once based on given prices.
• Iterate through the prices array and keep track of the minimum price seen so far and the maximum profit achievable.

• Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.

• Return the maximum profit, ensuring it is not negative.

• Example: prices = [2, 100, 150, 120], Buy at 2, sell a
Answered by AI
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Dance Team Pairing Challenge
Imagine you are helping Ninja, a dance coach, who needs to form dance pairs from the available boys and girls in a studio. Given the number of boys N, the number of girls M, a...read more
Ans. 
The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.
• Parse the input to get the number of test cases, boys, girls, and potential pairings.

• Iterate through the potential pairings and form pairs based on the given indexes.

• Output '1' if a set of maximum possible pairs is returned, else output '0'.

• There can be multiple valid configurations of pa...read more
Answered by AI
Add your answer
Q2. What is the difference between multiprocessing and multithreading?
Ans. 
Multiprocessing involves multiple processes running concurrently, while multithreading involves multiple threads within a single process.
• Multiprocessing utilizes multiple processes to execute tasks simultaneously.

• Multithreading involves multiple threads within a single process sharing the same memory space.

• Multiprocessing is typically used for CPU-bound tasks, while multithreading is more suitable for I/O-bound tasks.

• E...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Q1. Can you describe the classes and functions involved in the design of a system like Splitwise?
Ans. 
Splitwise is a system for managing shared expenses among groups of people.
• Classes: User, Expense, Group

• Functions: addExpense(), settleUp(), calculateBalance()
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Leetcode simple problems. But with coding

C++ basics and operating systems basic

Q1. C++ templates and advanced c++
Add your answer
Q2. Low level design
Add your answer

Few basics of java
Dsa question

Q1. Java multithreading questions
Add your answer
Q2. Spring boot questions.
Add your answer