Filter interviews by
I applied via Referral and was interviewed before Sep 2022. There were 2 interview rounds.
I am currently located in New York City.
New York City
Specific address: 123 Main Street, New York, NY
Nearby landmarks: Central Park, Empire State Building
Top trending discussions
I applied via Hirect and was interviewed in May 2022. There were 2 interview rounds.
Induction process is a formal introduction of new employees to the organization and its culture.
Orientation on company policies and procedures
Introduction to colleagues and supervisors
Training on job responsibilities and expectations
Explanation of benefits and compensation
Tour of facilities and work areas
HR processes are the set of activities and procedures that HR departments use to manage employees throughout their employment lifecycle.
Recruitment and selection
Onboarding and orientation
Performance management
Compensation and benefits
Training and development
Employee relations
Offboarding and exit interviews
I applied via Naukri.com and was interviewed in Feb 2024. There were 3 interview rounds.
AI Bot Test via chat gpt
Technical Coding testing
Assignment shared by client
I applied via Naukri.com and was interviewed in Jun 2021. 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
posted on 20 Feb 2024
I applied via Campus Placement and was interviewed before Feb 2023. There was 1 interview round.
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 2 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
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