Ninjacart SDE Interview Questions and Answers

Q1. Question on DSA were asked related to arrays and trees
Add your answer
Q2. Questions on basics of OOPs were asked
Add your answer

Q1. Some kind of merge sort usage
Ans. 
Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.
• Merge sort is efficient for sorting large arrays.

• It has a time complexity of O(n log n).

• It is a stable sorting algorithm.

• Example: ['apple', 'banana', 'orange', 'grape', 'kiwi']
Answered by AI
Add your answer

Q1. Snakes and ladder design
Add your answer

Q1. System design of doctor app
Add your answer

Q1. COMPANY FIT QUESTIONS
Add your answer

Q1. Predict the winner leetcode problem
Ans. 
The winner leetcode problem involves finding the candidate with the most votes in an election scenario.
• Iterate through the list of candidates and keep track of their votes

• Return the candidate with the highest number of votes

• Example: Input - ['Alice', 'Bob', 'Alice', 'Charlie', 'Bob'], Output - 'Alice'
Answered by AI
Add your answer

It had 9 uqestions , one problem solving , one SQL , one API and 6 mcq

Easy assignment , if you hav eOOps knowledge you can do it

Q1. System design of Cricbuzz
Ans. 
Cricbuzz system design involves handling real-time sports data, user traffic, and providing live scores, news, and updates.
• Use microservices architecture to handle different functionalities like live scores, news, and updates.

• Implement caching mechanisms to reduce load on servers and improve performance.

• Utilize a distributed database to store large amounts of sports data efficiently.

• Implement a robust notification syst...read more
Answered by AI
Add your answer

DSA - 3 Coding Questions

Q1. Machine coding - low level design
Add your answer