1. You are given a number n, representing the count of elements. 2. You are given n numbers. 3. You are given a number x. 4. You are required to find the all indices at which x occurs in array a. 5. Return an array of appropriate size which contains all indices at which x occurs in array a. Note -> The online judge can't force you to write the function recursively but that is what the spirit of question is. Write recursive and not iterative logic. The purpose of the question is to aid learning recursion and not test you.
Input Format
A number n n1 n2 .. n number of elements A number x
Output Format
Return the array of indices from the allIndices function. Display is managed for you.
Constraints
1 <= n <= 10^4 0 <= n1, n2, .. n elements <= 10 ^ 3 0 <= x <= 10 ^ 3
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
6 15 11 40 4 4 9 4
Output
3 4