There are total 17 question 15 mcq mix of aptitude ,computer networks and cs fundamentals . mostly question are from aptitude and computer network
. 2 coding question :

1. simple leetcode question expressive words. only 2 test case is allow to run after clicking sumbit button you can't change .
2. very hard question: Mango Blast Pro You are given two N N matrices representing a field of mangoes say A and B. Each cell is one of three possible characters as follows. The two matrices are connected at cells (n-1,6-1)<bottom-right of matrix A and (n-1,0) <bottom-left of matrix B. Note, Matrix B is a MIRROR image of Matrix A. . means the cell is empty, so you can pass through, . "S' means the cell contains a Mango that you can pick up and pass through, or • "X' means the cell contains a boulder that blocks your way. The goal is to \return the maximum number of Mangoes you can collect by following the rules below & taking the PATH as follows. • Start at (0.n-1) <top-right in Matrix B represented as B(0,n-1). Move towards B(n-1, 0) • Crossover to A(n-1, n-1) using the connector. Move to A(0,0) . Now return to A(n-1.n-1) <bottom-right Crossover to B(n-1, 0) and back to B(0, n-1). • Total of 7 touchpoints i.e. B(0,n-1) > B(n-1,0) > A(n-1, n-1) > A(0,0) > A(n-1, n-1) > B(n-1, 0) > B(0, n-1). Matrix B there is no valid path between two touchpoints, then no mangoes can be collected & hence return 0. Input: First line contains an integer N which represents the size of the matrix. Its a square matr Next N lines carry a string which represent the row Ri in the matrix where iis (0,n-1). Len is N btw. Constraints : 0 <N<= 100 Output: Integer which represents the maximum number of mangoes that can be collected Example 1 : Input 1: 5 5 $\ast$ $XXX\ast \ast \ast$*XXX$ ***** Output 1: 16 Explanation 1: The input maps to the 5x5 matrix as shown below