Filter interviews by
I appeared for an interview in Oct 2024, where I was asked the following questions.
I left my previous job to pursue better growth opportunities and align with my career goals in a more dynamic environment.
Seeking better career advancement: I realized that the growth opportunities in my current role were limited.
Desire for a more dynamic environment: I wanted to work in a setting that encourages innovation and adaptability.
Alignment with long-term goals: My career aspirations shifted, and I wanted a r...
I applied via Company Website and was interviewed in Sep 2022. There were 3 interview rounds.
It was good nd overwhelming nd most importantly the way you answer or more precisely Presentation is all about .. Just give ur Best nd forget about rest !
Group discussion is all about team work , weather we are suitable for work in a company under so many people this is what they want to see .. coz everyone work differently when they work alone but the pressure they can bear or not and communication nd understanding behaviour this is all they want to know which can be seen in our resume.
Top trending discussions
I applied via Referral and was interviewed before Feb 2021. There were 2 interview rounds.
I expect a competitive salary that reflects my experience and the responsibilities of the Team Leader role.
Research industry standards: For example, similar roles in our region typically offer between $70,000 and $90,000.
Consider my experience: With over 5 years in leadership positions, I believe a salary in the upper range is justified.
Emphasize value: I aim to bring innovative solutions and improve team performance, ...
I applied via Referral and was interviewed before Sep 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I successfully led projects that improved efficiency, increased sales, and enhanced team collaboration in my previous roles.
Increased sales by 20% in one year by implementing a new marketing strategy.
Led a team of 10 in a project that reduced operational costs by 15%.
Developed a training program that improved employee performance and satisfaction.
Successfully managed a cross-departmental initiative that streamlined com...
I applied via Walk-in and was interviewed before Jun 2021. There were 2 interview rounds.
HR told about the company on the first day, how it works, told the rules, showed the management and a lot
I applied via Approached by Company and was interviewed before Jul 2021. There were 3 interview rounds.
I appeared for an interview before Jun 2021.
Round duration - 120 minutes
Round difficulty - Medium
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
Given a linked list where each node contains two pointers: one pointing to the next node and another random pointer that can point to any node within the list (or ...
Create a deep copy of a linked list with random pointers.
Iterate through the original linked list and create a new node for each node in the list.
Store the mapping of original nodes to new nodes in a hashmap to handle random pointers.
Update the random pointers of new nodes based on the mapping stored in the hashmap.
Return the head of the copied linked list.
Round duration - 60 Minutes
Round difficulty - Medium
Given an arbitrary array arr
consisting of N
non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...
Find the element that appears only once in an array where every other element appears thrice.
Use bitwise operations like XOR to find the unique element in linear time complexity.
XOR all elements in the array, the result will be the unique element.
Elements that appear thrice will cancel out each other in XOR operation.
Example: arr = [2, 2, 3, 2], XOR of all elements = 3 which is the unique element.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until a greater element is found or stack is empty
Round duration - 60 Minutes
Round difficulty - Medium
Given a Binary Search Tree (BST) of integers, your task is to convert it into a greater sum tree. In the greater sum tree, each node's value should be replaced with the sum...
Convert a Binary Search Tree into a Greater Sum Tree by replacing each node's value with the sum of all nodes' values greater than the current node's value.
Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.
Keep track of the running sum of visited nodes' values and update each node's value with this sum.
Recursively apply the above steps to all nodes in the BST.
Example: For input ...
You are given a linked list of N
nodes where each node contains values 0, 1, and 2 exclusively. Your task is to sort the linked list.
The first line contains an...
Sort a linked list containing values 0, 1, and 2 exclusively.
Use three pointers to keep track of nodes with values 0, 1, and 2 separately.
Traverse the linked list and move nodes to their respective positions based on their values.
Finally, concatenate the three lists in the order 0 -> 1 -> 2 to get the sorted linked list.
Round duration - 45 minutes
Round difficulty - Medium
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider edge cases like when the matrix is empty or when all cells are water (0s).
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
Find the maximum sum that can be obtained from a path in a matrix from the first row to the last row.
Use dynamic programming to keep track of the maximum sum at each cell.
Consider moving down, down-left, and down-right to calculate the maximum sum.
Start from the second row and update the values based on the maximum sum from the row above.
At the end, find the maximum sum in the last row to get the final result.
Tip 1 - Practice variety of questions
Tip 2 - Do atleast 2 projects
Tip 1 : Do good projects
Tip 2 : resume should be one page
based on 2 interview experiences
Difficulty level
Duration
based on 22 reviews
Rating in categories
Territory Sales Manager
5
salaries
| ₹5.2 L/yr - ₹8.8 L/yr |
Territory Manager
5
salaries
| ₹7.4 L/yr - ₹14.2 L/yr |
Business Analyst
4
salaries
| ₹7 L/yr - ₹19.3 L/yr |
Product Specialist
3
salaries
| ₹1.2 L/yr - ₹7.5 L/yr |
Executive Accountant
3
salaries
| ₹4.2 L/yr - ₹7.1 L/yr |
Amazon
Flipkart
BigBasket
JustDial