i
Coding
Ninjas
Filter interviews by
I applied via Referral and was interviewed in Jul 2024. There were 3 interview rounds.
Indexing improves data retrieval speed but can increase storage and maintenance costs.
Faster query performance: Indexes allow for quicker data retrieval. For example, searching for a user by ID is faster with an index.
Reduced I/O operations: Indexes minimize the number of disk reads required to find data, enhancing performance.
Increased storage requirements: Indexes consume additional disk space, which can be significa...
SQL- 1 departments with no users
2 dept_id and their respective no. of users
DSA1: Most frequent no. in an array
DSA2: Zero Sum subarray exists
I applied via Referral and was interviewed before Oct 2023. There were 3 interview rounds.
Use a hash set to find duplicates in an array of strings.
Create a hash set to store unique elements.
Iterate through the array and check if the element is already in the hash set.
If it is, then it is a duplicate. If not, add it to the hash set.
Create a student support system
Design an order and payments system for an EdTech company
Allow users to browse and select courses
Implement a shopping cart for users to add courses
Integrate payment gateways for secure transactions
Provide order confirmation and receipt to users
Allow users to track their order status
Top trending discussions
I appeared for an interview in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
Use Dijkstra's algorithm to find the shortest path between the given vertices.
Create a graph data structure to represent the weighted, undirected graph.
Handle cases where no path exists between the given vertices by returning -1.
Optimize the algorithm to handle multiple queries efficiently.
Consider edge cases such as...
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Merge Sort is a divide-an...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively
Sort the two halves separately
Merge the sorted halves to produce a fully sorted array
Time complexity of Merge Sort is O(n log n)
Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
You are provided with an N * N
maze where a rat is positioned at starting cell MAZE[0][0]
. The goal is to determine and print all possible paths that the rat can take to r...
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
Use backtracking to explore all possible paths from the starting cell to the destination cell.
At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.
Keep track of the path taken so far and mark the cells accordingly.
Once the destination cell i...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
I applied via Coding ninjas and was interviewed before Nov 2023. There were 3 interview rounds.
Pizza restaurant website
PDO stands for PHP Data Objects, a database access layer providing a uniform method of access to multiple databases.
PDO is a PHP extension that provides a data-access abstraction layer.
It supports multiple database systems like MySQL, PostgreSQL, SQLite, etc.
PDO helps prevent SQL injection attacks by using prepared statements.
It allows for error handling and supports transactions.
Example: $pdo = new PDO('mysql:host=loc...
Basic coding and MySQL queries. Like Types of join, having and where difference etc.
I applied via Naukri.com and was interviewed in Jan 2023. There were 3 interview rounds.
Aptitude test was first round. it was hard level
Program on string, oops , exception handling
I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.
2 coding questions with aptitude question(logical aptitude and quantitative aptitude)
This was a Machine Coding. We need to design a system and then they will check our design by running test cases. It was 2.5 hrs long.
Hard test dsa question practice more leetcode
based on 2 interview experiences
Difficulty level
Duration
based on 4 reviews
Rating in categories
Teaching Assistant
184
salaries
| ₹1.2 L/yr - ₹4 L/yr |
Relationship Manager
39
salaries
| ₹3.5 L/yr - ₹6 L/yr |
Admission Counsellor
35
salaries
| ₹4.2 L/yr - ₹8 L/yr |
Operations Associate
27
salaries
| ₹4 L/yr - ₹6.1 L/yr |
Data Analyst
20
salaries
| ₹6 L/yr - ₹11 L/yr |
FastInfo
Testbook.com
BrightCHAMPS
Acadecraft