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
Design a parking lot with efficient layout and features
Consider the size and layout of the parking lot
Include designated spots for different types of vehicles (compact, regular, handicapped)
Implement a clear signage system for easy navigation
Incorporate security measures such as lighting and surveillance cameras
Include payment options for parking fees (e.g. ticket machines, mobile app)
Consider environmental factors lik
posted on 16 May 2023
A coding question and different questions on computer networks and os
I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.
Use indexing to access individual characters from a string.
Use square brackets and the index number to access a specific character in the string.
Remember that indexing starts at 0 in most programming languages.
Example: str = 'hello', to get the first character 'h', use str[0].
I applied via LinkedIn and was interviewed before Oct 2022. There were 3 interview rounds.
Oracle RDBMS concepts, core java, data structures
I applied via campus placement at International Institute of Information Technology (IIIT), Hyderabad and was interviewed before May 2023. There were 3 interview rounds.
It was basic DSA round consisting of DP question and Graph question.
I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 5 interview rounds.
Basic Coding questions around LRU Cache and Top View Tree Traversal
Multi threading and Internal Working of Hash Map!
Software Engineer
1.1k
salaries
| ₹5 L/yr - ₹15 L/yr |
System Engineer
468
salaries
| ₹5 L/yr - ₹9.5 L/yr |
Senior Software Engineer
428
salaries
| ₹6.7 L/yr - ₹25.9 L/yr |
Automation Test Engineer
363
salaries
| ₹5 L/yr - ₹10 L/yr |
Software Engineer II
301
salaries
| ₹7.5 L/yr - ₹13.3 L/yr |
Siemens
Veradigm
McKesson
Siemens Healthineers