Hinge Health Software Development Engineer II Interview Questions and Answers

Q1. Build a Hash Map which does everything in o(1)
Ans. 
Use a combination of hash table and linked list to achieve O(1) operations for a Hash Map.
• Use a hash table to store key-value pairs and a linked list to handle collisions.

• Implement a hash function to map keys to indices in the hash table.

• For each key, calculate the hash value and store the corresponding value in the hash table at that index.

• To handle collisions, use separate chaining with linked lists at each index of ...read more
Answered by AI
Add your answer
Q2. Buy and Sell Stock 4
Add your answer

There were 2 easy-medium coding questions

Mental and Verbal aptitude - 1 hour

Q1. Basic C++, DSA questions
Add your answer

Question related to operating system and computer network

Q1. Traverse all child nodes in tree
Ans. 
Traverse all child nodes in a tree data structure
• Use depth-first or breadth-first traversal algorithms

• Recursively visit each child node starting from the root node

• Consider using a stack or queue data structure for traversal

• Example: Traverse all nodes in a binary tree
Answered by AI
Add your answer

Q1. Question related to cloud and oops
Add your answer

Q1. Question related to my background and how web site work
Add your answer

Q1. Java springboot basic to intermediate question
Add your answer
Q2. Java stream questions
Add your answer

Q1. Easy level DSA questions
Add your answer
Q2. Project based questions
Add your answer

Q1. String based questions in java
Add your answer
Q2. What are the fundamental concepts of Java?
Ans. 
Fundamental concepts of Java include OOP, platform independence, memory management, and exception handling.
• Object-oriented programming (OOP) - Java is based on classes and objects, allowing for encapsulation, inheritance, and polymorphism.

• Platform independence - Java code can run on any platform with the help of JVM (Java Virtual Machine).

• Memory management - Java has automatic garbage collection to manage memory effici...read more
Answered by AI
Add your answer

Java based questions and few DSA questions

1) Finding and removing loop in linked list. 2)find pair of given sum in binary tree

Q1. Print bottom view of binary tree
Ans. 
Print the bottom view of a binary tree
• Use a map to store the horizontal distance and node value at each level

• Perform a level order traversal of the binary tree

• Update the map with the node value at each horizontal distance

• Print the node values in the map for the bottom view
Answered by AI
Add your answer
Q2. Oops related output based questions
Add your answer