Filter interviews by
I appeared for an interview 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' ...
Remove all vowels from a given string and return the modified string.
Iterate through each character in the string and check if it is a vowel (a, e, i, o, u or A, E, I, O, U).
If the character is not a vowel, add it to a new string.
Return the new string without any vowels.
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]]
The program takes an integer N and prints a specific number pattern for N lines.
Create a 2D list to store the pattern rows
Use loops to generate the numbers in each row based on the pattern
Print the 2D list as the final output
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 14 Sep 2021
I appeared for an interview 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...
Generate a pattern of characters in increasing order based on the number of rows specified.
Iterate through each row from 1 to N
For each row, print the corresponding character repeated row number of times
Increment the character for each row
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...
Maximize vaccines administered on a specific day while following certain rules.
Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.
Distribute vaccines in a way that the difference between consecutive days is at most 1 and the total does not exceed the maximum allowed.
Ensure to maximize the number of vaccines administered on the specified day.
Return the maximum nu...
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...
Given a list of key numbers in sequentially numbered boxes, help Alex determine the box containing the correct key.
Iterate through the list of key numbers and compare each with the target key number.
Use binary search for efficient search in the sorted list of key numbers.
Return the box number if the correct key is found, otherwise indicate that it is not present.
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...
Sort the list of strings based on the last character, then second last character, and so on.
Iterate through each string in the list
Sort the strings based on the last character first, then second last character, and so on
Use a custom sorting function to achieve the required sorting order
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.
Check if the numbers on the left diagonal are the same as those on the right diagonal of a square matrix.
Iterate through the matrix to compare the numbers on the left and right diagonals.
Keep track of the numbers on both diagonals and check for equality.
Return 'true' if the diagonals are equal, otherwise return 'false'.
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
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.
posted on 7 May 2025
I appeared for an interview in Apr 2025, where I was asked the following questions.
I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.
posted on 16 Sep 2021
I appeared for an interview in Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
Timing was 12 PM. Interviewer was nice.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from end to start and append each character to a new string.
Alternatively, use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the length of the string and number of test cases.
Your task is to rearrange a given array ARR
such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
Iterate through the array and maintain two pointers - one for the next position to place a zero and one for the next non-zero element.
Swap the elements at these pointers until all zeros are moved to the left and non-zero elements are in their relative order.
Time complexi...
SQL query to find the second highest salary from a table
Use the MAX() function to find the highest salary
Use the NOT IN operator to exclude the highest salary from the results
Order the salaries in descending order and limit the result to 1
Tip 1 : Do some projects.
Tip 2 : Practice problem solving questions.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
posted on 16 Nov 2021
I appeared for an interview in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Online test
Based on c++,c and java basics
MCQ questions based on C++, C, and Java basics.
Understand the differences between C++, C, and Java syntax and features.
Be familiar with basic concepts like data types, control structures, and functions.
Practice solving MCQs to improve your understanding of the languages.
Round duration - 150 Minutes
Round difficulty - Medium
Technical interview
The task is to determine the number of distinct elements in every sliding window of size 'K' across an array 'ARR' of size 'N'. A 'K' sized window is a contiguous sequ...
Calculate the count of distinct elements in each sliding window of size 'K' across an array 'ARR'.
Use a sliding window approach to iterate through the array and keep track of distinct elements using a hashmap or set.
Update the count of distinct elements in each window as it slides across the array.
Return the array detailing the count of distinct elements in each 'K' sized window for each test case.
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
The input consists of a single line contain...
Sort a Singly Linked List using Merge Sort algorithm.
Implement the Merge Sort algorithm for linked lists.
Divide the list into two halves, sort each half recursively, and then merge them.
Use a fast and slow pointer to find the middle of the list for splitting.
Handle the base cases of empty list or single node list.
Example: Input: 4 3 2 1 -1, Output: 1 2 3 4
Round duration - 20 minutes
Round difficulty - Hard
Hr interview
Tip 1 : Go through oosp concept properly
Tip 2 : Good knowledge on coding
Tip 3 : intermediate knowledge on database and data structures
Tip 1 : A project based on database
Tip 2 : Mention all the fields properly and have a prior knowledge on your project
posted on 15 Mar 2024
I applied via Job Fair and was interviewed before Mar 2023. There were 3 interview rounds.
2 data struture question advancevds i cpp
Implement a data structure for storing and manipulating an array of strings.
Use a dynamic array to store the strings.
Implement functions for adding, removing, and accessing strings in the array.
Consider memory management and resizing the array as needed.
Implement a shopping cart system using data structures and algorithms.
Use a data structure like a hash map to store items and their quantities in the cart.
Implement functions to add, remove, and update items in the cart.
Consider implementing functions to calculate total price, apply discounts, and handle checkout process.
Normal dsa Basics and aptitude.
Sterlite Technologies
Cisco
BT Business
Lumen Technologies