23456789101112131415161718192021222324252627

# Class containing Pascal's Triangle row generation logic
class Solution:
    # Function to generate the Nth row of Pascal's Triangle
    def getNthRow(self, N):
        # Result list to store the row
        row = []
        
        # First value of the row is always 1
        val = 1
        row.append(val)
        
        # Compute remaining values using the relation:
        # C(n, k) = C(n, k-1) * (n-k) / k
        for k in range(1, N):
            val = val * (N - k) // k
            row.append(val)
        
        return row

# Example usage
N = 5  # Example: 5th row
sol = Solution()
result = sol.getNthRow(N)

# Print the row
print(*result)

123456789101112131415161718192021222324252627282930

// Class containing Pascal's Triangle row generation logic
class Solution {
    // Function to generate the Nth row of Pascal's Triangle
    getNthRow(N) {
        // Result array to store the row
        let row = [];
        
        // First value of the row is always 1
        let val = 1;
        row.push(val);
        
        // Compute remaining values using the relation:
        // C(n, k) = C(n, k-1) * (n-k) / k
        for (let k = 1; k < N; k++) {
            val = val * (N - k) / k;
            row.push(val);
        }
        
        return row;
    }
}

// Example usage
let N = 5; // Example: 5th row
let sol = new Solution();
let result = sol.getNthRow(N);

// Print the row
console.log(result.join(" "));

Complexity Analysis

Time Complexity: O(N), we iterate N times to compute each element of the row in O(1) time using the direct relation.
Space Complexity: O(N), additional space used for storing the Nth row.

Approach - 3