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
Manual testing is important for exploratory testing, usability testing, and ad-hoc testing.
Manual testing allows for exploratory testing where testers can explore the application and identify unexpected issues.
Usability testing, which involves real users interacting with the software, is best done manually to capture user experience.
Ad-hoc testing, where testers randomly test the application without predefined test cas...
Testing a web application for an online shopping platform
Testing the functionality of adding items to the cart and checking out
Testing the payment gateway integration for secure transactions
Testing the search functionality to ensure accurate results are displayed
Testing the responsiveness of the website on different devices and browsers
Big data refers to large volumes of structured and unstructured data that is too complex for traditional data processing applications.
Big data involves processing and analyzing large volumes of data to uncover patterns, trends, and insights.
It can come from various sources such as social media, sensors, devices, and business transactions.
Examples of big data technologies include Hadoop, Spark, and NoSQL databases.
Big d...
Oracle Cerner interview questions for popular designations
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There were 2 interview rounds.
Get interview-ready with Top Oracle Cerner Interview Questions
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Clear and general to the point questions
Moderate level questions on java
I applied via Recruitment Consulltant and was interviewed in Jan 2024. There were 6 interview rounds.
It went well. Easy questions were asked
We have to first explain how we are planning to solve the problem and can start coding
Algorithms in data structures are essential for efficient data manipulation and retrieval.
Algorithms in data structures help in organizing and managing data effectively.
Examples include sorting algorithms like quicksort and searching algorithms like binary search.
Understanding algorithms in data structures is crucial for optimizing performance in software development.
Top trending discussions
Interview experience
based on 1.3k reviews
Rating in categories
Software Engineer
1.1k
salaries
| ₹5 L/yr - ₹10.2 L/yr |
System Engineer
458
salaries
| ₹5 L/yr - ₹9.5 L/yr |
Senior Software Engineer
419
salaries
| ₹6.7 L/yr - ₹26.1 L/yr |
Automation Test Engineer
359
salaries
| ₹5.2 L/yr - ₹10 L/yr |
Software Engineer II
300
salaries
| ₹7.5 L/yr - ₹13.3 L/yr |
Siemens
Veradigm
McKesson
Siemens Healthineers