Filter interviews by
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values based on keys.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.
If multiple keys hash to the same index, a linked list is used to handle collisions.
To retrieve a value, the key is hash...
Find anagrams from a string array
Iterate through each string in the array
Sort the characters of each string to create a key for comparison
Use a hashmap to group anagrams together
Return the grouped anagrams as arrays
A top view of a binary tree shows the nodes visible when looking at the tree from the top.
The top view of a binary tree is the set of nodes visible when looking at the tree from the top.
Nodes at the same horizontal distance from the root are considered at the same level.
Use a map to store the horizontal distance of each node and only keep the first node encountered at each horizontal distance.
Height of a binary tree is the maximum number of edges on the longest path from the root node to a leaf node.
Height of an empty tree is -1
Height of a tree with only one node is 0
Height of a binary tree can be calculated recursively by finding the height of left and right subtrees and adding 1 to the maximum of the two heights
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Top trending discussions
posted on 8 Jul 2024
I applied via LinkedIn and was interviewed before Jul 2023. There were 2 interview rounds.
Java program to find longest substring palindrome
Handle dynamic web elements by using techniques like waiting, locating by attributes, and using explicit waits.
Use implicit waits to wait for elements to load before interacting with them
Locate elements by attributes like ID, class name, xpath, etc.
Use explicit waits to wait for specific conditions before proceeding
Handle dynamic elements by using dynamic locators or regular expressions
Use frameworks like Selenium for ...
posted on 8 May 2024
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
posted on 31 Oct 2023
I applied via Walk-in and was interviewed before Oct 2022. There were 4 interview rounds.
posted on 17 Oct 2023
I applied via Referral and was interviewed in Sep 2023. There were 4 interview rounds.
1 Leetcode Medium Problem - Interviewer was very friendly and was looking for the thought process instead of a mugged up solution
posted on 23 Nov 2023
I applied via Referral and was interviewed in Mar 2023. There were 2 interview rounds.
posted on 27 Jun 2022
I applied via Walk-in
posted on 25 Mar 2024
I applied via Naukri.com and was interviewed before Mar 2023. There were 4 interview rounds.
based on 2 interview experiences
Difficulty level
Duration
Software Engineer
1k
salaries
| ₹5 L/yr - ₹15.5 L/yr |
System Engineer
431
salaries
| ₹5 L/yr - ₹10 L/yr |
Senior Software Engineer
385
salaries
| ₹8 L/yr - ₹25.8 L/yr |
Automation Test Engineer
357
salaries
| ₹5 L/yr - ₹12 L/yr |
Software Engineer II
302
salaries
| ₹8 L/yr - ₹13.5 L/yr |
Siemens
Oracle
Amdocs
Automatic Data Processing (ADP)