class Solution:
    # Function to print concentric square number pattern
    def pattern22(self, n):
        # Outer loop for rows
        for i in range(2 * n - 1):
            # Inner loop for columns
            for j in range(2 * n - 1):
                # Calculate distance from top
                top = i
                # Calculate distance from left
                left = j
                # Calculate distance from bottom
                bottom = (2 * n - 2) - i
                # Calculate distance from right
                right = (2 * n - 2) - j

                # Take the minimum of all four distances
                minDist = min(top, bottom, left, right)

                # Print number (starts with n at border, decreases inside)
                print(n - minDist, end=" ")
            # Move to the next row
            print()


if __name__ == "__main__":
    # Create object of Solution class
    sol = Solution()

    # Define size of pattern
    N = 5

    # Call pattern function
    sol.pattern22(N)

1234567891011121314151617181920212223242526272829303132333435363738394041

class Solution {
    // Function to print concentric square number pattern
    pattern22(n) {
        // Outer loop for rows
        for (let i = 0; i < 2 * n - 1; i++) {
            let row = "";
            // Inner loop for columns
            for (let j = 0; j < 2 * n - 1; j++) {
                // Calculate distance from top
                let top = i;
                // Calculate distance from left
                let left = j;
                // Calculate distance from bottom
                let bottom = (2 * n - 2) - i;
                // Calculate distance from right
                let right = (2 * n - 2) - j;

                // Take the minimum of all four distances
                let minDist = Math.min(top, bottom, left, right);

                // Append number (starts with n at border, decreases inside)
                row += (n - minDist) + " ";
            }
            // Print row
            console.log(row);
        }
    }
}

// Driver code
(function () {
    // Create object of Solution class
    const sol = new Solution();

    // Define size of pattern
    const N = 5;

    // Call pattern function
    sol.pattern22(N);
})();

Complexity Analysis

Time Complexity: O((2N-1)²) ≈ O(N²), since we print every cell once.

Space Complexity: O(1), only variables for indices are used.