Hike Software Developer Intern Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10AM. The platform was quite good.

Q1. 
Maximum Size Rectangle Sub-matrix with All 1's Problem Statement
You are provided with an N * M sized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t...read more
Add your answer
Q2. 
Binary Tree Maximum Path Sum Problem Statement
Determine the maximum path sum for any path in a given binary tree with 'N' nodes.
Note:
• A 'path' is defined as any sequence of adjacent nodes connected...read more
Add your answer
Q3. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Add your answer
Q4. 
Infix to Postfix Conversion
Convert a given infix expression, represented as a string EXP, into its equivalent postfix expression.
Explanation:
An infix expression is formatted as a op b where the opera...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10AM. The platform was user-friendly.

Q1. 
Maximum Size Rectangle Sub-matrix with All 1's Problem Statement
You are provided with an N * M sized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t...read more
Add your answer
Q2. 
Binary Tree Maximum Path Sum Problem Statement
Determine the maximum path sum for any path in a given binary tree with 'N' nodes.
Note:
• A 'path' is defined as any sequence of adjacent nodes connected...read more
Add your answer
Q3. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Add your answer
Q4. 
Prefix to Infix Conversion
Transform a string representing a valid Prefix expression, which may contain operators '+', '-', '*', '/', and uppercase letters, into its corresponding Infix expression.
Examp...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10AM. The platform was quite good.

Q1. 
Maximum Size Rectangle Sub-Matrix with All 1's
Given an N x M binary matrix 'MAT', where N is the number of rows and M is the number of columns, determine the maximum area of a submatrix consisting entire...read more
Ans. 
If the height of bars of the histogram is given then the largest area of the histogram can be found. This way in each row, the largest area of bars of the histogram can be found. To get the largest rectangle full of 1’s, update the next row with the previous row and find the largest area under the histogram, i.e. consider each 1’s as filled squares and 0’s with an empty square and consider each row as the base.
Answered Anonymously
Add your answer
Q2. 
Maximum Sum Path in a Binary Tree
Your task is to determine the maximum possible sum of a simple path between any two nodes (possibly the same) in a given binary tree of 'N' nodes with integer values.
Ex...read more
Ans. 
For each node there can be four ways that the max path goes through the node:
1. Node only
2. Max path through Left Child + Node
3. Max path through Right Child + Node
4. Max path through Left Child + Node + Max path through Right Child
Answered Anonymously
Add your answer
Q3. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Ans. 
This can be easily done by visualizing the problem as a graph. We will have n nodes and an edge directed from node i to node j if the element at i’th index must be present at j’th index in the sorted array.
Answered Anonymously
Add your answer
Q4. 
Prefix to Infix Conversion
Transform a string representing a valid Prefix expression, which may contain operators '+', '-', '*', '/', and uppercase letters, into its corresponding Infix expression.
Examp...read more
Ans. 
Algorithm for Prefix to Infix:

Read the Prefix expression in reverse order (from right to left)
If the symbol is an operand, then push it onto the Stack
If the symbol is an operator, then pop two operands from the Stack
Create a string by concatenating the two operands and the operator between them.
string = (operand1 + operator + operand2)
And push the resultant string back to Stack
Repeat the above steps until end of Prefix
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Maximum Difference in Matrix
Given an n x n matrix mat[n][n] of integers, find the maximum value of mat[c][d] - mat[a][b] for all possible indices where c > a and d > b.
Input:
The first line cont...read more
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy