Technical Associate

Idea is to get the sum of given two-variable ‘X’ and ‘Y’ in an ‘X’ = ‘X’ + ‘Y’.
Value of swapped ‘Y’ can get by ‘X’ - ‘Y’ = (‘X’ + ‘Y’) - ‘Y’ = ‘X’
Value of swapped ‘X’ can get by ‘X’ - ‘Y’ = (‘X’ + ‘Y’) - ‘Y’ = (‘X’ + ‘Y’) - ‘X’ = ‘Y’
The current value of ‘Y’ is the initial value of ‘X’
Suppose ‘X’ is 10 and ‘Y’ is 20 then
‘X’ = ‘X’ + ‘Y’ = 20+10’
Swapped value of ‘Y’ is ‘X’- ‘Y’ = 30-20 = 10’
And the swapped value of ‘X’ is ‘X’ - ‘Y’ = 30-10 = 20’
So ‘X’ is 20 and ‘Y’ is 10
Return swapped ‘X’ and ‘Y’.

We iterate from 2 to N.
For each number num, we check if it is prime or not. We use the following approach to check if a given number is prime.
We loop through all numbers from 2 to num - 1.
For every number in the loop, we check if it divides num.
If we find any number that divides num, we can say num is not prime.
If num is prime, we store it in the result vector/list.
Finally, we return the result vector/list.

In this approach, we use recursion and uses a basic condition that :
If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
In this way, we reached our answer.