<\/span><\/h2>\n\n\n\nPrint a pattern of numbers from 1 to n as shown below. Each of the numbers is separated by a single space.<\/p>\n\n\n\n
4 4 4 4 4 4 4 \n4 3 3 3 3 3 4 \n4 3 2 2 2 3 4 \n4 3 2 1 2 3 4 \n4 3 2 2 2 3 4 \n4 3 3 3 3 3 4 \n4 4 4 4 4 4 4 \n<\/code><\/pre>\n\n\n\n<\/span>Input Format<\/strong><\/span><\/h2>\n\n\n\nThe input will contain a single integer n.<\/p>\n\n\n\n
<\/span>Constraints<\/strong><\/span><\/h2>\n\n\n\n1 <= n <= 1000<\/p>\n\n\n\n
Sample Input 0<\/strong><\/p>\n\n\n\n2<\/code><\/pre>\n\n\n\nSample Output 0<\/strong><\/p>\n\n\n\n2 2 2\n2 1 2\n2 2 2\n<\/code><\/pre>\n\n\n\nSample Input 1<\/strong><\/p>\n\n\n\n5<\/code><\/pre>\n\n\n\nSample Output 1<\/strong><\/p>\n\n\n\n5 5 5 5 5 5 5 5 5 \n5 4 4 4 4 4 4 4 5 \n5 4 3 3 3 3 3 4 5 \n5 4 3 2 2 2 3 4 5 \n5 4 3 2 1 2 3 4 5 \n5 4 3 2 2 2 3 4 5 \n5 4 3 3 3 3 3 4 5 \n5 4 4 4 4 4 4 4 5 \n5 5 5 5 5 5 5 5 5\n<\/code><\/pre>\n\n\n\nSample Input 2<\/strong><\/p>\n\n\n\n7<\/code><\/pre>\n\n\n\nSample Output 2<\/strong><\/p>\n\n\n\n7 7 7 7 7 7 7 7 7 7 7 7 7 \n7 6 6 6 6 6 6 6 6 6 6 6 7 \n7 6 5 5 5 5 5 5 5 5 5 6 7 \n7 6 5 4 4 4 4 4 4 4 5 6 7 \n7 6 5 4 3 3 3 3 3 4 5 6 7 \n7 6 5 4 3 2 2 2 3 4 5 6 7 \n7 6 5 4 3 2 1 2 3 4 5 6 7 \n7 6 5 4 3 2 2 2 3 4 5 6 7 \n7 6 5 4 3 3 3 3 3 4 5 6 7 \n7 6 5 4 4 4 4 4 4 4 5 6 7 \n7 6 5 5 5 5 5 5 5 5 5 6 7 \n7 6 6 6 6 6 6 6 6 6 6 6 7 \n7 7 7 7 7 7 7 7 7 7 7 7 7 \n<\/code><\/pre>\n\n\n\n<\/span>Solution – Printing Pattern in C HackerRank Solution<\/strong><\/span><\/h2>\n\n\n\n#include <stdio.h>\n\nint main() \n{\n\n int n;\n scanf(\"%d\", &n);\n int len = n*2 - 1;\n for(int i=0;i<len;i++){\n for(int j=0;j<len;j++){\n int min = i < j ? i : j;\n min = min < len-i ? min : len-i-1;\n min = min < len-j-1 ? min : len-j-1;\n printf(\"%d \", n-min);\n }\n printf(\"\\n\");\n }\n return 0;\n}\n<\/pre>\n\n\n\n