Ninjacart Software Developer Intern Interview Questions and Answers

Q1. It was based on dynamic programming
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

Test Description/Instruction as Mentioned on the portal and mail :

1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.

Q1. 
Flood Fill Algorithm Task
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...read more
Ans. 
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
• The image is represented as a 2D array of positive integers

• The starting pixel and new color are given

• Adjacent pixels are connected in up, down, left, or right directions

• Diagonal pixels are not considered adjacent

• Implement the Flood Fill Algorithm to replace the color of the given pixel and it...read more
Answered by AI
View 1 more answer
Q2. 
Kruskal’s Minimum Spanning Tree Algorithm Problem Statement
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...read more
Ans. 
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
• Implement Kruskal's algorithm to find the minimum spanning tree

• Use a disjoint set data structure to keep track of connected components

• Sort the edges in non-decreasing order of their weights

• Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle

• Return the sum of weigh
Answered by AI
Add your answer
Q3. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
• Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.

• Then it merges the two sorted halves to produce a single sorted array.

• The time complexity of merge sort is O(n log n), where n is the size of the input array.

• The algorithm is efficient ...read more
Answered by AI
Add your answer

Round duration - 24 hours
Round difficulty - Medium

Round duration - 120 Minutes
Round difficulty - Medium

It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
 

Q1. 
Top View of Binary Tree
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...read more
Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...read more
Answered Anonymously
Add your answer
Q2. 
Maximum Possible Time Problem Statement
Given an array ARR consisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour format using those digits.
Explanat...read more
Ans. Maximum Possible Time
Approach:
• The basic idea is that we will iterate over all the permutations of the 4 digits and check whether we are able to form a valid 24 Hr format time. If so we will then also find the maximum possible time.
• Here we will use the ‘NEXT_PERMUTATION’ method to find all the permutations.
 
Algorithm:
• There are two conditions for valid 24 Hr format time:
  • The first two digits i.e the hour should be le...read more
Answered Anonymously
Add your answer

The exam duration is one and a half hours.

The total exam time is one and a half hours.

It encompasses all topics related to full stack development.

Q1. Asks questions on SQL
Add your answer
Q2. Asks question in typical topics
Add your answer

Q1. Where do you see yourself in two years?
Ans. 
In two years, I see myself as a senior software developer leading a team on innovative projects.
• Advancing to a senior software developer role

• Leading a team on new and innovative projects

• Continuing to enhance my technical skills through ongoing learning and training
Answered by AI
Add your answer

Q1. Explain Deadlock?
Add your answer
Q2. Explain Red Black Tree?
Add your answer
Q3. Find local minima in a 1-D array?
Add your answer
Q4. Find local minima in 2-D array?
Add your answer

Easy level to Medium level

2 Easy questions of DSA

Q1. One DSA question
Add your answer
Q2. Normal discussion about tech stack
Add your answer

Q1. Tell about yourself
Add your answer
Q2. Why do you want to join digit?
Add your answer