Program for Expressionless Face Pattern printing Last Updated : 20 Feb, 2023 Summarize Comments Improve Suggest changes Share Like Article Like Report Given the value of n, i.e, number of lines, print the pattern. Examples : Input: n = 5Output:*_*****_*****_***_****_****_*****_***_***_*******_**_**_*********_*_*_***** Input: n = 10Output:*_**********_**********_***_*********_*********_*****_********_********_*******_*******_*******_*********_******_******_***********_*****_*****_*************_****_****_***************_***_***_*****************_**_**_*******************_*_*_********** C++ // C++ implementation to print the pattern #include <bits/stdc++.h> using namespace std; // Function to print required // number of stars void print1(int i) { for (int j = 1; j <= i; j++) cout << "*"; } void print(int n) { for (int i = 1; i <= n; i++) { // function calling to print // the initial stars in each line print1(i); // printing underscore cout << "_"; // function calling to print // stars on right side of first half print1(n - i + 1); // printing underscore cout << "_"; // function calling to print // stars on left side of second half print1(n - i + 1); // printing underscore cout << "_"; // function calling to print // the ending stars print1(i); cout << endl; } } // Driver code int main() { // number of lines int n = 5; // function calling print(n); return 0; } Java // Java implementation to print the pattern import java.io.*; class GFG { // Function to print required // number of stars static void print1(int i) { for (int j = 1; j <= i; j++) System.out.print("*"); } static void print(int n) { for (int i = 1; i <= n; i++) { // function calling to print // the initial stars in each line print1(i); // printing underscore System.out.print("_"); // function calling to print // stars on right side of first half print1(n - i + 1); // printing underscore System.out.print("_"); // function calling to print // stars on left side of second half print1(n - i + 1); // printing underscore System.out.print("_"); // function calling to print // the ending stars print1(i); System.out.println(); } } // Driver code public static void main (String[] args) { // number of lines int n = 5; // function calling print(n); } } // This code is contributed by vt_m. Python3 # Python3 implementation # to print the pattern # Function to print # required number of stars def print1(i): for j in range(1, i + 1): print("*", end = "") def printPattern(n): for i in range(1, n + 1): # function calling to # print the initial # stars in each line print1(i) # printing underscore print("_", end = "") # function calling to # print stars on right # side of first half print1(n - i + 1) # printing underscore print("_", end = "") # function calling to # print stars on left # side of second half print1(n - i + 1) # printing underscore print("_", end = "") # function calling to print # the ending stars print1(i) print("") # Driver code # number of lines n = 5 # function calling printPattern(n) # This code is contributed # by Smitha C# // C# implementation to print the pattern using System; class GFG { // Function to print required // number of stars static void print1(int i) { for (int j = 1; j <= i; j++) Console.Write("*"); } static void print(int n) { for (int i = 1; i <= n; i++) { // function calling to print // the initial stars in each line print1(i); // printing underscore Console.Write("_"); // function calling to print // stars on right side of first half print1(n - i + 1); // printing underscore Console.Write("_"); // function calling to print // stars on left side of second half print1(n - i + 1); // printing underscore Console.Write("_"); // function calling to print // the ending stars print1(i); Console.WriteLine(); } } // Driver code public static void Main () { // number of lines int n = 5; // function calling print(n); } } // This code is contributed by vt_m. PHP <?php // PHP implementation for // expressionless face pattern function print1($i) { for ($j = 1; $j <= $i; $j++) echo "*"; } function printp($n) { for ($i = 1; $i <= $n; $i++) { // function calling to print // the initial stars in each line print1($i); // printing underscore echo "_"; // function calling to print // stars on right side of first half print1($n - $i + 1); // printing underscore echo "_"; // function calling to print // stars on left side of second half print1($n - $i + 1); // printing underscore echo "_"; // function calling to print // the ending stars print1($i); echo "\n"; } } // Driver code $n = 5; printp($n); // This code is contributed by Mithun Kumar ?> JavaScript <script> // javascript implementation to print the pattern // Function to print required // number of stars function print1(i) { for (var j = 1; j <= i; j++) document.write("*"); } function print(n) { for (var i = 1; i <= n; i++) { // function calling to print // the initial stars in each line print1(i); // printing underscore document.write("_"); // function calling to print // stars on right side of first half print1(n - i + 1); // printing underscore document.write("_"); // function calling to print // stars on left side of second half print1(n - i + 1); // printing underscore document.write("_"); // function calling to print // the ending stars print1(i); document.write('<br>'); } } // Driver code // number of lines var n = 5; // function calling print(n); // This code is contributed by 29AjayKumar </script> Time complexity: O(n2), where n is the given integer.Auxiliary space: O(1) using constant space for variables Comment More infoAdvertise with us Next Article Program for Expressionless Face Pattern printing B bansal_rtk_ Follow Improve Article Tags : Misc DSA Basic Coding Problems pattern-printing Practice Tags : Miscpattern-printing Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read SQL Commands | DDL, DQL, DML, DCL and TCL Commands SQL commands are crucial for managing databases effectively. These commands are divided into categories such as Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL), Data Query Language (DQL), and Transaction Control Language (TCL). In this article, we will e 7 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 4 min read Like