Header Ads Widget

Calculate the Nth term | hackerrank practice problem solution

Rajnish Tripathi 21:43

   Problem:-

This challenge will help you learn the concept of recursion.

A function that calls itself is known as a recursive function. The C programming language supports recursion. But while using recursion, one needs to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.

To prevent infinite recursion,  statement (or similar approach) can be used where one branch makes the recursive call and other doesn't.

void recurse() {
    .....
    recurse()  //recursive call
    .....
}
int main() {
    .....
    recurse(); //function call
    .....
}

Task

There is a series, , where the next term is the sum of pervious three terms. Given the first three terms of the series, , , and  respectively, you have to output the nth term of the series using recursion.

Recursive method for calculating nth term is given below.

Input Format

  • The first line contains a single integer, .

  • The next line contains 3 space-separated integers, , , and .

Constraints

Output Format

Print the nth term of the series, .

Sample Input 0

5
1 2 3

Sample Output 0

11

Explanation 0

Consider the following steps:

From steps , , , and , we can say ; then using the values from step , , , and , we get . Thus, we print  as our answer.

Solution:-

#include "stdio.h"
int find(int a,int b,int c,int n)
{
if(n==1)
return a;
if(n==2)
return b;
if(n==3)
return c;
return (find(a,b,c,n-1)+find(a,b,c,n-2)+find(a,b,c,n-3));
}
int main()
{
int n,a,b,c;
scanf("%d%d%d%d",&n,&a,&b,&c);
printf("%d",find(a,b,c,n));
return 0;
}

Recommended post:-

Hackerearth Problems:-

Hackerrank Problems:-
Data structure:-
Key points:-


Tags: