Hussmann Software Developer Interview Questions and Answers

Round duration - 40 minutes
Round difficulty - Medium

It was conducted on hackkerank. MCQs cover various topics including -Data Structures, Aptitude, etc

Q1. 
Count Diagonal Paths
You are given a binary tree. Your task is to return the count of the diagonal paths to the leaf of the given binary tree such that all the values of the nodes on the diagonal are equa...read more
Ans. 
Count the number of diagonal paths in a binary tree where all nodes on the diagonal have equal values.
• Traverse the binary tree in a diagonal manner and keep track of nodes with equal values.

• Use recursion to explore all possible diagonal paths in the tree.

• Count the number of paths where all nodes on the diagonal have the same value.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

This round was conducted on skype. Questions were mainly personality based rather knowledge.

Round duration - 120 Minutes
Round difficulty - Medium

The round had 2 coding problems to solve with varying difficulty. Each candidate had a different set of questions. The round was around 2 pm. The webcam was turned on to keep an eye on candidates.

Q1. 
Bursting Balloons Problem
Given an array ARR of size N, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...read more
Ans. 
Find the minimum number of arrows needed to burst all balloons by shooting arrows from left to right.
• Sort the array in non-decreasing order to make it easier to calculate the minimum number of arrows needed.

• Iterate through the sorted array and count the number of times the height decreases compared to the previous balloon.

• The count of decreases + 1 will give the minimum number of arrows needed to burst all balloons.

• Exa...read more
Answered by AI
Add your answer
Q2. 
Count Leaf Nodes in a Binary Tree
Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...read more
Ans. 
Count the number of leaf nodes in a binary tree.
• Traverse the binary tree and check if both left and right children are NULL to identify leaf nodes.

• Use recursion to traverse the tree efficiently.

• Keep track of the count of leaf nodes as you traverse the tree.

• Handle base cases where the current node is NULL or a leaf node.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to DSA. I was first asked to explain my approach with proper complexity analysis and then code the soution in any IDE that I prefer.

Q1. 
Rod Cutting Problem Statement
Given a rod of a certain length, the rod can be divided into different sizes, each with an associated cost. Your task is to determine the maximum cost that can be obtained by...read more
Ans. 
The Rod Cutting Problem involves maximizing the profit obtained by cutting a rod into smaller pieces and selling them.
• Use dynamic programming to solve this problem efficiently.

• Create a table to store the maximum profit for each sub-length of the rod.

• Iterate through the rod lengths and update the table with the maximum profit.

• The final answer will be the maximum profit for the total length of the rod.
Answered by AI
Add your answer
Q2. 
Count Subarrays with Given XOR Problem Statement
You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.
Example...read more
Ans. 
Count the number of subarrays in an array whose XOR is equal to a given value.
• Iterate through the array and keep track of XOR values and their frequencies using a hashmap.

• For each element in the array, calculate the XOR with the current element and check if the required XOR value exists in the hashmap.

• Increment the count of subarrays whenever the required XOR value is found in the hashmap.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

Q1. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find the minimum time required to rot all fresh oranges in a grid.
• Use Breadth First Search (BFS) to simulate the rotting process of oranges.

• Keep track of the time taken to rot all oranges and the count of fresh oranges remaining.

• If all fresh oranges are not rotten after simulation, return -1.

• Handle edge cases like empty grid or no fresh oranges present.

• Example: For the given grid, the minimum time required is 4 seconds
Answered by AI
Add your answer
Q2. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers approach to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.

• Example: For input 5 2 and 1 2 3 4 5, return 1 2 3 4 5 without the loop.
Answered by AI
Add your answer
Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their
approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Ans. 
Given a string, find the longest palindromic substring within it.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found so far

• Return the longest palindromic substring
Answered by AI
Add your answer
Q2. 
Quick Sort Problem Statement
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...read more
Ans. 
Yes, the quick sort algorithm can be enhanced to achieve NlogN complexity in the worst case by using a randomized version of the algorithm.
• Randomized quick sort involves randomly selecting the pivot element to reduce the chances of worst-case scenarios.

• By choosing a random pivot, the algorithm becomes less predictable and more likely to achieve the desired time complexity.

• This enhancement helps in avoiding the worst-ca...read more
Answered by AI
Add your answer
Q3. What are friend functions in C++?
Ans. 
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
• Friend functions are declared inside a class with the keyword 'friend'.

• They can access private and protected members of the class.

• They are not member functions of the class, but have the same access rights as member functions.

