MagicPin Senior Software Engineer Interview Questions and Answers

Q1. Coding questions was leecode replace 3 concurrent character in string until there is none
Add your answer
Q2. You can google the answer
Add your answer

Q1. Here also leetcode easy
Add your answer
Q2. Easily solvable
Add your answer

Questions were crayon box ,the bot and the game and happy neighbourhood for 90 mins

Q1. Array basics was asked
Add your answer
Q2. Segment tree,prefix sum
Add your answer

Q1. Low level design was asked
Add your answer

Q1. Rotate matrix by 90 degree
Ans. 
Rotate a matrix by 90 degrees.
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer
Q2. Longest substring with unique characters
Ans. 
The question asks for finding the longest substring in a given string that contains only unique characters.
• Iterate through the string and keep track of the current substring

• Use a set to check for duplicate characters

• Update the longest substring if a longer one is found
Answered by AI
Add your answer

Q1. A trie question
Add your answer

Ecommerce hight level design

Q1. Node JS internal
Add your answer
Q2. Previous project discussion
Add your answer

Q1. Sharding, sql vs nosql, project discussion and tradoffs
Add your answer

Q1. Behavior and culture questions
Add your answer

Some mcq questions on Java and 2 DSA medium questions

Q1. Spring boot , Java and DSA questions
Add your answer

Q1. Design BookMyShow low level design
Ans. 
BookMyShow low level design for ticket booking system
• Use microservices architecture for scalability and flexibility

• Implement user authentication and authorization for secure transactions

• Utilize databases for storing user and event information

• Include payment gateway integration for seamless transactions
Answered by AI
Add your answer

Q1. Design lru cache and code
Ans. 
LRU cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
• Use a combination of a doubly linked list and a hashmap to implement the LRU cache.

• When an item is accessed, move it to the front of the linked list to mark it as the most recently used item.

• When adding a new item, check if the cache is full. If it is full, remove the least recently used ite...read more
Answered by AI
Add your answer

Q1. Coding and scenario based questions were there
Add your answer

Q1. Scenario Based questions
Add your answer

Q1. HR discuss......
Add your answer