Hubilo Softech SDE-2 Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

Anytime

Q1. 
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
Input:
The input sta...read more
Ans. 
The task is to sort an array of 0s, 1s, and 2s in increasing order.
• Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.

• Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.

• While mid <= high, if ARR[mid] is 0, swap ARR[low] and ARR[mid], increment low and mid. If
Answered by AI
Add your answer
Q2. 
Connect Ropes with Minimum Cost
Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...read more
Ans. 
The task is to connect N ropes into one rope with minimum cost.
• Sort the array of rope lengths in ascending order.

• Initialize a variable to keep track of the total cost.

• While there are more than one rope, take the two shortest ropes and connect them.

• Add the cost of connecting the two ropes to the total cost.

• Replace the two shortest ropes with the connected rope.

• Repeat the above steps until only one rope remains.

• Return th
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Maximum Subarray Sum Problem Statement
Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Example of Sub...read more
Ans. 
The task is to find the maximum possible sum of a non-empty subarray of an array.
• Iterate through the array and keep track of the maximum sum encountered so far

• If the current element is greater than the sum so far, start a new subarray

• If the current element plus the sum so far is greater than the maximum sum, update the maximum sum

• Return the maximum sum
Answered by AI
Add your answer
Q2. 
Diameter of a Binary Tree Problem Statement
Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...read more
Ans. 
The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.
• The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.

• To find the diameter of a binary tree, we can use a recursive approach where we calcu...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was more aroung sytem design and my past work experience.

Q1. Can you describe the system design for a platform like BookMyShow and the questions that were raised during the discussion?
Ans. 
Design a bookmyshow system
• Design a system to book and manage movie tickets

• Consider features like seat selection, payment, and ticket cancellation

• Include user authentication and authorization

• Implement a database to store movie and theater information

• Consider scalability and performance of the system
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is non-tech round.They just want to check your nature ,attitude and team work skills.

Q1. Why do you want to leave your current job and what are your thoughts on the CTC being offered?
Ans. 
I want to leave my current job for better growth opportunities and a more challenging role.
• Seeking new challenges and opportunities for professional growth

• Looking for a role that aligns better with my skills and interests

• Desire to work in a more dynamic and innovative environment

• Seeking better compensation and benefits

• Wanting to expand my knowledge and skills in a different domain
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning about 10:00AM-10:40AM. The platform used for this round was hackerrank. There are 15 MCQ's which cover portions of Aptitude, Data Structures, DBMS, SQL

Q1. 
Minimum Operations Problem Statement
You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...read more
Ans. 
Minimum number of operations to make all elements in the array equal by performing addition, subtraction, multiplication, or division.
• Iterate through the array to find the maximum and minimum values.

• Calculate the difference between the maximum and minimum values.

• The minimum number of operations needed is the difference between the maximum and minimum values.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 7:00PM-7:20PM. Platform used for this round was skype. Interviewer was very serious while taking my interview.

Round duration - 360 minutes
Round difficulty - Hard

Timing- Any 6 hours of my choice in the 24 hour window. (10:00 p.m. to 4:00 a.m. I selected)
Environment was very friendly and easy to use.
No significant activity.
This was the only coding round.

Q1. 
Prime Time Again Problem Statement
You are given two integers DAY_HOURS and PARTS. The integer 'DAY_HOURS' represents the number of hours in a day, and the day can be divided into 'PARTS' equal parts. You...read more
Ans. 
Find total instances of equivalent prime groups in a day divided into equal parts.
• Iterate through each part of the day and check for prime pairs in different parts

• Use a helper function to check if a number is prime

• Ensure the day is evenly divided by parts and each prime group has hours from different parts
Answered by AI
Add your answer

Round duration - 10-15 minutes
Round difficulty - Easy

Timing- 12:15 p.m. 
Environment was very good .
Not any significant activity.
The interviewer was very friendly and talked like friends.

Round duration - 20 minutes
Round difficulty - Medium

Timing- 12:30 p.m. to 12:45 p.m
Environment was very comfortable.
No other significant activity.
Interviewer was very good and talking very politely & friendly.

Round duration - 180 minutes
Round difficulty - Hard

Timing: 8 a.m. to 11a.m.
Environment was optimum.
No significant activity.

Q1. 
Edit Distance Problem Statement
Given two strings S and T with lengths N and M respectively, your task is to find the "Edit Distance" between these strings.
The Edit Distance is defined as the minimum nu...read more
Ans. 
The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the minimum edit distance for substrings of the two input strings.

• Iterate through the strings and update the array based on the operations needed for each character.

• Return the value in the bottom ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Timing: 12:00 p.m. to 12:30 p.m.
The environment was quite good.
No significant activity.
Interviewers were very friendly. They were behaving like friends.

Round duration - 15 minutes
Round difficulty - Easy

Timing: 3:00 p.m. to 3:20 p.m.
Environment was very good.
No significant activity was monitored.
HR was very good and friendly.

Machine coding round

Q1. Explain your project
Ans. 
Developed a web application for managing inventory and sales for a retail store
• Used React.js for front-end development

• Implemented Node.js for back-end functionality

• Utilized MongoDB for database management
Answered by AI
Add your answer
Q2. Tell me about yourself
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java, Python, and web development technologies

• Strong problem-solving skills

• Team player with excellent communication skills
Answered by AI
Add your answer

Q1. EXPLAINATION of DSP and SSP
Ans. 
DSP stands for Demand-Side Platform and SSP stands for Supply-Side Platform in the context of programmatic advertising.
• DSP is a platform used by advertisers to purchase ad inventory in real-time auctions.

• SSP is a platform used by publishers to sell their ad inventory to advertisers.

• DSPs and SSPs work together in programmatic advertising to automate the buying and selling of ad space.

• DSPs use data and algorithms to targ...read more
Answered by AI
Add your answer

They ask about general mathematics and logical reasoning question

Q1. Why do you want to work here
Add your answer

Q1. Explain your previous work experience
Add your answer