HawksCode Full Stack Software Developer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Easy

It was in the morning. Because of covid test was from home. We had 50 MCQ and 1 coding question. The coding question was pretty easy. MCQ were mixed, we even had questions from machine learning.

Q1. 
Maximum Path Sum Between Two Leaves
Given a non-empty binary tree where each node has a non-negative integer value, determine the maximum possible sum of the path between any two leaves of the given tree.
...read more
Ans. 
Find the maximum path sum between two leaf nodes in a binary tree.
• Traverse the tree to find the maximum path sum between two leaf nodes

• Consider both cases where the path passes through the root and where it doesn't

• Keep track of the maximum sum while traversing the tree
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Interview round. Questions were based on projects, database and one coding question

Q1. 
Longest Subarray Zero Sum Problem Statement
Given an array of integers arr, determine the length of the longest contiguous subarray that sums to zero.
Input:
N (an integer, the length of the array)
arr (...read more
Ans. 
Find the length of the longest contiguous subarray that sums to zero in an array of integers.
• Use a hashmap to store the cumulative sum and its corresponding index.

• Iterate through the array, updating the sum and checking if the current sum exists in the hashmap.

• If the sum exists in the hashmap, update the maximum length of subarray with sum zero.

• Return the maximum length of subarray with sum zero.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Managerial round. Was asked questions on projects and management

Round duration - 10 minutes
Round difficulty - Easy

HR just asked about basic stuffs and all. Nothing technical

Round duration - 60 Minutes
Round difficulty - Medium

Timing: Morning
How was the environment? It happened in the Computer Lab of my institution
All students were assigned a computer and we had to solve questions on hackerrank

Q1. 
Order of People Heights Problem Statement
Consider 'N' individuals numbered from 0 to N-1 standing in a queue. You are provided with two arrays: Height and Infront, each consisting of 'N' non-negative int...read more
Ans. 
The task is to find the actual order of people in a queue based on their heights and the number of taller people in front of them.
• Iterate through the given arrays and create a list of tuples containing the height and number of taller people for each person.

• Sort the list of tuples in descending order of height and ascending order of the number of taller people.

• Create an empty result list and insert each tuple into the r...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Round was a mix of concepts from OOPS, OS and Problem Solving

Q1. 
Binary Search Tree Value Finder
Given a Binary Search Tree (BST) and a key value 'X', determine if there exists a node within the BST containing the value 'X'.
Example:
Input:
Consider the tree represe...read more
Ans. 
The task is to find if a given value is present in a Binary Search Tree (BST).
• Start from the root node and compare the value with the target value.

• If the value matches, return true.

• If the target value is less than the current node value, move to the left child.

• If the target value is greater than the current node value, move to the right child.

• Repeat the process until a match is found or a leaf node is reached.

• If a leaf...read more
Answered by AI
Add your answer