Pascal's Triangle

Lesson 3 of 3 in Coddy's Interview Coding Challenges - X course.

Challenge

Hard

Write a recursive function named pascalsTriangle to generate Pascal's Triangle up to the nth row.

Pascal's Triangle is a triangular array of the binomial coefficients.

The n_th row of Pascal's Triangle consists of the values of C(n, k) for k ranging from 0 to n.

Try it yourself

#include <stdlib.h>

int** pascalsTriangle(int n, int* returnSize, int** returnColumnSizes) {
    // Write code here
}

All lessons in Interview Coding Challenges - X

1Challenges