Hoonartek Technical Support Engineer Interview Questions and Answers

Round duration - 40 minutes
Round difficulty - Medium

Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?

Q1. 
Flip Bits Problem Explanation
Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...read more
Ans. 
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
• Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

• Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.

• Return the maximum count of 1s obtained by flipping a sub-array at most once.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

Asked 1 standard algorithm

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

• Mark visited cells to avoid redundant traversal.

• Increment island count whenever a new island is encountered.
Answered by AI
Add your answer

SQL questions and query output.

Q1. I had interview on SQL and pl SQL. So the interview started with basic sql questions and then level increased. Question were asked on joins, union, rank, dense rank. Indexes, triggers. I was asked to ri...read more
Add your answer

Q1. Mostly on OOP's basic and some tricky questions related SOLID concepts
Add your answer

Leet code medium level question

Q1. About Java Streams
Add your answer
Q2. Restful API coding completion based on given file
Add your answer

Q1. To check your attitude
Add your answer
Q2. Given detailed about company and what project you are going to work on?
Add your answer

Q1. Hashmap working
Ans. 
Hashmap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
• Hashmap uses a hashing function to map keys to indices in an array.

• It allows for constant time complexity O(1) for insertion, deletion, and retrieval operations.

• Example: HashMap<String, Integer> map = new HashMap<>(); map.put("key", 123); int value = map.get("key");
Answered by AI
Add your answer
Q2. Multithreading cases
Add your answer
Q3. Scenario specific on how to handle multiple events on a single variable to have accurate result
Add your answer
Q4. Database indexing
Add your answer
Q5. Architecture level
Add your answer