i
Diverse
Lynx
Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2021. There were 3 interview rounds.
Yes, I am open to relocating for the right opportunity.
I am willing to relocate for career growth and new experiences
I have relocated in the past for work and am familiar with the process
I am open to considering different locations and researching the area
I understand that relocation may come with some challenges but I am prepared to face them
Top trending discussions
posted on 31 May 2022
I applied via Naukri.com and was interviewed before May 2021. There were 3 interview rounds.
Easy
posted on 23 Mar 2021
I applied via Recruitment Consultant and was interviewed in Sep 2020. There were 3 interview rounds.
posted on 4 Aug 2022
I applied via Approached by Company and was interviewed before Aug 2021. There were 2 interview rounds.
posted on 24 May 2024
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
Spring boot application with junit test cases.
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 3 reviews
Rating in categories
Technical Recruiter
128
salaries
| ₹2 L/yr - ₹6 L/yr |
Senior Software Engineer
82
salaries
| ₹4.2 L/yr - ₹14 L/yr |
Software Engineer
78
salaries
| ₹3.5 L/yr - ₹9.8 L/yr |
Senior Technical Recruiter
60
salaries
| ₹2.9 L/yr - ₹6.6 L/yr |
Senior IT Recruiter
43
salaries
| ₹3 L/yr - ₹7 L/yr |
Mobile Programming
Arcesium
Solartis Technology Services
Programmers.io