Filter interviews by
I applied via Campus Placement and was interviewed before Dec 2023. There were 4 interview rounds.
It was c++ coding test
I was interviewed in Oct 2020.
Round duration - 150 minutes
Round difficulty - Medium
Owing to the lockdown announced in view of the Covid-19 pandemic drive was conducted virtual.
Total Marks: 232 out of which 32 were for MCQ's and 200 for coding.
The time allowed: 2.5 hrs.
It was online proctored test and no tab switching is allowed.
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...
Clearly, the rope which is picked up first will be having its length included more than once in the final cost. If we pick a rope of larger length earlier, then we will be adding some extra cost to our final result.
So, the idea is to pick ropes of smaller lengths initially to minimize the impact on our final cost.
So, each time we will be finding two smallest ropes, connecting them and
adding the resu...
You are provided with a N x 2 2-D array called Jobs
consisting of N
jobs. In this array, Jobs[i][0]
represents the deadline of the i-th job, while Jobs[i][1]
indicates the...
The idea here is to follow a greedy approach that we should complete the job with the maximum profit in the nearest available slot within its deadline. So, we can sort the jobs in the decreasing order of their profit, and we can maintain a boolean array to keep track of the available slots. So, for each job, we traverse the array backward from the deadline associated with the job to 1, and if any of the ...
Round duration - 45 minutes
Round difficulty - Easy
On the day of interview I have revised all the core subjects and data structures and algorithms. Interview happened for 45 minutes and it went well.
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Approach:
We need to delete the node K from the linked list. The most general way to delete the node K from a singly linked list is to get access to the previous node of K. We can get access to the previous node by traversing from the head of the linked list. Let’s denote this previous node as P. Then, we update the next pointer of P to the next pointer of K.
Although the reference to node K is giv...
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
Here is the algorithm :
Given an array or list ARR
of N
positive integers and an integer K
, your task is to rearrange all elements such that those with the K-th
bit (considering the rightmost bit as '1st' bit) eq...
The idea is to simply iterate through the ‘ARR’ and check each element whether its ‘K-th’ bit is 0 or 1, and add the element to the respective group.
Here is the algorithm:
Round duration - 30 minutes
Round difficulty - Easy
Immediately after clearing 2nd round they called me for next round which went for 30 minutes. Interviewer is flexible and everything went well.
Round duration - 20 minutes
Round difficulty - Easy
After successfully clearing 2 rounds of technical interview there was HR round which took place for 20 minutes.
Tip 1 : Do 300 problems in Coding Platforms (4 a day).
Tip 2 : Participate in codechef, codeforces contests.
Tip 3 : Work on core subjects and communication skills.
Tip 1 : Highlight your key accomplishments and most relevant skills within top half.
Tip 2 : Mention one full stack project which you can explain clearly.
Tip 3 : Keep it simple and clean. Be honest.
Tip 4 : Only list hobbies if they are professionally relevant.
Top trending discussions
posted on 15 Oct 2024
I applied via Campus Placement
posted on 21 May 2024
1 hour, around 40 questions on well known aptitude topics.
Simple questions - overlapping area, bit manipulation
posted on 26 Sep 2024
Find the 2nd largest number in list
posted on 13 Aug 2024
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
DSA, basic questions on DSA
posted on 11 Jan 2023
I applied via Recruitment Consulltant and was interviewed in Dec 2022. There were 4 interview rounds.
2 questions Based on arrays level of medium
posted on 10 Feb 2025
I was interviewed before Feb 2024.
Coding problems, DSA
IQ Testing Problems, English
posted on 20 Jun 2022
I applied via Naukri.com and was interviewed in May 2022. There was 1 interview round.
posted on 17 May 2022
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Easy
Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored
Given three integers X
, Y
, and Z
, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X
, Y
, and Z
...
Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....
Round duration - 40 minutes
Round difficulty - Easy
Timing - 9:00 AM - 9:40 AM
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
N = 1
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
The given linked list is 1 -> 2 -> 3 -&g...
Round duration - 40 minutes
Round difficulty - Easy
Timing - 12:00 Pm to 12:40 PM
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
The first line contains an integer 'T', represen...
Round duration - 40 minutes
Round difficulty - Medium
Timing - 6:00 PM - 6:30 PM
Tip 1 : For fresher role, System design is not very important.
Tip 2 : Do at least 1-2 good quality projects.
Tip 1 : Have 1-2 good engaging projects in resume.
Tip 2 : Internships are helpful.
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
374
salaries
| ₹6.5 L/yr - ₹20 L/yr |
Senior Software Engineer
239
salaries
| ₹9.7 L/yr - ₹35 L/yr |
Software Developer
176
salaries
| ₹5.5 L/yr - ₹19.5 L/yr |
Software Engineer2
162
salaries
| ₹9.8 L/yr - ₹21 L/yr |
Software Engineer III
151
salaries
| ₹13 L/yr - ₹33 L/yr |
TCS
Infosys
Wipro
HCLTech