1. Next Greater Element Problem Statement Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the first element to the right of X in the list that is greater than X. If no such element exists, the Next Greater Element should be considered as -1. Example: Input: [7, 12, 1, 20] Output: [12, 20, 20, -1] Explanation: For the given list: The next greater element for 7 is 12. The next greater element for 12 is 20. The next greater element for 1 is 20. There is no greater element for 20, so it is -1. Constraints: 1 <= N <= 10^5 1 <= ARR[i] <= 10^9 Time Limit: 1 sec Input: The first line of input contains an integer 'N' denoting the size of the array/list.The second line contains 'N' space-separated integers denoting the elements of the array/list. Output: A single line containing 'N' space-separated integers denoting the Next Greater Element for each corresponding element in the array/list. Note: You are not required to print anything manually; the function implementation already manages output.
2. What is Bond , Type , Rating ? What is Corporate action , type ? What is Coupon and Paydown ? What is Paydown factor and why its Important ? What is Derivative , Type ? Pricing ?
3. What is the system design for a hotel management system?
4. What is the difference between JavaScript and jQuery?
5. What are corporate actions and what are their various types?