Given the value of n, i.e, the number of rows/columns for a square, print the pattern.
Examples :
Input : n = 8 Output : * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Input : n = 15 Output : * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Below is the implementation to print hollow lower triangular pattern :
C++
// C++ implementation of hollow // lower triangular pattern #include <bits/stdc++.h> using namespace std; // function to print the pattern void print_pattern(int n) { int k = 1; // for loop to keep track of // number of rows for (int i = 1; i <= n; i++) { // for loop to keep track of // number of columns for (int j = 1; j <= n; j++) { // if last row or first column if (i == n || j == 1) cout << " " << "*"; // to skip the lower triangular part else if (j < k) cout << " " << " "; // to print star in remaining portion else cout << " " << "*"; } cout << endl; k++; } } // driver code int main() { int n = 8; print_pattern(n); return 0; } |
chevron_right
filter_none
Java
// Java implementation of hollow // lower triangular pattern import java.io.*; class GFG { // function to print the pattern static void print_pattern(int n) { int k = 1; // for loop to keep track of // number of rows for (int i = 1; i <= n; i++) { // for loop to keep track of // number of columns for (int j = 1; j <= n; j++) { // if last row or first column if (i == n || j == 1) System.out.print(" " + "*"); // to skip the lower triangular // part else if (j < k) System.out.print(" " + " "); // to print star in remaining // portion else System.out.print(" " + "*"); } System.out.println(); k++; } } // driver code public static void main(String[] args) { int n = 8; print_pattern(n); } } // This code is contributed by vt_m |
chevron_right
filter_none
Python3
# Python3 implementation of hollow # lower triangular pattern # Function to print the pattern def print_pattern(n): k = 1; # for loop to keep track # of number of rows for i in range(1, n + 1): # for loop to keep track # of number of columns for j in range(1, n + 1): # if last row or # first column if (i == n or j == 1): print(" *", end = ""); # to skip the lower # triangular part elif (j < k): print(" ", end = " "); # to print star in # remaining portion else: print(" *", end = ""); print(); k += 1; # Driver code n = 8; print_pattern(n); # This code is contributed # by Mithun Kumar |
chevron_right
filter_none
C#
// implementation of hollow // lower triangular pattern using System; class GFG { // function to print the pattern static void print_pattern(int n) { int k = 1; // for loop to keep track of // number of rows for (int i = 1; i <= n; i++) { // for loop to keep track of // number of columns for (int j = 1; j <= n; j++) { // if last row or first column if (i == n || j == 1) Console.Write(" " + "*"); // to skip the lower triangular // part else if (j < k) Console.Write(" " + " "); // to print star in remaining // portion else Console.Write(" " + "*"); } Console.WriteLine(); k++; } } // driver code public static void Main() { int n = 8; print_pattern(n); } } // This code is contributed by vt_m |
chevron_right
filter_none
PHP
<?php // PHP implementation of hollow // lower triangular pattern // Function to print the pattern function print_pattern($n) { $k = 1; // for loop to keep track of // number of rows for ($i = 1; $i <= $n; $i++) { // for loop to keep track of // number of columns for ($j= 1; $j<= $n; $j++) { // if last row or // first column if ($i == $n || $j== 1) echo " *"; // to skip the lower // triangular part else if ($j < $k) echo " "; // to print star in // remaining portion else echo " *"; } echo "\n"; $k++; } } // Driver code $n = 8; print_pattern($n); // This code is contributed by Mithun Kumar ?> |
chevron_right
filter_none
Output :
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Recommended Posts:
- Program to print Lower triangular and Upper triangular matrix of an array
- Print lower triangular matrix pattern from given array
- Program to check if matrix is lower triangular
- Program to print hollow pyramid and diamond pattern
- Solid square inside a hollow square | Pattern
- Program to print the pattern with two hollow Triangles
- Program to print hollow Triangle pattern
- Python Program to print hollow half diamond hash pattern
- Program for triangular pattern (mirror image around 0)
- Program to print solid and hollow square patterns
- Program to print solid and hollow rhombus patterns
- Program to print hollow rectangle or square star patterns
- Program to print the hollow numerical parallelogram
- Program to Print Mirrored Hollow Parallelogram
- Minimum number of blocks required to form Hollow Rectangular Prism
- Program to print a Hollow Triangle inside a Triangle
- Python String Methods | Set 1 (find, rfind, startwith, endwith, islower, isupper, lower, upper, swapcase & title)
- Case conversion (Lower to Upper and Vice Versa) of a string using BitWise operators in C/C++
- Sum of upper triangle and lower triangle
- Check whether the given character is in upper case, lower case or non alphabetic character
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : Mithun Kumar
