Filter interviews by
Clear (1)
I was interviewed in Oct 2020.
Round duration - 90 mintues
Round difficulty - Easy
The round contain 20 MCQ and 2 coding questions.
You are given a jar containing candies with a maximum capacity of 'N'. The jar cannot have less than 1 candy at any point. Given 'K', the number of candies a customer want...
Given a jar with 'N' candies, determine the number of candies left after providing 'K' candies to a customer.
Check if 'K' is greater than 'N', return -1 if invalid
Subtract 'K' from 'N' to get the remaining candies
Output the remaining candies for each test case
The selection process in the Indian Navy includes a fitness test conducted in seawater, where a group of 3 trainees undergo a swimming test over three rounds....
Calculate average oxygen levels of trainees in Indian Navy fitness test and select fittest based on rules.
Parse input to get oxygen levels of trainees after each round
Calculate average oxygen level for each trainee over three rounds
Select trainee(s) with highest average oxygen level, considering tie and fitness rules
Print the fittest trainee(s) in increasing order or 'Unfit' if average level is below 70
Round duration - 45 mintues
Round difficulty - Easy
Easy question where asked basic type like what is difference between inteprator and compiler. Method to prevent deadlock and best way to implement Fibonacci series.
Given two integers X
and Y
as the first two numbers of a series, and an integer N
, determine the Nth element of the series following the Fibonacci rule: f(x) = f(x...
Calculate the Nth element of a modified Fibonacci series given the first two numbers and N, with the result modulo 10^9 + 7.
Implement a function to calculate the Nth element of the series using the Fibonacci rule f(x) = f(x - 1) + f(x - 2)
Return the answer modulo 10^9 + 7 as the result may be very large
The series is 1-based indexed, and the initial numbers X and Y can be between -10^6 and 10^6
Handle up to 100 test case
Given a singly linked list of integers, you need to reverse alternate nodes and append them to the end of the list.
1->2->3->4
Reverse alternate nodes in a singly linked list and append them to the end of the list.
Traverse the linked list and reverse alternate nodes while keeping track of odd and even indices.
Append the reversed alternate nodes to the end of the list.
Handle edge cases like empty list or single node list.
Consider using two pointers to keep track of the nodes to be reversed.
Tip 1 : Practice as many question you can
Tip 2 : Focus on key concept
Tip 3 : Practice previous year question
Tip 1 : Specify at least one good project
Tip 2 : Write only those things which you know in detail
Top trending discussions
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I was interviewed before Jun 2021.
Round duration - 180 minutes
Round difficulty - Easy
It was an mcq + coding round. There were aptitude and ouput based question in mcq. And coding questions were easy
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an array of integers from 0 to (N-2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number with a frequency greater than 1 as the duplicate number.
Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
You are provided with a string S
and an array of integers A
of size M
. Your task is to perform M
operations on the string as specified by the indices in array A
...
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
Iterate through the array of indices and reverse the substrings accordingly
Ensure the range specified by each index is non-empty
Return the final string after all operations are completed
Round duration - 60 Minutes
Round difficulty - Easy
It was technical + hr round. there were 2 people as interviewer. They stated from intro and asked some basic puzzles and hr questions. After that they asked about my projects, technologies and some ds algo and dbms questions.
Tip 1 : Practice aptitude
Tip 2 : Focus on practicing coding
Tip 3 : Learn from mistakes
Tip 1 : Mention some projects that you have done
Tip 2 : Try to have skills that are required for the role
based on 1 review
Rating in categories
Operations Executive
253
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
151
salaries
| ₹0 L/yr - ₹0 L/yr |
System Engineer
126
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
118
salaries
| ₹0 L/yr - ₹0 L/yr |
IT Manager
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Wipro
Amazon
TCS
Infosys