Meritto Senior Software Engineer Interview Questions and Answers for Experienced

Q1. DS and algorithm questions
Add your answer

Q1. IOS /Skillset questions some tricky questions
Add your answer

Q1. Personality and Compensation discussion
Add your answer

Q1. DSA - level order traversal, sliding window.
Add your answer

Q1. Atomic transaction in distributed system
Ans. 
Atomic transactions ensure that all operations in a transaction are completed successfully or none at all in a distributed system.
• Atomic transactions guarantee that all operations within a transaction are either all successful or all rolled back.

• In distributed systems, atomic transactions are crucial for maintaining data consistency across multiple nodes.

• ACID properties (Atomicity, Consistency, Isolation, Durability) a...read more
Answered by AI
Add your answer

Q1. Coding round with senior software engineer
Add your answer

Q1. Resume based discussion with lead software engineer
Add your answer

Q1. Resume based and coding round with hiring manager
Add your answer

Q1. Cross team resume based and coding round with a staff engineer
Add your answer

Q1. Attitude and culture fit
Add your answer

Very basic problem solving round

Q1. Medium level DSA problem solving round
Add your answer

Write a program that solves sudoku

Q1. How do you build a tiny URL Application?
Ans. 
A tiny URL application is built by generating short aliases for long URLs, storing them in a database, and redirecting users to the original URL when the alias is accessed.
• Generate a unique short alias for each long URL

• Store the alias and corresponding long URL in a database

• Implement a redirect mechanism to redirect users from the alias to the original URL

• Handle edge cases like duplicate URLs, expired aliases, and inva
Answered by AI
Add your answer

Two questions asked:
1. Partition equal sum
2. find length largest region boolean matrix

Q1. Immediate higher number to right
Ans. 
The immediate higher number to the right of each element in an array
• Iterate through the array from right to left

• For each element, compare it with the elements to its right to find the immediate higher number

• Store the immediate higher number in a new array
Answered by AI
Add your answer
Q2. Count pair whose sum is perfect square.
Ans. 
Count pairs in an array whose sum is a perfect square.
• Iterate through the array and calculate the sum of each pair.

• Check if the sum is a perfect square using a function.

• Increment a counter if the sum is a perfect square.

• Return the final count of pairs.
Answered by AI
Add your answer
Q3. Parking lot LLD
Add your answer
Q4. E Commerce HLD and LLD
Add your answer
Q5. Kth largest number in BST
Ans. 
To find the Kth largest number in a Binary Search Tree (BST), we can perform an in-order traversal and keep track of the Kth largest element.
• Perform an in-order traversal of the BST to get the elements in non-decreasing order.

• Keep track of the Kth largest element while traversing the BST.

• Return the Kth largest element once found.
Answered by AI
Add your answer