Filter interviews by
I appeared for an interview in Mar 2025, where I was asked the following questions.
Effective strategies for handling difficult situations include clear communication, problem-solving, and maintaining a positive attitude.
Stay calm and assess the situation: For example, take a moment to breathe and gather your thoughts before responding.
Communicate clearly: Use 'I' statements to express your feelings, such as 'I feel overwhelmed when deadlines are tight.'
Seek solutions collaboratively: In a team settin...
In five years, I envision myself as a skilled engineer, leading projects and contributing to innovative solutions in my field.
I aim to take on leadership roles, guiding junior engineers and fostering teamwork.
I plan to specialize in a specific area, such as renewable energy or automation, to deepen my expertise.
I hope to contribute to impactful projects that enhance efficiency and sustainability in engineering.
I envisi...
Top trending discussions
posted on 17 Oct 2021
I applied via Naukri.com and was interviewed before Oct 2020. There were 4 interview rounds.
Apti test on ps and measures
I appeared for an interview before Mar 2024, where I was asked the following questions.
I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.
posted on 20 Feb 2024
I applied via Campus Placement and was interviewed before Feb 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed before Apr 2023. There were 4 interview rounds.
GD checking the communication
I applied via Naukri.com and was interviewed before Jun 2020. There was 1 interview round.
posted on 18 May 2021
I applied via Walk-in and was interviewed before May 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2021. There were 4 interview rounds.
90 minute test on hacker rank consisting of 3 coding questions all of medium difficulty. Most candidates are required to solve more than 1 question.
Find the lowest common ancestor of a binary tree.
Traverse the tree recursively from the root node.
If the current node is null or matches either of the given nodes, return the current node.
Recursively search for the nodes in the left and right subtrees.
If both nodes are found in different subtrees, return the current node.
If both nodes are found in the same subtree, continue the search in that subtree.
Find first missing positive integer from an array of non-negative integers.
Create a hash set to store all positive integers in the array
Loop through the array and add all positive integers to the hash set
Loop through positive integers starting from 1 and return the first missing integer not in the hash set
Design a parking lot
Consider the size and capacity of the parking lot
Decide on the layout and organization of parking spaces
Implement a system to manage parking availability and reservations
Include features like ticketing, payment, and security
Consider scalability and future expansion
Find the largest island area in a grid representing an ocean using DFS or BFS.
Use Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the grid.
Mark visited cells to avoid counting them multiple times.
Count the size of each island during the traversal.
Example: For a grid [[1,0,0],[1,1,0],[0,0,1]], the largest island has area 3.
Keep track of the maximum area found during the exploration.
Group list of strings into distinct anagrams.
Create a hash table with sorted string as key and list of anagrams as value.
Iterate through the list of strings and add each string to its corresponding anagram list in the hash table.
Return the values of the hash table as a list of lists.
based on 1 interview experience
Difficulty level
Duration
Trainee Analyst
32
salaries
| ₹2 L/yr - ₹3 L/yr |
Project Administrator
16
salaries
| ₹10.5 L/yr - ₹18.5 L/yr |
HR Executive
10
salaries
| ₹1.5 L/yr - ₹4.2 L/yr |
Analyst
9
salaries
| ₹2.2 L/yr - ₹2.4 L/yr |
SAP Basis Consultant
8
salaries
| ₹4 L/yr - ₹12 L/yr |
Mobile Programming
Diverse Lynx
Arcesium
Solartis Technology Services