Given the length as rows and breadth as cols, the task is to print the mirrored hollow parallelogram.
Examples:
Input: rows = 5, cols = 8
Output:
********
* *
* *
* *
********
C++
#include <iostream>
using namespace std;
void Pattern( int rows, int cols)
{
int i, j;
for (i = 1; i <= rows; i++) {
for (j = 1; j < i; j++) {
cout << " " ;
}
for (j = 1; j <= cols; j++) {
if (i == 1 || i == rows
|| j == 1 || j == cols) {
cout << "*" ;
}
else {
cout << " " ;
}
}
cout << "\n" ;
}
}
int main()
{
int rows = 5, cols = 8;
Pattern(rows, cols);
return 0;
}
|
C
#include <stdio.h>
void Pattern( int rows, int cols)
{
int i, j;
for (i = 1; i <= rows; i++) {
for (j = 1; j < i; j++) {
printf ( " " );
}
for (j = 1; j <= cols; j++) {
if (i == 1 || i == rows
|| j == 1 || j == cols) {
printf ( "*" );
}
else {
printf ( " " );
}
}
printf ( "\n" );
}
}
int main()
{
int rows = 5, cols = 8;
Pattern(rows, cols);
return 0;
}
|
Java
import java.util.*;
class solution
{
static void Pattern( int rows, int cols)
{
int i, j;
for (i = 1 ; i <= rows; i++) {
for (j = 1 ; j < i; j++) {
System.out.print( " " );
}
for (j = 1 ; j <= cols; j++) {
if (i == 1 || i == rows
|| j == 1 || j == cols) {
System.out.print( "*" );
}
else {
System.out.print( " " );
}
}
System.out.print( "\n" );
}
}
public static void main(String args[])
{
int rows = 5 , cols = 8 ;
Pattern(rows, cols);
}
}
|
Python3
import math as mt
def Pattern(rows, cols):
for i in range ( 1 , rows + 1 ):
for j in range ( 1 , i):
print (end = " " )
for j in range ( 1 , cols + 1 ):
if (i = = 1 or i = = rows or
j = = 1 or j = = cols):
print ( "*" , end = "")
else :
print (end = " " )
print ()
rows, cols = 5 , 8
Pattern(rows, cols)
|
C#
using System;
class GFG
{
static void Pattern( int rows, int cols)
{
int i, j;
for (i = 1; i <= rows; i++)
{
for (j = 1; j < i; j++)
{
Console.Write( " " );
}
for (j = 1; j <= cols; j++)
{
if (i == 1 || i == rows
|| j == 1 || j == cols)
{
Console.Write( "*" );
}
else
{
Console.Write( " " );
}
}
Console.Write( "\n" );
}
}
public static void Main()
{
int rows = 5, cols = 8;
Pattern(rows, cols);
}
}
|
PHP
<?php
function Pattern( $rows , $cols )
{
for ( $i = 1; $i <= $rows ; $i ++)
{
for ( $j = 1; $j < $i ; $j ++)
{
echo " " ;
}
for ( $j = 1; $j <= $cols ; $j ++)
{
if ( $i == 1 || $i == $rows ||
$j == 1 || $j == $cols )
{
echo "*" ;
}
else
{
echo " " ;
}
}
echo "\n" ;
}
}
$rows = 5; $cols = 8;
Pattern( $rows , $cols );
?>
|
Javascript
<script>
function Pattern(rows, cols) {
var i, j;
for (i = 1; i <= rows; i++) {
for (j = 1; j < i; j++) {
document.write( " " );
}
for (j = 1; j <= cols; j++) {
if (i == 1 || i == rows || j == 1 || j == cols) {
document.write( "*" );
} else {
document.write( " " );
}
}
document.write( "<br>" );
}
}
var rows = 5,
cols = 8;
Pattern(rows, cols);
</script>
|
Output: ********
* *
* *
* *
********
Time Complexity: O(rows * cols), where n represents the given number of rows and columns.
Auxiliary Space: O(1), no extra space is required, so it is a constant.