• Friend functions are useful for implementing operators that are not part ...read more
Answered by AI
Add your answer
Q4. What is the difference between Early Binding and Late Binding in C++?
Ans. 
Early binding is resolved at compile time while late binding is resolved at runtime in C++.
• Early binding is also known as static binding, where the function call is resolved at compile time based on the type of the object.

• Late binding is also known as dynamic binding, where the function call is resolved at runtime based on the actual type of the object.

• Early binding is faster as the function call is directly linked to ...read more
Answered by AI
Add your answer

Round duration - 24 hours
Round difficulty - Easy

It was a hackathon we were given a problem statement and we had to solve that within 2 days. There were team of 4 people.

Q1. You had to build a chatbot. Can you describe the design process and the key considerations you took into account?
Ans. 
The design process for building a chatbot involves defining user goals, choosing a platform, designing conversation flow, implementing natural language processing, and testing for accuracy.
• Define user goals and objectives for the chatbot

• Choose a platform or framework for building the chatbot (e.g. Dialogflow, Microsoft Bot Framework)

• Design the conversation flow and user interactions

• Implement natural language processing...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

HR round

Round duration - 90 Minutes
Round difficulty - Medium

It was in the morning at our institute. There were technical and aptitude problems.

Q1. 
Star Pattern Generation
Develop a function to print star patterns based on the given number of rows 'N'. Each row in the pattern should follow the format demonstrated in the example.
The picture illustra...read more
Ans. 
Function to print star patterns based on the given number of rows 'N'.
• Iterate through each row from 1 to N

• For each row, print spaces (N-row) followed by stars (2*row-1)

• Repeat until all rows are printed
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

It was actually a Techno HR round. I was asked some technical questions about OS, OOPS, COMPUTER NETWORKING, WEB DEVELOPMENT. He went through my whole resume, asked about all the projects and past working experiences. The interviewer was really good, we talked about so many other topics, from Women empowerment to Water Crises. I felt really confident while speaking because he made me so comfortable.

Q1. 
Selection Sort Algorithm
Selection sort is a sorting technique that works by repeatedly finding the minimum element (considering ascending order) from the unsorted part and placing it at the beginning of ...read more
Ans. 
Selection Sort Algorithm sorts an array by repeatedly finding the minimum element and placing it at the beginning of the unsorted part.
• Iterate through the array to find the minimum element and swap it with the first unsorted element.

• Repeat this process for each element in the array until it is fully sorted.

• Time complexity of Selection Sort is O(n^2) making it inefficient for large arrays.
Answered by AI
View 1 more answer

Q1. What is your introduction?
Ans. 
I am a passionate software developer with expertise in various programming languages and technologies.
• Experienced in Java, Python, and JavaScript

• Proficient in web development using HTML, CSS, and React

• Familiar with database management systems like MySQL and MongoDB
Answered by AI
Add your answer
Q2. What is your technology
Ans. 
I specialize in web development using JavaScript, HTML, and CSS.
• Proficient in JavaScript, HTML, and CSS

• Experience with front-end frameworks like React and Angular

• Knowledge of back-end technologies like Node.js and Express
Answered by AI
Add your answer
Q3. What is html and what is block and inline function?
Ans. 
HTML is a markup language used for creating web pages. Block and inline elements are two types of HTML elements with different display behaviors.
• HTML stands for HyperText Markup Language and is used to create the structure of web pages.

• Block elements take up the full width available and start on a new line, while inline elements only take up as much width as necessary and do not start on a new line.

• Examples of block el...read more
Answered by AI
Add your answer
Q4. What is css ? And what is client side and server side ?
Ans. 
CSS is a styling language used to design the layout and appearance of web pages. Client side refers to actions performed on the user's device, while server side refers to actions performed on the server.
• CSS stands for Cascading Style Sheets and is used to control the visual presentation of web pages.

• Client side refers to actions performed on the user's device, such as running scripts in the browser.

• Server side refers t...read more
Answered by AI
Add your answer
Q5. What is javascript? And what is use in framework
Ans. 
JavaScript is a programming language commonly used for web development. It is used in frameworks like React and Angular.
• JavaScript is a high-level, interpreted programming language.

• It is commonly used for client-side web development.

• JavaScript can be used in frameworks like React, Angular, and Vue.

• It allows for dynamic content on websites and interactive user experiences.
Answered by AI
Add your answer

Q1. Oops concept,delegates
Add your answer

Easy questions with less time. So, practice shortcuts.

Q1. Questions asked in interview are, OOPs basics, SDLC, and Final year project.
Add your answer