i
Coding Ninjas
Filter interviews by
I applied via Company Website and was interviewed before Jan 2023. There was 1 interview round.
MergeSort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves
To add one in a linked list, create a new node with the value 1 and add it to the end of the list.
Create a new node with the value 1
Traverse the linked list to reach the last node
Set the next pointer of the last node to the new node
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.
Interview was problem solving
I applied via Indeed and was interviewed in Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.
Question were very basic from array and stacks
SDLC lifecycle involves planning, designing, developing, testing, deploying, and maintaining software components and architecture.
SDLC (Software Development Life Cycle) includes phases like planning, designing, coding, testing, and maintenance.
Components are designed, developed, tested, and integrated into the overall architecture.
Architecture involves defining the structure, behavior, and interactions of software comp...
I was interviewed before Sep 2020.
Round duration - 120 minutes
Round difficulty - Easy
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.
This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.
Given a 2-dimensional boolean matrix mat
of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
Iterate through the matrix and mark rows and columns to be modified
Use additional arrays to keep track of rows and columns to be modified
Update the matrix in-place based on the marked rows and columns
Round duration - 60 minutes
Round difficulty - Easy
It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Tip 1 : Never give up
Tip 2 : When u start a topic, don't move on to next topic before you are 100% confident in previous topic
Tip 3 : Try to give maximum time on basics of a topic especially OOPS
Tip 4 - Practice Atleast 250 Questions
Tip 5 - Ex- Do atleast 2 projects
Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly
Tip 3 : Don't make any silly spelling mistakes on resume
I applied via Referral and was interviewed before Oct 2022. There was 1 interview round.
Coding test around front end using react
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Teaching Assistant
138
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Manager
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Associate
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Admission Counsellor
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager
16
salaries
| ₹0 L/yr - ₹0 L/yr |
upGrad
Simplilearn
Unacademy
BYJU'S