i
Ninjacart
Filter interviews by
I applied via Naukri.com and was interviewed in Nov 2023. There were 3 interview rounds.
The process of lending involves evaluating the creditworthiness of borrowers and determining the terms and conditions of the loan.
Assessing the creditworthiness of borrowers by reviewing their credit history, income, and financial statements
Analyzing the borrower's ability to repay the loan by considering their debt-to-income ratio and cash flow
Determining the loan amount, interest rate, and repayment period based on t...
Risks involved in lending include credit risk, interest rate risk, and operational risk.
Credit risk: the risk of borrowers defaulting on their loans
Interest rate risk: the risk of interest rates changing and affecting loan repayments
Operational risk: the risk of errors or fraud in the lending process
Other risks: such as liquidity risk, market risk, and regulatory risk
Handling of risks involves identifying, assessing, and mitigating potential risks to minimize financial losses.
Identify potential risks by analyzing credit reports, financial statements, and market trends.
Assess the likelihood and impact of each risk to prioritize mitigation efforts.
Implement risk mitigation strategies such as setting credit limits, requiring collateral, or adjusting payment terms.
Regularly monitor and...
I appeared for an interview in Mar 2025, where I was asked the following questions.
I appeared for an interview in Feb 2025.
Data Structures, Coding MCQs
Data structures are organized formats for storing, managing, and accessing data efficiently.
1. Types: Common data structures include arrays, linked lists, stacks, queues, trees, and graphs.
2. Arrays: Fixed-size collections of elements, e.g., [1, 2, 3, 4].
3. Linked Lists: Collections of nodes where each node points to the next, e.g., 1 -> 2 -> 3.
4. Stacks: Last-in, first-out (LIFO) structures, e.g., function call ...
Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
DFS uses a stack data structure, either explicitly or via recursion.
It starts from a selected node and explores each branch before backtracking.
Example: In a binary tree, DFS can be implemented using pre-order, in-order, or post-order traversal.
DFS can be used to find connected components in a ...
I applied via Campus Placement
Startups are innovative, agile, and have the potential for rapid growth.
Startups are able to quickly adapt to market changes and customer needs.
They have the potential for high growth and scalability.
Startups often focus on disruptive technologies or business models.
They are usually founded by entrepreneurs with a vision for solving a specific problem or meeting a market need.
Ninjacart interview questions for popular designations
The aptitude test consist of 50 questions which was simple and mixed if all concepts
Only one easy coding question
Get interview-ready with Top Ninjacart Interview Questions
I applied via Approached by Company and was interviewed in Jul 2024. There was 1 interview round.
Our company process involves thorough market research, strategic planning, supplier negotiations, and continuous performance analysis.
Market research is conducted to identify trends, customer preferences, and competitor strategies.
Strategic planning involves setting goals, developing action plans, and allocating resources effectively.
Supplier negotiations are crucial for securing favorable terms, pricing, and quality s...
I appeared for an interview in Feb 2025, where I was asked the following questions.
I applied via Job Fair and was interviewed in Oct 2024. There was 1 interview round.
I applied via Approached by Company and was interviewed in Mar 2024. There were 2 interview rounds.
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
Given some ant ui design to reacreate from scretch
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
Top trending discussions
Some of the top questions asked at the Ninjacart interview -
The duration of Ninjacart interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 65 interviews
Interview experience
based on 1.9k reviews
Rating in categories
4-8 Yrs
₹ 5.05-8 LPA
3-8 Yrs
Not Disclosed
Senior Executive
253
salaries
| ₹2 L/yr - ₹6.5 L/yr |
Operations Executive
230
salaries
| ₹1.5 L/yr - ₹4.2 L/yr |
Sales Executive
204
salaries
| ₹1.5 L/yr - ₹4.5 L/yr |
Territory Sales Manager
192
salaries
| ₹3 L/yr - ₹9 L/yr |
Team Lead
189
salaries
| ₹1.5 L/yr - ₹8.2 L/yr |
Udaan
Swiggy
CARS24
BlackBuck