Filter interviews by
Clear (1)
I applied via campus placement at Institute of Technical Education and Research, Bhuvaneshwar and was interviewed in Jun 2023. There were 4 interview rounds.
Average difficulty basic questions
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
More focus on dp,graphs.
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Graphs ,arrays , Hashmaps and Heaps
Changes on graph structure involve adding, removing, or modifying nodes and edges.
Adding a new node to the graph
Removing an existing node from the graph
Modifying the weight of an edge in the graph
posted on 5 Sep 2023
I applied via campus placement at Malviya National Institute of Technology (NIT), Jaipur and was interviewed before Sep 2022. There were 3 interview rounds.
This round had first questions about behavior, team work and hr type mcq questions.
Then there were 10 computer science mcqs. Then two coding questions.
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...
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 ...
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.
I was interviewed before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
2 easy problems for coding.
Given a positive integer N
, your task is to return all the prime numbers less than or equal to N
.
1) A prime number is a number that has only two factors:...
Given an array ARR
consisting of 'N' non-negative integers, compute the running absolute difference of elements at even and odd index positions, respectively.
Round duration - 30 minutes
Round difficulty - Hard
Face to face interview, design and coding involved.
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
I was interviewed in Jan 2021.
Round duration - 65 minutes
Round difficulty - Hard
Timing (6pm - 8pm)
Environment was user friendly
As usual the online round had three coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 65 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.
You are given two arrays ARR1
and ARR2
, containing N
and M
elements respectively. There are two types of 'good triplets' that need to be identified in these arrays.
Type ...
You are given a string str
consisting of N
lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...
Round duration - 40 minutes
Round difficulty - Medium
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Two trees are considered mirror of each other if...
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
Tip 1 : Must do questions from GFG.
Tip 2 : SDE sheet of striver can be helpful.
Tip 1 : Do at least 3 major web dev project
Tip 2 : should be precise and descriptive
Tip 3 : also add your past experiences in the resume
I was interviewed in Dec 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:30 PM.
Ninja is tasked with organizing a meeting in an office that starts at time ‘0’ and ends at time ‘LAST’. There are ‘N’ presentations scheduled with given start and end times....
Algorithm:
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
We can easily count the total number of paths by making a recursive algorithm.
The steps are as follows:
Round duration - 90 minutes
Round difficulty - Medium
This round was coding round with discussion .
The interviewer tried to trick the questions and wanted to test how we respond if something is asked out of preparation.
The code we ran on Google Docs was checked on Online IDE if it ran for sample inputs.
Timing : 12:00 PM to 1:30 PM
You are given a graph with 'N' vertices labeled from 1 to 'N' and 'M' edges. In one operation, you can shift an edge from being between two directly connected vertice...
For a graph with ‘N’ vertices to be connected, there must be at least ‘N’ - 1 edges in the graph. If a graph has less than ‘N' - 1 edges it is impossible to make the graph connected. Otherwise, it is always possible to make graph connected. As we need to find the minimum number of operations to make the graph connected we will think greedily. We will find the total number of connected components in...
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.
Round duration - 75 minutes
Round difficulty - Hard
This was a problem solving round and lasted for 75 minutes. The interviewer gave me a very complicated question.
The round was held on Google Meet and I was supposed to tell him the approach and write code on shared Google Docs.
Assume you initially have an empty array called ARR
. You are required to return the updated array after executing Q
number of queries on this array.
There are two types of que...
Tip 1 : prepare all Topics from Coding Ninjas of Course Competitive Programming. Also I practiced atleast one question everyday from sites like Leetcode,Interviewbit and also took part in Codeforces Contest.
Tip 2 : Though Data Structure is the base for any tech interview, one must know some other subjects as well like Operating System, Networking, and Database Management System for which I took help from Coding Ninja’s notes and from GeeksforGeeks.
Tip 1 : Keep your resume up to date and mention 2-3 good level projects which will give a good impression to the interviewer .
Tip 2 : Don't put false things on the resume.
I applied via LinkedIn and was interviewed in Dec 2023. There was 1 interview round.
based on 1 interview
Interview experience
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
Senior Software Engineer
39
salaries
| ₹16.5 L/yr - ₹41 L/yr |
Software Engineer
35
salaries
| ₹8 L/yr - ₹30.4 L/yr |
Devops Engineer
34
salaries
| ₹7 L/yr - ₹20 L/yr |
Cloud Security Engineer
30
salaries
| ₹6 L/yr - ₹18 L/yr |
Technical Lead
25
salaries
| ₹15 L/yr - ₹50 L/yr |
Splunk
OpenText Technologies
IBM
RSA Security