Pascal's triangle row
Return the k-th (0-indexed) row of Pascal's triangle.
Implement
get_pascal_row(k: int) → list[int]Examples
in
[3]out[1,3,3,1]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[3][1,3,3,1]not run yetsample