Kth Row of Pascal's Triangle

Asked in:
Google

Problem Description

Given an index k, return the kth row of the Pascal's triangle.

Pascal's triangle: To generate A[C] in row R, sum up A'[C] and A'[C-1] from previous row R - 1.

Example:

Input : k = 3

Return : [1,3,3,1]

Note: k is 0 based. k = 0, corresponds to the row [1].

Note: Could you optimize your algorithm to use only O(k) extra space?

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Kth Row of Pascal's Triangle on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Google

Discussion

Click here to start solving coding interview questions

Free Mock Assessment

Fill up the details for personalised experience.

Phone Number *

OTP will be sent to this number for verification

+1 *

Phone Number

Graduation Year *

^*Enter the expected year of graduation if you're student

Current Employer

Company Name

College you graduated from

College/University Name

Job Title

By clicking on Start Test, I agree to be contacted by Scaler in the future.

Already have an account? Log in