Print string of odd length in 'X' format
Last Updated :
11 Sep, 2023
Given a string of odd length, print the string X format.
Examples :
Input: 12345
Output:
1 5
2 4
3
2 4
1 5
Input: geeksforgeeks
Output:
g s
e k
e e
k e
s g
f r
o
f r
s g
k e
e e
e k
g s
We strongly recommend you to minimize your browser and try this yourself first.
The idea is to use two variables in a single loop, the first variable 'i' goes from left to right and second variable 'j' goes from right to left. The upper part of Cross (or X) is printed before they meet. The central character is printed when they meet and lower part is printed after they cross each other. In the upper part str[i] is printed before str[j] and in the lower part, str[j] is printed before str[i].
Below is the implementation of above idea.
C++
// C++ program to print Cross pattern
#include <iostream>
using namespace std;
// Function to print given string in cross pattern
// Length of string must be odd
void printPattern(string str)
{
int len = str.length();
// i goes from 0 to len and j goes from len-1 to 0
for (int i = 0, j = len - 1; i <= len, j >= 0;
i++, j--) {
// To print the upper part. This loop runs
// till middle point of string (i and j become
// same
if (i < j) {
// Print i spaces
for (int x = 0; x < i; x++)
cout << " ";
// Print i'th character
cout << str[i];
// Print j-i-1 spaces
for (int x = 0; x < j - i - 1; x++)
cout << " ";
// Print j'th character
cout << str[j] << endl;
}
// To print center point
if (i == j) {
// Print i spaces
for (int x = 0; x < i; x++)
cout << " ";
// Print middle character
cout << str[i] << endl;
}
// To print lower part
else if (i > j) {
// Print j spaces
for (int x = j - 1; x >= 0; x--)
cout << " ";
// Print j'th character
cout << str[j];
// Print i-j-1 spaces
for (int x = 0; x < i - j - 1; x++)
cout << " ";
// Print i'h character
cout << str[i] << endl;
}
}
}
// Driver program
int main()
{
printPattern("geeksforgeeks");
return 0;
}
// Java program to
// print cross pattern
class GFG {
// Function to print given
// string in cross pattern
static void pattern(String str, int len)
{
// i and j are the indexes
// of characters to be
// displayed in the ith
// iteration i = 0 initially
// and go upto length of string
// j = length of string initially
// in each iteration of i,
// we increment i and decrement j,
// we print character only
// of k==i or k==j
for (int i = 0; i < len; i++) {
int j = len - 1 - i;
for (int k = 0; k < len; k++) {
if (k == i || k == j)
System.out.print(str.charAt(k));
else
System.out.print(" ");
}
System.out.println("");
}
}
// Driver code
public static void main(String[] args)
{
String str = "geeksforgeeks";
int len = str.length();
pattern(str, len);
}
}
// This code is contributed
// by Smitha
# Python 3 program to
# print cross pattern
# Function to print given
# string in cross pattern
def pattern(str, len):
# i and j are the indexes
# of characters to be
# displayed in the ith
# iteration i = 0 initially
# and go upto length of string
# j = length of string initially
# in each iteration of i, we
# increment i and decrement j,
# we print character only of
# k==i or k==j
for i in range(0, len):
j = len - 1 - i
for k in range(0, len):
if (k == i or k == j):
print(str[k],
end="")
else:
print(end=" ")
print(" ")
# Driver code
str = "geeksforgeeks"
len = len(str)
pattern(str, len)
# This code is contributed
# by Smitha
// C# program to print
// cross pattern
using System;
class GFG {
// Function to print given
// string in cross pattern
static void pattern(String str, int len)
{
// i and j are the indexes
// of characters to be
// displayed in the ith
// iteration i = 0 initially
// and go upto length of string
// j = length of string initially
// in each iteration of i, we
// increment i and decrement j,
// we print character only of
// k==i or k==j
for (int i = 0; i < len; i++) {
int j = len - 1 - i;
for (int k = 0; k < len; k++) {
if (k == i || k == j)
Console.Write(str[k]);
else
Console.Write(" ");
}
Console.Write("\n");
}
}
// Driver code
public static void Main()
{
String str = "geeksforgeeks";
int len = str.Length;
pattern(str, len);
}
}
// This code is contributed by Smitha
<?php
// PHP program to print
// Cross pattern
// Function to print given
// string in cross pattern,
// Length of string must be odd
function printPattern($str)
{
$len = strlen($str);
// i goes from 0 to len and
// j goes from len-1 to 0
for ($i = 0, $j = $len - 1;
$i <= $len, $j >= 0;
$i++, $j--)
{
// To print the upper part.
// This loop runs till middle point
// of string i and j become same
if ($i < $j)
{
// Print i spaces
for ($x = 0; $x < $i; $x++)
echo " ";
// Print i'th character
echo $str[$i];
// Print j-i-1 spaces
for ( $x = 0; $x < $j - $i - 1;
$x++)
echo " ";
// Print j'th character
echo $str[$j]."\n";
}
// To print center point
if ($i == $j)
{
// Print i spaces
for ($x = 0; $x < $i; $x++)
echo " ";
// Print middle character
echo $str[$i]."\n";
}
// To print lower part
else if ($i > $j)
{
// Print j spaces
for ($x = $j - 1; $x >= 0;
$x--)
echo " ";
// Print j'th character
echo $str[$j];
// Print i-j-1 spaces
for ( $x = 0; $x < $i - $j - 1;
$x++)
echo " ";
// Print i'h character
echo $str[$i]."\n";
}
}
}
// Driver code
printPattern("geeksforgeeks");
// This code is contributed by mits
?>
<script>
// javascript program to
// print cross pattern // Function to print given
// string in cross pattern
function pattern(str,len)
{
// i and j are the indexes
// of characters to be
// displayed in the ith
// iteration i = 0 initially
// and go upto length of string
// j = length of string initially
// in each iteration of i,
// we increment i and decrement j,
// we print character only
// of k==i or k==j
for (i = 0; i < len; i++)
{
var j = len - 1 - i;
for (k = 0; k < len; k++)
{
if (k == i || k == j)
document.write(str.charAt(k));
else
document.write(" ");
}
document.write("<br>");
}
}
// Driver code
str = "geeksforgeeks";
var len = str.length;
pattern(str, len);
// This code is contributed by Amit Katiyar
</script>
Outputg s
e k
e e
k e
s g
f r
o
f r
s g
k e
e e
e k
g s
Time Complexity: O(len*len), where len is the length of the string.
Auxiliary Space: O(1).
Alternative Solution :
C++
// CPP program to print cross pattern
#include <bits/stdc++.h>
using namespace std;
// Function to print given string in
// cross pattern
void pattern(string str, int len)
{
// i and j are the indexes of characters
// to be displayed in the ith iteration
// i = 0 initially and go upto length of
// string
// j = length of string initially
// in each iteration of i, we increment
// i and decrement j, we print character
// only of k==i or k==j
for (int i = 0; i < len; i++) {
int j = len - 1 - i;
for (int k = 0; k < len; k++) {
if (k == i || k == j)
cout << str[k];
else
cout << " ";
}
cout << endl;
}
}
// driver code
int main()
{
string str = "geeksforgeeks";
int len = str.size();
pattern(str, len);
return 0;
}
// This code is contributed by Satinder Kaur
// Java program to print cross pattern
class GFG {
// Function to print given
// string in cross pattern
static void pattern(String str, int len)
{
// i and j are the indexes of
// characters to be displayed
// in the ith iteration i = 0
// initially and go upto length
// of string j = length of string
// initially in each iteration
// of i, we increment i and decrement
// j, we print character only
// of k==i or k==j
for (int i = 0; i < len; i++) {
int j = len - 1 - i;
for (int k = 0; k < len; k++) {
if (k == i || k == j)
System.out.print(str.charAt(k));
else
System.out.print(" ");
}
System.out.println("");
}
}
// driver code
public static void main(String[] args)
{
String str = "geeksforgeeks";
int len = str.length();
pattern(str, len);
}
}
// This code is contributed by 29AjayKumar
# Python 3 program to print cross pattern
# Function to print given string in
# cross pattern
def pattern(st, length):
# i and j are the indexes of characters
# to be displayed in the ith iteration
# i = 0 initially and go upto length of
# string
# j = length of string initially
# in each iteration of i, we increment
# i and decrement j, we print character
# only of k==i or k==j
for i in range(length):
j = length - 1 - i
for k in range(length):
if (k == i or k == j):
print(st[k], end="")
else:
print(" ", end="")
print()
# driver code
if __name__ == "__main__":
st = "geeksforgeeks"
length = len(st)
pattern(st, length)
// C# program to print cross pattern
using System;
class GFG {
// Function to print given
// string in cross pattern
static void pattern(String str, int len)
{
// i and j are the indexes of
// characters to be displayed
// in the ith iteration i = 0
// initially and go upto length
// of string j = length of string
// initially in each iteration
// of i, we increment i and decrement
// j, we print character only
// of k==i or k==j
for (int i = 0; i < len; i++) {
int j = len - 1 - i;
for (int k = 0; k < len; k++) {
if (k == i || k == j)
Console.Write(str[k]);
else
Console.Write(" ");
}
Console.WriteLine("");
}
}
// Driver code
public static void Main(String[] args)
{
String str = "geeksforgeeks";
int len = str.Length;
pattern(str, len);
}
}
// This code is contributed by Rajput-Ji
<?php
// PHP program to print
// cross pattern
// Function to print given
// string in cross pattern
function pattern($str, $len)
{
// i and j are the indexes of
// characters to be displayed
// in the ith iteration i = 0
// initially and go upto length of
// string
// j = length of string initially
// in each iteration of i, we
// increment i and decrement j, we
// print character only of k==i or k==j
for ($i = 0; $i < $len; $i++)
{
$j = $len -1 - $i;
for ($k = 0; $k < $len; $k++)
{
if ($k == $i || $k == $j)
echo $str[$k];
else
echo " ";
}
echo "\n";
}
}
// Driver code
$str = "geeksforgeeks";
$len = strlen($str);
pattern($str, $len);
// This code is contributed by mits
?>
<script>
// Javascript program to print cross pattern
// Function to print given
// string in cross pattern
function pattern(str , len)
{
// i and j are the indexes of
// characters to be displayed
// in the ith iteration i = 0
// initially and go upto length
// of string j = length of string
// initially in each iteration
// of i, we increment i and decrement
// j, we print character only
// of k==i or k==j
for (var i = 0; i < len; i++)
{
var j = len -1 - i;
for (var k = 0; k < len; k++)
{
if (k == i || k == j)
document.write(str.charAt(k));
else
document.write(" ");
}
document.write('<br>');
}
}
// driver code
var str = "geeksforgeeks";
var len = str.length;
pattern(str, len);
// This code is contributed by 29AjayKumar
</script>
Outputg s
e k
e e
k e
s g
f r
o
f r
s g
k e
e e
e k
g s
Time Complexity: O(len*len), where len is the length of the string.
Auxiliary Space: O(1).
Solution 3: This problem can also be solved by observing that the characters are printed along the left and right diagonals only if we enclose the pattern within a matrix. Now, if the length of the string is len then the pattern can be enclosed within a square matrix of order len.
- The elements along the left diagonal can be accessed by the condition ( i==j ) where i and j are the row and column numbers respectively.
- The elements along the right diagonal can be accessed by the condition (i+j == len-1).
So, run a nested loop of order len and fill the positions satisfying at the above two conditions with respective characters and the rest of the positions with blank spaces.
Below is the implementation of the above approach:
CPP
// C++ program to print the given pattern
#include <bits/stdc++.h>
using namespace std;
// Function to print the given
// string in respective pattern
void printPattern(string str, int len)
{
for (int i = 0; i < len; i++) {
for (int j = 0; j < len; j++) {
// Print characters at corresponding
// places satisfying the two conditions
if ((i == j) || (i + j == len - 1))
cout << str[j];
// Print blank space at rest of places
else
cout << " ";
}
cout << endl;
}
}
// Driver Code
int main()
{
string str = "geeksforgeeks";
int len = str.size();
printPattern(str, len);
return 0;
}
// This code and Approach is contributed by
// Aravind Kimonn
// Java program to print the given pattern
import java.io.*;
class GFG {
// Function to print the given
// string in respective pattern
static void printPattern(String str, int len)
{
for (int i = 0; i < len; i++) {
for (int j = 0; j < len; j++) {
// Print characters at corresponding
// places satisfying the two conditions
if ((i == j) || (i + j == len - 1))
System.out.print(str.charAt(j));
// Print blank space at rest of places
else
System.out.print(" ");
}
System.out.println();
}
}
// Driver code
public static void main(String[] args)
{
String str = "geeksforgeeks";
int len = str.length();
printPattern(str, len);
}
}
// This code is contributed by rag2127.
# Python3 program to print the given pattern
# Function to print the given
# string in respective pattern
def printPattern(Str, Len):
for i in range(Len):
for j in range(Len):
# Print characters at corresponding
# places satisfying the two conditions
if ((i == j) or (i + j == Len - 1)):
print(Str[j], end="")
# Print blank space at rest of places
else:
print(" ", end="")
print()
Str = "geeksforgeeks"
Len = len(Str)
printPattern(Str, Len)
# This code is contributed by divyeshrabadiya07.
// C# program to print the given pattern
using System;
public class GFG {
// Function to print the given
// string in respective pattern
static void printPattern(string str, int len)
{
for (int i = 0; i < len; i++) {
for (int j = 0; j < len; j++) {
// Print characters at corresponding
// places satisfying the two conditions
if ((i == j) || (i + j == len - 1))
Console.Write(str[j]);
// Print blank space at rest of places
else
Console.Write(" ");
}
Console.WriteLine();
}
}
// Driver code
static public void Main()
{
String str = "geeksforgeeks";
int len = str.Length;
printPattern(str, len);
}
}
// This code is contributed by avanitrachhadiya2155
<script>
// javascript program to print the given pattern
// Function to print the given
// string in respective pattern
function printPattern(str , len)
{
for(var i = 0; i < len; i++)
{
for(var j = 0; j < len; j++)
{
// Print characters at corresponding
// places satisfying the two conditions
if((i == j) || (i + j == len - 1))
document.write(str.charAt(j));
// Print blank space at rest of places
else
document.write(" ");
}
document.write('<br>');
}
}
// Driver code
var str = "geeksforgeeks";
var len = str.length;
printPattern(str, len);
// This code is contributed by 29AjayKumar
</script>
Outputg s
e k
e e
k e
s g
f r
o
f r
s g
k e
e e
e k
g s
Time Complexity: O(len*len), where len is the length of the string.
Auxiliary Space: O(1).
This article is contributed by Dinesh T.P.D.
Similar Reads
Find max length odd parity substring
Given a binary string str, the task is to find the maximum length of the sub-string of str that has odd parity. A binary string is said be odd parity if it contains odd number of 1s. Examples: Input: str = "1001110" Output: 6 "001110" is the valid sub-string. Input: str = "101101" Output: 5 Recommen
11 min read
Length of a String
Given a string s, the task is to find the length of the string.Examples: Input: s = "abc"Output: 3Input: s = "GeeksforGeeks"Output: 13Input: s = ""Output: 0Using In-built methodsEvery programming language offers a built-in method as well to find the lengthC++// C++ program to find length // of a str
3 min read
Print the middle character of a string
Given string str, the task is to print the middle character of a string. If the length of the string is even, then there would be two middle characters, we need to print the second middle character. Examples: Input: str = "Java"Output: vExplanation: The length of the given string is even. Therefore,
3 min read
Java String format() Method
In Java, the String.format() method allows us to create a formatted string using a specified format string and arguments. We can concatenate the strings using this method, and at the same time, we can format the output with options such as width, alignment, decimal places, and more.Example: In the e
4 min read
Formatted Output in Java using printf()
Sometimes in programming, it is essential to print the output in a given specified format. Most users are familiar with the printf function in C. Let us discuss how we can Formatting Output with printf() in Java in this article.Formatting Using Java Printf()printf() uses format specifiers for format
5 min read
Check if all the palindromic sub-strings are of odd length
Given a string 's' check if all of its palindromic sub-strings are of odd length or not. If yes then print "YES" or "NO" otherwise. Examples: Input: str = "geeksforgeeks" Output: NO Since, "ee" is a palindromic sub-string of even length. Input: str = "madamimadam" Output: YES Brute Force Approach: S
10 min read
Rotations of a Binary String with Odd Value
Given a binary string. We are allowed to do circular rotation of the string without changing the relative order of the bits in the string. For Example, all possible circular rotation of string "011001" are: 101100 010110 001011 100101 110010 We are required to tell total number of distinct odd decim
3 min read
Print lower triangle with alternate '*' and '#'
Given a number N which denotes the number of rows, the task is to follow the below pattern to print the first N rows of it. Pattern: **#*#**#*#*#*#* Examples: Input: N = 2Output:**# Input: N = 6Output: **#*#**#*#*#*#**#*#*# Approach: Follow the below steps to implement the above pattern: Initialize
4 min read
Number of even substrings in a string of digits
Given a string of digits 0 - 9. The task is to count a number of substrings which when converting into integer form an even number. Examples : Input : str = "1234".Output : 6"2", "4", "12", "34", "234", "1234" are 6 substring which are even.Input : str = "154".Output : 3Input : str = "15".Output : 0
9 min read
K-th lexicographical string of given length
Given two integers N and K, the task is to find lexicographically Kth string of length N. If the number of possible strings of length N is less than K, print -1.Examples: Input: N = 3, K = 10 Output: "aaj" Explanation: The 10th string in the lexicographical order starting from "aaa" is "aaj".Input:
7 min read