Oracle\'s OnA had 22 questions. Two DSA questions. Ten Aptitude and ten questions on english.\nThe two dsa questions were:\n**Q1) Throw The Ball**\nIn a park, there are n friends standing in a random order, and they plan to throw a ball around. Each friend has a unique number in the range of 1 to n, inclusive. The ith friend will always throw the ball towards the friend given at receiver[i], and this will happen each second. Friend 1 always starts with the ball, and a player always throws to another player. Determine which friend has the ball after k seconds pass.\nNote: Friends are numbered starting with 1.\n**Example**\nreceiver=[2,4,1,5,3]\nseconds=6\n| Sendor | Reciver | Time |\n| -------- | ------- | ------- |\n| 1 | 2 |1|\n| 2 | 4 | 2|\n| 4 | 5 | 3 |\n| 5 | 3 | 4 |\n| 3 | 1| 5|\n|1|2|6|\nAfter 6 seconds, the ball will be with friend 2.\nFunction Description\n**int receiver[n]:** the ith friend will throw the ball to the friend indicated in receiver\n**long seconds:** The time in seconds that the game lasts\n**Constraints:**\n1< size of receiver < 10^5\nreceiver[i]!=i \n1<seconds<10^12\n**Test Cases**\n**Input Test Case 1**\nInput: \n``` [6,5,2,5,3,2], 7```\nOutput:\n``` 3```\n**Test Case 2:**\nInput:\n``` [3,1,4,2], 6 ```\nOutput:\n``` 3```\n**Q2)Frequency of Maximum Value**\nGiven an array \u2018nums\u2019 of length N containing positive integers and an array \u2018query\u2019 of length \u2018Q\u2019 containing indexes, print/store for each query the count of maximum value in the sub-array starting at index \u2018i\u2019 and ending at index \u2018N-1\u2019.\n\nFor eg:- nums = [ 5, 4, 5, 3, 2 ] and q = [ 1, 2, 3, 4, 5 ]\n\nAnswer would be [ 2, 1, 1, 1, 1 ].\n\nFor the first query, we have to find the count of maximum value( which is 5) in the subarray [ 5, 4, 5, 3,2 ], which is 2.\n\nFor the second query, the count of maximum value(which is 5) in the subarray [4, 5, 3, 2 ], which is 1.\n\nSimilarly, for the fourth query, the count of maximum value(which is 3) in the subarray [ 3, 2 ].\n\nNote that the index given in the query array is 1-based indexing.\n**Constraints**:\n1<nums.size(),q.size()<10^5\n1<nums[i]<10^6\n1<q[i]<nums.size()\n**Test Case:**\nInput:\n```nums = [ 5, 4, 5, 3, 2 ] ,q = [ 1, 2, 3, 4, 5 ]```\nOutput:\n```[ 2, 1, 1, 1, 1 ].```

Oracle\'s OnA had 22 questions. Two DSA questions. Ten Aptitude and ten questions on english.\nThe two dsa questions were:\nQ1) Throw The Ball\nIn a park, there

Sendor	Reciver	Time
1	2	1
2	4	2
4	5	3
5	3	4
3	1	5
1	2	6
After 6 seconds, the ball will be with friend 2.
Function Description
int receiver[n]: the ith friend will throw the ball to the friend indicated in receiver
long seconds: The time in seconds that the game lasts
Constraints:
1< size of receiver < 10^5
receiver[i]!=i
1<seconds<10^12
Test Cases
Input Test Case 1
Input:
`[6,5,2,5,3,2], 7`
Output:
`3`
Test Case 2:
Input:
`[3,1,4,2], 6`
Output:
`3`
Q2)Frequency of Maximum Value
Given an array ‘nums’ of length N containing positive integers and an array ‘query’ of length ‘Q’ containing indexes, print/store for each query the count of maximum value in the sub-array starting at index ‘i’ and ending at index ‘N-1’.