Given the value of n, print the following pattern.
Examples :
Input : n = 4
Output :
A1
AB12
ABC123
ABCD1234
Input : n = 7
Output :
A1
AB12
ABC123
ABCD1234
ABCDE12345
ABCDEF123456
ABCDEFG1234567
Below is the implementation to print the above pattern :
C++
#include <bits/stdc++.h>
using namespace std;
void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
int k = 'A' ;
int m = 1;
for ( int j = 1; j <= (2 * n); j++) {
if (j >= n + 1 - i && (j <= n + i)) {
if (j <= n) {
cout << char (k);
k++;
}
else {
cout << m;
m++;
}
}
else
cout << " " ;
}
cout << endl;
}
}
int main()
{
int n = 7;
pattern(n);
return 0;
}
|
Java
import java.util.*;
class GFG {
static void pattern( int n)
{
for ( int i = 1 ; i <= n; i++) {
int k = 'A' ;
int m = 1 ;
for ( int j = 1 ; j <= ( 2 * n); j++) {
if (j >= n + 1 - i && (j <= n + i))
{
if (j <= n) {
System.out.print(( char )k);
k++;
}
else {
System.out.print(m);
m++;
}
}
else
System.out.print( " " );
}
System.out.println();
}
}
public static void main(String[] args)
{
int n = 7 ;
pattern(n);
}
}
|
Python
def pattern(n):
i = 1
while i < = n:
k = 65 ;
m = 1 ;
j = 1
while j < = ( 2 * n):
if (j > = n + 1 - i) and (j < = n + i):
if (j < = n):
print ( chr (k)),
k + = 1
else :
print (m),
m + = 1
else :
print ( " " ),
j + = 1
i + = 1
print ( "\n" )
def main():
n = 7
pattern(n)
if __name__ = = "__main__" :
main()
|
C#
using System;
class GFG {
static void pattern( int n)
{
for ( int i = 1; i <= n; i++) {
int k = 'A' ;
int m = 1;
for ( int j = 1; j <= (2 * n); j++) {
if (j >= n + 1 - i && (j <= n + i))
{
if (j <= n) {
Console.Write(( char )k);
k++;
}
else {
Console.Write(m);
m++;
}
}
else
Console.Write( " " );
}
Console.WriteLine();
}
}
public static void Main()
{
int n = 7;
pattern(n);
}
}
|
PHP
<?php
function pattern( $n )
{
for ( $i = 1; $i <= $n ; $i ++)
{
$k = 'A' ;
$m = 1;
for ( $j = 1; $j <= (2 * $n ); $j ++)
{
if ( $j >= $n + 1 - $i &&
( $j <= $n + $i ))
{
if ( $j <= $n )
{
echo $k ;
$k ++;
}
else
{
echo $m ;
$m ++;
}
}
else
echo " " ;
}
echo "\n" ;
}
}
$n = 7;
pattern( $n );
?>
|
Javascript
<script>
function pattern(n)
{
for ( var i = 1; i <= n; i++) {
var k = 65;
var m = 1;
for ( var j = 1; j <= (2 * n); j++) {
if (j >= n + 1 - i && (j <= n + i)) {
if (j <= n) {
document.write(String.fromCharCode(k));
k++;
}
else {
document.write(m);
m++;
}
}
else
document.write( ' ' + ' ' );
}
document.write( "<br>" );
}
}
var n = 7;
pattern(n);
</script>
|
Output:
A1
AB12
ABC123
ABCD1234
ABCDE12345
ABCDEF123456
ABCDEFG1234567
Time complexity: O(n2) for given input n
Auxiliary Space: O(1)
Last Updated :
13 Mar, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...