Filter interviews by
I applied via campus placement at Pimpri Chinchwad College of Engineering, Pimpri and was interviewed in Dec 2023. There were 2 interview rounds.
3 DSA Questions on Normal Fundamentals
An array of strings can be used to implement a stack data structure.
Use an array to store the elements of the stack.
Keep track of the top of the stack using an index variable.
Push elements onto the stack by adding them to the end of the array.
Pop elements from the stack by removing the element at the top of the array.
I applied via Campus Placement and was interviewed in Dec 2023. There were 2 interview rounds.
Questions were quite difficult.But some were easy
They tested basic concepts from this coding test.
Top trending discussions
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
Technical MCQ questions on core computer science subjects were asked.
posted on 25 Apr 2024
I applied via campus placement at Chitkara Institute of Engineering & Technology, Rajpura and was interviewed in Mar 2024. There were 2 interview rounds.
3 coding questions, very basic
I applied via Campus Placement and was interviewed in Oct 2022. There were 3 interview rounds.
There was apti round with good apti questions and also code debugging
Angle between hands of clock at 10:25 is 147.5 degrees. Trains will collide at midpoint of their initial positions.
To calculate angle between hands of clock, use formula: |(30*H)-(11/2)*M|
For 10:25, H=10 and M=25, so angle = |(30*10)-(11/2)*25| = 147.5 degrees
When two trains are traveling towards each other, their relative speed is added to get the collision speed.
The collision point is the midpoint of their initial po...
posted on 1 Oct 2023
I applied via Google updates and was interviewed before Oct 2022. There were 3 interview rounds.
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...
The main idea is to check if K is greater than N or not.
O(1).
Since we are not using any extra space to keep track of the elements.
Time Complexi...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....
The idea behind this approach is to calculate the average of all the rounds and store them in an array/list and then calculate the maximum of all the average remaining oxygen levels. If more than one have the same value then print the trainee number and if average is less than 70 then simply print “Unfit”.
Here is the complete algorithm:
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...
Let’s define a dp array of size N, where dp[i] represents the i-th Fibonacci number. For each block, let’s compute the answer in a top-down fashion, starting with the leftmost blocks (dp[0] and dp[1]). We will iterate through the array for i = 2 to N and then we can fill the array in a top-down manner like:
 ...
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
Take 2 variable fast and slow , fast=temp->next and slow = temp and then transverse slow will be at the middle of the linked list.
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
posted on 29 Oct 2021
I was interviewed before Oct 2020.
Round duration - 120 Minutes
Round difficulty - Hard
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
O(1).
Since only constant extra space is required.
Time Complexity: O(n^2)Explanation:O(N ^ 2), where ‘N’ is the number of rows or columns in the matrix.
&nb...
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
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...
The idea is to choose a peak value at the ‘dayNumber’ th index. Then we can create the array like a mountain with the peak of the mountain being at the ‘dayNumber’ th index. The sum of the elements of this array must be less than or equal to maxVaccines.If we find that the sum is greater, then we have chosen a high peak value, and if it is less, then it means we have chosen a smaller peak value. So we ...
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
posted on 23 Apr 2024
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Oct 2023. There were 3 interview rounds.
There were 3 dsa questions
posted on 16 Sep 2021
I was interviewed in Apr 2021.
Round duration - 30 Minutes
Round difficulty - Easy
Timing of test start from 11 AM and everything goes well here .
Round duration - 60 Minutes
Round difficulty - Easy
It happen nicely and no problem occur.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
Here is the algorithm :
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Round duration - 90 mintues
Round difficulty - Hard
Environment is very bad the intervier video call is lagging.
Given an array of size N
and Q
queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.
The idea is to create a function which would rotate the array one element at a time. This can be done by shifting the array towards left by one element and copying the first element to the end of the array. For every query repeatedly call the above function, until the desired rotation is obtained.
If the number of rotations required, say ‘K’, is greater than the number of elements, ‘N’,...
Tip 1 : Prepare Data structure and algorithm
Tip 2 : Focus on operating system
Tip 3 : RDBMS and CAO are also important
Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there.
Interview experience
Technical Support Engineer
177
salaries
| ₹2.6 L/yr - ₹9 L/yr |
Senior Software Engineer
118
salaries
| ₹9 L/yr - ₹34 L/yr |
Security Analyst
102
salaries
| ₹3 L/yr - ₹5.9 L/yr |
Software Support Specialist
64
salaries
| ₹3.5 L/yr - ₹6 L/yr |
Software Engineer
57
salaries
| ₹4.5 L/yr - ₹15 L/yr |
Zoho
Freshworks
TCS
HCLTech