Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed before Dec 2019. There were 3 interview rounds.
Top trending discussions
I was interviewed in Sep 2024.
An aptitude test evaluates an individual's potential to excel in a specific area by assessing their strengths and weaknesses in particular abilities.
An assessment that measures an individual's inherent abilities and potential for success in a specific activity.
A coding test is a programming assessment designed to evaluate a candidate's coding skills. It is a standard component of the technical hiring process for software developers and programmers.
Assessment that evaluates a candidate's coding skills
Group discussion (GD) topics for interviews may cover areas such as business, social issues, and current affairs. GDs serve to evaluate a candidate's communication, leadership, and teamwork abilities.
Discussion assignments are prompts that your teacher may assign to you. By participating in these discussions, you can reflect on your learning, share ideas and opinions, or ask and answer questions. Discussions may require you to respond to individual questions or provide multiple responses to an ongoing conversation.
I was interviewed in Feb 2025.
The test was easy basic aptitude questions.
posted on 31 May 2022
I was interviewed in Sep 2021.
Round duration - 180 min
Round difficulty - Hard
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The problem involves finding the length of the longest common subsequence between two given strings.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'ac
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
You are given an unsorted array containing 'N' integers. Your task is to find the 'K' largest elements from this array and return them in non-decreasing order.
T...
Yes, the problem can be solved in less than O(N*log(N)) time complexity using the Quick Select algorithm.
Implement Quick Select algorithm to find the Kth largest element in O(N) time complexity.
Partition the array around a pivot element and recursively search in the left or right partition based on the position of the pivot.
Once you find the Kth largest element, return all elements greater than or equal to it in non-de
Round duration - 60 Minutes
Round difficulty - Medium
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a Binary Search Tree (BST).
A Binary Search Tree (BST) is def...
Find the size of the largest BST subtree in a binary tree.
Traverse the tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST found so far.
Recursively check if the current subtree is a BST and update the size accordingly.
Given 'N' 2-dimensional matrices and an array ARR
of length N + 1
, where the first N
integers denote the number of rows in each matrix and the last integer represents t...
Find the minimum number of multiplication operations required to multiply a series of matrices together.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the minimum number of operations needed to multiply matrices.
Iterate through different combinations of matrices to find the optimal solution.
Consider the dimensions of the matrices to determine the number of operations required.
Calcu...
Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.
Li...
Rotate a linked list by K positions in a clockwise direction.
Traverse the linked list to find the length and the last node.
Connect the last node to the head to form a circular linked list.
Find the new head by moving (length - K) steps from the last node.
Break the circular list at the new head to get the rotated linked list.
Round duration - 45 minutes
Round difficulty - Easy
You are provided with a string STR
of length N. The task is to find the longest palindromic substring within STR
. If there are several palindromic substring...
Given a string, find the longest palindromic substring within it.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring
Tip 1 : be thoroughly prepared with dsa
Tip 2 : focus on dbms.
Tip 3 : be prepared with skills mentioned in resume
Tip 1 : mention some good projects
Tip 2 : don't put false statement
posted on 15 Aug 2023
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
IT WAS 3RD CODING ROUND IN WHICH 3 CODING QUESTIONS AND DURATION 75MIN
posted on 31 May 2022
I was interviewed in Sep 2021.
Round duration - 60 minutes
Round difficulty - Medium
Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.
You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i]
and RIGHT_CHILD[i]
arrays. Dete...
The task is to determine if the given binary tree nodes form exactly one valid binary tree.
Check if there is only one root node (a node with no parent)
Check if each node has at most one parent
Check if there are no cycles in the tree
Check if all nodes are connected and form a single tree
Round duration - 75 minutes
Round difficulty - Medium
This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.
You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.
A balanced binary t...
The maximum number of balanced binary trees possible with a given height is to be counted and printed.
A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.
The number of balanced binary trees can be calculated using dynamic programming.
The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...
Round duration - 60 minutes
Round difficulty - Medium
This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.
Your goal is to sort a given unsorted array ARR
such that it forms a wave array.
After sorting, the array should satisfy the wave pattern conditions:
ARR[0] &...
The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.
Iterate through the array and swap adjacent elements if they do not follow the wave pattern
Start from the second element and compare it with the previous element, swap if necessary
Continue this process until the end of the array
Repeat the process for the remaining elements
Return the sorted wave array
You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any ...
The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).
Traverse the binary tree in a bottom-up manner
For each node, check if it forms a BST and calculate the sum of its subtree
Keep track of the maximum sum encountered so far
Return the maximum sum
Round duration - 135 minutes
Round difficulty - Hard
This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.
Given a Binary Search Tree (BST) and a target value K
, determine if there exist two unique elements in the BST such that their sum equals K
.
An integer T
, the nu...
The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.
Traverse the BST in-order and store the elements in a sorted array
Use two pointers, one at the beginning and one at the end of the array
Check if the sum of the elements at the two pointers is equal to the target 'K'
If the sum is less than 'K', move the left pointer to the right
If the sum is grea...
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Implement a function that takes the binary tree, target node, and distance K as input.
Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.
Keep track of the distance from the current node to the target node while traversing.
When the distance equals K, add the current node to the result lis...
Round duration - 20 minutes
Round difficulty - Easy
This was the simple 20 minutes round
Tip 1 : Try to solve some good questions from every topic.
Tip 2 : If not have much time, then you can solve top interview questions from Leetcode.
Tip 3 : Made 2-3 good projects using any technology
Tip 1 : Keep resume short and crispy.
Tip 2 : Add coding profile handles and github link.
posted on 11 Dec 2024
All multiple-choice questions on object-oriented programming and pointers.
Questions related to linked lists and trees.
Three questions, all regarding LinkedIn, focusing on lists and trees.
posted on 20 Jan 2025
I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.
Basic multiple-choice questions on programming languages.
DSA round 1 , 3 questions on arrays, LL, trees
DSA round 2 : 3 questions on stack and queue, trees, dp
posted on 24 Jul 2024
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
In first round there were two test
1st is the personality test.
2nd is the aptitude test were they asked about 10 aptitude questions and around 40 coding based questions, some of them were mcq and rest were output based.
Contains 4 DSA based questions, 1 question was hard, and other 3 questions were of medium level.
Software Engineer
77
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
E-Commerce Analyst
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
18
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech