Filter interviews by
I was interviewed in Jan 2021.
Round duration - 90 mintues
Round difficulty - Medium
The round contain 20 medium MCQ question ranging from Mathematics and Data Structure questions And at the last 2 coding questions.
Given a string STR
of length N
, your task is to remove all the vowels from that string and return the modified string.
The first line of input contains an integer 'T' ...
Write a program that takes an integer N
as input and prints a specific pattern for N
lines.
N=3
[[1, 2, 3, 10, 11, 12], [4, 5, 8, 9], [6, 7]]
Tip 1 : Data structure and algorithms
Tip 2 : Practise Maths
Tip 3 : Practise English
Tip 1 : Write only that thing which you can explain there.
Tip 2 : Also Specify Your project and the part of the project you did.
Top trending discussions
posted on 9 Jul 2024
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
First round was aptitude + coding. 60 questions in 60 mi , 30 about aptitude (mostly quants) , 30 about coding mcqs related to dsa ,oops. There was negative marking also.
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
It was a 2 hour test with medium level questions
posted on 21 Jun 2024
BFS tree traversal visits nodes level by level starting from the root.
Start at the root node and visit its children before moving on to the next level.
Use a queue data structure to keep track of nodes to visit next.
BFS is often used to find the shortest path in unweighted graphs.
posted on 24 Dec 2022
I applied via campus placement at Birla Institute of Technology and Science (BITS), Pilani and was interviewed in Jun 2022. There were 4 interview rounds.
There were 2 DSA medium level questions
I was interviewed in Oct 2020.
Round duration - 60 minutes
Round difficulty - Medium
There were 25 mcqs and 1 coding question. OS, aptitude, C and C++ concepts were the main focus.
You are given a positive integer 'N'. Your objective is to determine the number of ways to express 'N' as the sum of two or more consecutive natural numbers.
...Approach:
In this brute force approach,. We will iterate from 1 to ‘N’ using the iterator i and will check if there is a possible sequence of consecutive positive integers such that their sum is ‘N’, and the ending integer of the consecutive sequence is 'i'. The checking will be done as follows:
Round duration - 60 minutes
Round difficulty - Medium
It was of 60 minutes,
Questions asked were
1. Swap without temp variable
2. A problem question in which I was asked to find the ball with odd weight out of the remaining in the least number of attempts and write an algorithm for it.
3. Code to insert in the middle of circular linked list, code to find middle element of a singly linked list with knowing the number of elements in it.
4. Socket programming
5. Operating system concepts
6. Types of joins in DBMS
7. A DBMS query
8. Print in C without a semi colon
9. If I have any questions in the end.
Your task is to interchange the values of two numbers given as variables 'X' and 'Y' without using a temporary variable or any additional variable.
Y...
Tip 1 : Brush up your operating systems concept
Tip 2 : study Computer Architecture
Tip 3 : Emphasise more on theoretical concepts rather than coding concepts, Nvidia is a hardware company and deals with kernel level drivers mostly.
Tip 1 : Put C and C++ as yours skills if you have it
Tip 2 : Do not lie about your skills , be specific
posted on 14 Sep 2021
I was interviewed in Apr 2021.
Round duration - 60 Minutes
Round difficulty - Medium
It was basically to check my problem solving and OOPS concepts. Also , concepts related to development were asked
Ninja wants to create a pattern using characters in a specified number of rows ‘N’. The pattern arranges characters in increasing order, such that the first row has 1 chara...
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
Alex and Rome are engaged in a treasure hunt game. Rome has a treasure box that Alex aims to open, using one of the N uniquely numbered keys placed by Rome in boxes numbere...
Round duration - 90 Minutes
Round difficulty - Easy
It was an HR cum Technical round taken by a senior member of the technical team
Help Ninja sort the provided list of strings according to a specific condition given by a monster. The condition is to sort the strings based on the last letter. If two...
Ninja has a square 2D array arr
of size N x N
. Your task is to determine if the numbers on the left diagonal are the same as those on the right diagonal of the matrix.
Tip 1 : Stay Calm & Composed during the Interview
Tip 2 : Prepare for OOPS & DSA well
Tip 3 : Make at least 2 to 3 projects
Tip 1 : Make a concise & precise resume.
Tip 2 : Do not add too many projects. Add only 2-3 good projects
I applied via LinkedIn and was interviewed in Feb 2024. There were 2 interview rounds.
40 MCQ's, 2 Coding question
Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
Dijkstra's Algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.
It works by maintaining a set of nodes whose shortest distance from the starting node is known.
The algorithm iteratively selects the node with the smallest distance and updates the distances of its neighb...
posted on 24 Dec 2022
I applied via campus placement at International Institute of Information Technology (IIIT), Allahabad and was interviewed in Jun 2022. There were 3 interview rounds.
Two easy coding problems with few mcqs
Google Contacts is a web-based address book application.
Users can add, edit, and delete contacts
Contacts can be organized into groups
Users can import and export contacts
Contacts can be searched and filtered
Integration with other Google services like Gmail and Calendar
DSA, Behavioural, os, some networks basics