HMR Technologies Interview Questions and Answers

It was good and basic questions were asked.

It was good and basic coding questions were asked.

Q1. Data structures, Java nd some codes were asked
Add your answer

Q1. Data structures, time complexities, os and cn were asked
Add your answer

There was all aptitude topics covered almost , 2coding questions, english

Q1. It was a technical interview, where i was asked about my introduction, oops concepts, sql, codes related to linked list
Add your answer
Q2. In the second technical interview it was oops again and also the coding questions related to linkedlist and trees which was asked more optimised for every solution i gave..
Add your answer

Q1. React js and full stack
Add your answer
Q2. Java scirpt and golang
Add your answer
Q3. Mango db also microservices
Add your answer

Q1. Longest consecutive sequence
Ans. 
Find the length of the longest consecutive sequence in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in ascending order.

• Iterate through the sorted array and keep track of the longest consecutive sequence.

• Return the length of the longest consecutive sequence.
Answered by AI
Add your answer
Q2. Time Complexity of all sorting algorithms
Ans. 
Sorting algorithms have different time complexities.
• Time complexity refers to the amount of time it takes for an algorithm to run as the input size increases.

• Some common sorting algorithms and their time complexities are: Bubble Sort (O(n^2)), Insertion Sort (O(n^2)), Selection Sort (O(n^2)), Merge Sort (O(n log n)), Quick Sort (O(n log n)), Heap Sort (O(n log n)).

• The time complexity of an algorithm helps in understand...read more
Answered by AI
Add your answer

Q1. What is your experience with previous company
Add your answer

Practice standard questions

Q1. Search in rotated sorted array
Ans. 
Search for a target element in a rotated sorted array.
• Use binary search to find the pivot point where the array is rotated.

• Divide the array into two sorted subarrays based on the pivot point.

• Perform binary search on the appropriate subarray to find the target element.
Answered by AI
Add your answer
Q2. Trim a bst in leet code
Ans. 
Trim a binary search tree by removing nodes outside a given range.
• Start by checking if the root node is within the given range.

• If the root node is outside the range, trim it by recursively trimming its left or right subtree.

• If the root node is within the range, recursively trim its left and right subtrees.
Answered by AI
Add your answer

Gave alien dictionary (hard question) from gfg.

Q1. Gave medium questions from graph, basically BFS, DFS questions. Left view of a BST.
Add your answer

Q1. Based on job description
Add your answer

Q1. Some artchitecture questions
Add your answer

Data structures and oops

Q1. Performance and technical questions
Add your answer