Provana Interview Questions and Answers

Q1. 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 (size of the...read more

Q2. 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 task is...read more

Q3. 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 entirely of ...read more

Q4. 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 contains a single ...read more

Q5. 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.

Explanati...read more

Q6. 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 by an edg...read more

Q7. Prefix to Infix Conversion

Transform a string representing a valid Prefix expression, which may contain operators '+', '-', '*', '/', and uppercase letters, into its corresponding Infix expression.

Example:

Inp...read more