1. Do you have hands-on experience with our software?
2. Can you name any of our software products?
3. How will you manage conflicts of interest?
4. Reverse a Stack Using Recursion You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion. You are not allowed to use any loop constructs (e.g., for, while, etc.). Only the following inbuilt stack methods are permitted: push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() -- Get the top element. Input: The first line of input contains an integer value N, denoting the size of the input Stack.The second line contains N single space-separated integers, denoting the stack elements, where the last (Nth) element is the TOP most element of Stack. Output: N single space-separated integers in a single line, where the first integer denotes the TOP element of the reversed stack. Example: Input: 32 1 3 Output: 2 1 3 Explanation: First-line contains an integer 3; this is the size of the stack. The second-line contains the elements of the stack. After reversing, the stack elements in a single line are printed, starting from the top element: 2 1 3. Constraints: 0 <= N <= 10^3 Time Limit: 1 sec
5. Maximum Subarray Problem Statement Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum. A subarray 'A' is considered greater than a subarray 'B' if sum(A) > sum(B). If two subarrays have the same maximum sum, choose the subarray with the larger length. Explanation: A subarray is a contiguous part of an array. For example, in an array arr = [1, 2, 3, 4], [1, 2], and [2, 3, 4] are contiguous subarrays, but [1, 3, 4] is not. Input: The first line contains an integer 'T' which denotes the number of test cases or queries to be run. The first line of each test case contains a single integer ‘N’ denoting the size of the array. The second line of each test case contains ‘N’ space-separated integers denoting the elements of the array. Output: For each case, if the returned subarray is correct then print 1, else print 0. The output of each test case will be printed in a separate line. Example: Example 1:Input: T = 1, N = 4, arr = [1, 2, -1, 3] Output: 1Explanation: The subarray [1, 2, -1, 3] has the maximum sum of 5. Constraints: 1 ≤ T ≤ 5 1 ≤ N ≤ 1000 -99 ≤ |arr| ≤ 99 Time limit: 1 sec. Note: You do not need to input or print anything, it has already been taken care of. Just implement the given function.