Ninjacart Software Developer Intern Interview Questions and Answers

Basic Aptitude Question that are easily solvable

2 DSA Question with 20 min to each question

Round duration - 90 mintues
Round difficulty - Easy

Nice environment everything went good.

Q1. 
Sum of LCM Problem Statement
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:
LCM(1, N) + LCM(2, N) + ....read more
Ans. 
Calculate and print the sum of least common multiples (LCM) for each integer from 1 to N with N.
• Iterate from 1 to N and calculate LCM of each pair with N

• Sum up all the calculated LCMs to get the final result

• Implement a function to calculate LCM of two numbers
Answered by AI
Add your answer
Q2. 
Vertical Order Traversal Problem Statement
Given a binary tree, return the vertical order traversal of the values of the nodes in the tree.
In a vertical order traversal, for each node at position (X, Y)...read more
Ans. 
Vertical order traversal of binary tree is obtained by running a vertical line from -∞ to +∞ and adding node values in top to bottom order, sorted by decreasing Y coordinates.
• Implement a function to perform vertical order traversal of a binary tree

• Maintain a map to store nodes at each vertical level

• Sort the nodes at each level by their Y coordinates in decreasing order

• Handle cases where two nodes share the same positio
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was a tough round focus on the key concepts

Q1. 
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...read more
Ans. 
Implement a stack with getMin operation in O(1) time complexity without using extra space.
• Use two stacks - one to store the actual elements and another to store the minimum values encountered so far.

• When pushing an element, check if it is smaller than the current minimum and if so, push it onto the minimum stack.

• When popping an element, check if it is the current minimum and if so, pop from the minimum stack as well.

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

Lists and Trees were asked

Q1. 2 DSA question medium leetcode
Add your answer

Q1. 1 Dsa question and about projects
Add your answer

1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION

Hackerrank LeetCode 2 Hard questions and 1 medium

Round duration - 150 minutes
Round difficulty - Medium

The interview was scheduled at 6 pm and the duration of the interview was 1.5 hrs but went for around 2.5 hrs. The interviewer started with a brief intro about me. Asked me some coding questions. After coding questions he started asking questions on dbms like difference between sql and no sql, what is horizontal and vertical scaling and when we use them. Then some questions on computer networks like how web browsers works, different between http and HTTPS, what is TCP. After this he asked about my projects and the technology I worked on during the intern.

Q1. 
Snake and Ladder Problem Statement
Given a Snake and Ladder Board with 'N' rows and 'N' columns filled with numbers from 1 to N*N starting from the bottom left of the board, and alternating direction each...read more
Ans. 
Find the minimum number of dice throws required to reach the last cell on a Snake and Ladder board.
• Use Breadth First Search (BFS) algorithm to find the shortest path on the board.

• Create a mapping of each cell to its next possible moves based on dice outcomes.

• Consider the snakes and ladders on the board while calculating the next possible moves.

• Track the number of dice throws needed to reach each cell and update it as y...read more
Answered by AI
Add your answer
Q2. 
Deletion In Doubly Linked List
You are given a Doubly Linked List with 'N' positive integers. Your task is to delete a node at a given position 'POS' in this linked list.
Input:
The first line of input ...read more
Ans. 
Implement a function to delete a node at a given position in a Doubly Linked List.
• Traverse to the node at the specified position in the Doubly Linked List.

• Adjust the pointers of the previous and next nodes to remove the node at the specified position.

• Update the pointers accordingly to maintain the integrity of the Doubly Linked List.

• Handle edge cases such as deleting the head or tail node.

• Ensure to free the memory of t
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy