Humana Software Engi Interview Questions and Answers

Technical aspects about linked list,trees, stacks

Topic related to humanities

Q1. Is a valid decimal
Add your answer
Q2. Return the substring in a main string, which is composition of given string
Ans. 
Find and return all substrings in a main string that match a given string.
• Iterate through the main string and check for matches with the given string

• Use substring function to extract potential matches

• Store all matching substrings in an array and return it
Answered by AI
Add your answer

Q1. Tell me about yourself? Why choose python and tell me about projects?
Ans. 
I am a software developer with a passion for Python. I have worked on various projects showcasing my skills.
• I chose Python because of its simplicity, readability, and vast community support.

• Python's extensive libraries and frameworks make it suitable for a wide range of applications.

• I have worked on projects like building web applications using Django, data analysis using pandas, and automation scripts using Selenium.

• O...read more
Answered by AI
Add your answer
Q2. Why gaotek? Difference between Application and System Software? Tell me about project you done?
Ans. 
I chose Gaotek because of its reputation in the software development industry.
• Gaotek is known for its cutting-edge technology and innovative solutions.

• The company has a strong focus on professional growth and learning opportunities.

• Gaotek's work culture promotes collaboration and teamwork.

• I was impressed by the positive reviews and success stories of Gaotek's previous interns and employees.
Answered by AI
Add your answer
Q3. Difference between python and C
Ans. 
Python is a high-level interpreted language while C is a low-level compiled language.
• Python is dynamically typed while C is statically typed.

• Python has automatic memory management while C requires manual memory management.

• Python is easier to learn and write code in while C is more efficient and faster.

• Python is used for web development, data analysis, and machine learning while C is used for system programming and embe...read more
Answered by AI
Add your answer
Q4. Why you can go with unpaid internship??
Ans. 
Unpaid internships can provide valuable learning opportunities and networking connections.
• Gain practical experience and enhance skills

• Build a professional network

• Explore different career paths

• Gain exposure to real-world projects

• Increase chances of future employment

• Learn from experienced professionals

• Develop a strong work ethic

• Demonstrate dedication and commitment
Answered by AI
Add your answer

Moderate difficult challenge in control

Q1. Describe your project
Add your answer

1 round of dsa with 2 questions

Q1. 1 system design round
Add your answer
Q2. LLD round for 30 minutes
Add your answer

Q1. Previous project discussion
Add your answer
Q2. Discuss past project, tech stack for 30 mins
Ans. 
Developed a web-based project management tool using React, Node.js, and MongoDB.
• Used React for the front-end development

• Used Node.js for the back-end development

• Used MongoDB for the database management

• Implemented features like task assignment, progress tracking, and file sharing

• Followed Agile methodology for project management
Answered by AI
Add your answer

Q1. Basic hr questions, salary discussion
Add your answer

Q1. Questions on caching. Consistency
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

Q1. 
Validate Binary Tree Nodes Problem
You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i] and RIGHT_CHILD[i] arrays. Dete...read more
Ans. 
The task is to determine if the given binary tree nodes form exactly one valid binary tree.
• Check if there is only one root node (a node with no parent)

• Check if each node has at most one parent

• Check if there are no cycles in the tree

• Check if all nodes are connected and form a single tree
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

Q1. 
Balanced Binary Trees Problem Statement
You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.
A balanced binary t...read more
Ans. 
The maximum number of balanced binary trees possible with a given height is to be counted and printed.
• A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.

• The number of balanced binary trees can be calculated using dynamic programming.

• The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

Q1. 
Wave Array Sorting Problem
Your goal is to sort a given unsorted array ARR such that it forms a wave array.
Explanation:
After sorting, the array should satisfy the wave pattern conditions:
• ARR[0] &...read more
Ans. 
The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.
• Iterate through the array and swap adjacent elements if they do not follow the wave pattern

• Start from the second element and compare it with the previous element, swap if necessary

• Continue this process until the end of the array

• Repeat the process for the remaining elements

• Return the sorted wave array
Answered by AI
Add your answer
Q2. 
Maximum Sum BST Problem Statement
You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any ...read more
Ans. 
The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).
• Traverse the binary tree in a bottom-up manner

• For each node, check if it forms a BST and calculate the sum of its subtree

• Keep track of the maximum sum encountered so far

• Return the maximum sum
Answered by AI
Add your answer

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

Q1. 
Pair Sum in BST Problem Statement
Given a Binary Search Tree (BST) and a target value K, determine if there exist two unique elements in the BST such that their sum equals K.
Input:
An integer T, the nu...read more
Ans. 
The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.
• Traverse the BST in-order and store the elements in a sorted array

• Use two pointers, one at the beginning and one at the end of the array

• Check if the sum of the elements at the two pointers is equal to the target 'K'

• If the sum is less than 'K', move the left pointer to the right

• If the sum is grea...read more
Answered by AI
Add your answer
Q2. 
Find Nodes at Distance K in a Binary Tree
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...read more
Ans. 
The task is to find all nodes in a binary tree that are at a distance K from a given node.
• Implement a function that takes the binary tree, target node, and distance K as input.

• Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.

• Keep track of the distance from the current node to the target node while traversing.

• When the distance equals K, add the current node to the result lis...read more
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round

Round duration - 70 Minutes
Round difficulty - Medium

Timing was 9:15AM. Platform was not very good. Questions were not well explained.

Q1. 
Merge Overlapping Intervals Problem Statement
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...read more
Ans. Brute Force
1. We are given the function MERGEINTERVALS(), which takes a 2D vector representing the vector of intervals and returns another 2D vector which is the vector of merged intervals.
2. We create another function ISOVERLAP() to check if the current interval overlaps with the other interval.
3. Now we create an empty 2D vector “RES” to store finally merged intervals and another boolean vector “VIS” to mark if the current in...read more
Answered Anonymously
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered Anonymously
Add your answer
Q3. 
Problem: Permutations of a String
Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Explanatio...read more
Ans. Backtracking
The idea is to fix a character at a position and then find the permutations for rest of the characters.
Make a list ‘ans’ which will contain the permutations of the given string.
 
Algorithm:
Let’s define a function generatePermutaionsHelper(Str, l, r). This function generates the permutations of the substring which starts from index  ‘l’ and ends at index  ‘r’.
• Call the function: generatePermutai...read more
Answered Anonymously
Add your answer