Adding Pascal's Triangle Code

[subbu4061]

No description provided.

[super30admin]

Strengths:

• The solution is correct and handles the problem requirements well.
• The code is clean, readable, and follows good practices.
• The time complexity analysis is accurate.

Areas for Improvement:

• The space complexity analysis is incorrect. The solution uses O(n^2) space to store all rows of Pascal's Triangle, not O(1). Please review space complexity concepts.
• The comment at the top could be expanded to include more details about the approach and edge cases.
• Consider adding a check for numRows = 0 to handle edge cases explicitly, though the problem likely expects numRows >= 1.