1. Write a program for snake traversal of a binary tree.
2. What are the requirements for creating an immutable class in Java?
3. Maximum Sum Rectangle Problem Given an M x N matrix of integers ARR, your task is to identify the rectangle within the matrix that has the greatest sum of its elements. Input: The first line of input contains an integer 'T' representing the number of test cases. For each test case, the first line contains two space-separated integers, M and N, indicating the dimensions of the matrix ARR. The following M lines each contain N space-separated integers, representing the elements of the matrix ARR. Output: For each test case, return the maximum sum obtained from any rectangle within the matrix. Example: Input: 14 51 2 -1 -4 -20-8 -3 4 2 13 8 10 1 3-4 -1 1 7 -6 Output: 29 Explanation: The submatrix from (1,1) to (3,3) has the maximum sum of 29, illustrated as: 1 2 -1 -4 -20-8 |-3 4 2 | 1 3 | 8 10 1 | 3-4 |-1 1 7 | -6 Constraints: 1 ≤ T ≤ 10 1 ≤ M, N ≤ 100 -105 ≤ ARR[i] ≤ 105 Note: You do not need to print anything; implement the function to return the result only.
4. How do you retrieve the roll numbers of students enrolled in the same subjects?
5. Are you proficient with Excel and Excel macros?
Browse through a variety of job opportunities tailored to your skills and preferences. Filter by location, experience, salary, and more to find your perfect fit.
We have sent an OTP to your contact. Please enter it below to verify.