Problem Statement
Generate first n rows of Pascal's triangle.
Approach
Each element = sum of two above. row[i][j] = row[i-1][j-1] + row[i-1][j].
Time & Space Complexity
Time O(n²), Space O(n²).
This experience deserves a bigger screen
The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview