i
Ninjacart
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Easy to medium level of leet code
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.
For Fibonacci series without recursion, use a loop to calculate the series.
For string palindrome, compare characters from start and end of the string.
To count all repeated numbers from the array, u
Rotate array to find max sum of i*A[i]
Rotate array to bring maximum element to front
Calculate sum of i*A[i] for each rotation
Keep track of maximum sum found
I applied via Campus Placement and was interviewed in Sep 2023. There was 1 interview round.
3 Questions were asked out of which if you did 2 you were shortlisted for next round. Questions were mostly from topics like array, string and greedy
Top trending discussions
I was interviewed in Feb 2021.
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.
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.
...Return the top view of a binary tree given in level-order format.
Traverse the binary tree in level-order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and return the nodes at the top view.
Handle null nodes by adjusting the horizontal distance accordingly.
Example: For the given binary tree, the top view will be {10, 4, 2, 1, 3, 6}.
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.
Given an array of four digits, form the maximum valid 24-hour time. Return -1 if not possible.
Iterate through all permutations of the digits to find the maximum valid time.
Check if the time is valid (between 00:00 and 23:59) before returning.
Handle cases where no valid time can be generated by returning -1.
Tip 1 : Practise Data Structures and Algorithms as much as you can on daily basis. Don't Fix numbers in your head, but practise as much as you can from all topics on daily basis.
Tip 2 : Give Programming Contests on a Daily basis. As it helps you to think of any particular problem in the fixed time frame.
Tip 3 : For Mastering DP, Learn From Aditya Verma Youtube Playlist and apply around 100 questions for solving any DP problem.
Tip 4 : Also Learn Computer Science theory subject once a week so that you will have a deep understanding of the particular subject since many interviews grind on CS theory subjects like OS, DBMS and Networks
Tip 5 : Make at least 2-3 Projects in any technology you like maybe Web Development or Android Development. It shows that you have some experience in Development and the company don't need to waste time on you for teaching frameworks.
Tip 6 : If you have time learn some System Design and learn how to design any system from end to end. Especially learn about designing a database of any application. In many interviews, the interviewer asks to design an application from end to end. So if you have some practice, then you can easily clear this type of rounds.
Tip 1 : Always attached your Project links in your resume. As it seems your project is genuine and you are confident in showing your projects
Tip 2 : Don't add unnecessary things in your resume which are not related to the job, like your 10th class winning tournament certificate or managing a college society. These things didn't create any impact on your profile and takes an unnecessary space in your resume.
Tip 3 : Always make a 1-page resume. If you are making more than 1 page then it means you have added a lot of unnecessary information which are not related to the job profile.
Tip 4 : Always show your Project and Past experience on top, just after your basic info and education. Since these are the things which should be on top to showcast the skills.
posted on 1 Jul 2024
I applied via LinkedIn and was interviewed in Jan 2024. There were 2 interview rounds.
Basic Aptitude Question that are easily solvable
2 DSA Question with 20 min to each question
I was interviewed in Nov 2020.
Round duration - 90 mintues
Round difficulty - Easy
Nice environment everything went good.
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) + ....
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
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)...
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
Round duration - 90 minutes
Round difficulty - Hard
It was a tough round focus on the key concepts
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...
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...
Tip 1 : Prepare Data structure and algorithm
Tip 2 : RDBMS and OS are also important
Tip 3 : Focus on CAO
Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there
Lists and Trees were asked
I was interviewed before May 2023.
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION
Hackerrank LeetCode 2 Hard questions and 1 medium
I was interviewed in May 2022.
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.
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...
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...
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.
The first line of input ...
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
Round duration - 20 minutes
Round difficulty - Easy
Tip 1 : Study all the concepts of dbms and cn deeply
Tip 2 : Zomato focus on development, so you have to do some good projects or should have previous internship experience.
Tip 1 : Have good Projects
Tip 2 : Study all the topics deeply that u mentioned in your resume.
based on 2 interviews
Interview experience
based on 5 reviews
Rating in categories
Senior Executive
256
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
230
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
204
salaries
| ₹0 L/yr - ₹0 L/yr |
Territory Sales Manager
197
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
191
salaries
| ₹0 L/yr - ₹0 L/yr |
BigBasket
Blinkit
FreshToHome
Zomato