We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. C
  3. Functions
  4. Calculate the Nth term
  5. Discussions

Calculate the Nth term

Sort by

recency

|

823 Discussions

|

  • jmppawanhit
     + 0 comments

    My take

    int find_nth_term(int n, int a, int b, int c) {
    if (n == 1)
    {
        return a;
    }
    return find_nth_term(--n, b, c, (a+b+c));
}

  • shadowsovereign3
     + 0 comments

    While the recursive solution is relatively trivial, the optimal solution is actually not recursive at all, and instead uses a cache in order to stop having to recalculate the same position every time you need it.

    int find_nth_term(int n, int a, int b, int c) {
    //Write your code here.
    int *cache = malloc(sizeof(int) * (n + 1));
    cache[1] = a;
    cache[2] = b;
    cache[3] = c;
    
    if (n <= 3) return cache[n];
    
    for (int i = 4; i <= n; i++) {
        cache[i] = cache[i - 1] + cache[i - 2] + cache[i - 3];
    }
    
  
    int ret = cache[n];
    free(cache);
    return ret;
}

  • yashdeora98294
     + 0 comments

    Here is Calculate the Nth term solution in c - https://programmingoneonone.com/hackerrank-calculate-the-nth-term-solution-in-c.html

  • vigneswaranmsvj
     + 0 comments

    int find_nth_term(int n, int a, int b, int c) { int res = (a+b)+c; n += res; return (n);
    }     its execute success but other test scenarios failed. Why? Any idea

  • 0xFreeL
     + 0 comments
    int find_nth_term(int n, int a, int b, int c) {
  //Write your code here.
    if(n==3){
        return c;
    }else{
        return find_nth_term(n-1, b, c, a+b+c);
    }

}