C++ Pattern Party: 22 Cool Designs by The_OS_Coder.

C++ Pattern Party: 22 Cool Designs by The_OS_Coder.

Description:

Dive into the fascinating world of pattern printing with C++! In this blog, we explore 22 diverse and creative patterns, ranging from basic shapes to intricate designs. Whether you're a beginner looking to strengthen your programming fundamentals or an experienced coder seeking inspiration, these examples will guide you step-by-step with code snippets and detailed explanations. Enhance your problem-solving skills and make your C++ journey more engaging!


tips for solving * pattern :→

A> the outer loop (i) always used for showing


pattern1 :→

logic building :→

solution-1 :→

#include<bits/stdc++.h>
using namespace std;

void printPattern_1(int n){
  for (int i = 0; i < n; i++)
  {
   for (int j = 0; j < n; j++)
   {
     cout << "* ";
   }
   cout << "\n";
  }


}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_1(n);
}

pattern 2:→

logic building :→

solution 2 :→

#include<bits/stdc++.h>
using namespace std;

void printPattern_2(int n){
  for (int i = 0; i < n; i++)
  {
   for (int j = 0; j <=i; j++)
   {
     cout << "* ";
   }
   cout << "\n";
  }


}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_2(n);

}

pattern 3:→

logic building :→


solution 3 :→

#include<bits/stdc++.h>
using namespace std;

void printPattern_3(int n){
  for (int i = 1; i <=n; i++)
  {
   for (int j = 1; j<=i; j++)
   {
     cout << j<<" ";
     // why not i?
     // the reason is : if i is 2 then j will print 2 times 2 that's the prblm here
   }
   cout << "\n";
  }


}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_4(n);

}

pattern 4:→

logic building :→

solution:→

#include<bits/stdc++.h>
using namespace std;

void printPattern_4(int n){
  for (int i = 1; i <=n; i++)
  {
   for (int j = 1; j<=i; j++)
   {
     cout << i<<" ";
     // why i?
     // i=1 then show 1
     //i=2 then show only 2,2 (cz i is 2 only in a irratation)
   }
   cout << "\n";
  }


}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_4(n);
}

output:→


pattern 5:→

logic:→

solution :→

#include<bits/stdc++.h>
using namespace std;

void printPattern_5(int n){
  for (int i = 1; i <=n; i++)
  {
   for (int j = 1; j<=n-i+1; j++)
   //n-i+1=5-5+1=1
   {
     cout << "*"<<" ";
   }
   cout << "\n";
  }


}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_5(n);

}

pattern 6 :→

logic :→

solution :→

#include<bits/stdc++.h>
using namespace std;

void printPattern_6(int n){
  for (int i = 1; i <=n; i++)
  {
   for (int j = 1; j<=n-i+1; j++)

   {
     cout <<j <<" ";
   }
   cout << "\n";
  }

}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_6(n);
}

pattern 7 :→

logic:→


solution :→

#include<bits/stdc++.h>
using namespace std;

void printPattern_7(int n){
  for (int i = 1; i <=n; i++)
  {
   for (int j = 1; j<=n-i; j++)
   {
     cout << " ";
   }

   for (int k = 1; k <=2*i-1; k++)
   {
     cout << "*";
   }

   for (int l = 1; l <=n-i; l++)
   {
     cout << " ";
   }

   cout << "\n";
  }

}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_7(n);

}

pattern 8 :→

logic:→

solution :→

#include<bits/stdc++.h>
using namespace std;

void printPattern_8(int n){
  for (int i = 1; i <=n; i++)
  {
   for (int j = 1; j<i; j++)
   {
     cout << " ";
   }

   for (int k = 0; k < 2 * n - (2 * i - 1); k++)
   {
     cout << "*";
   }

     for (int l = 0; l < i; l++)
     {
       cout << " ";
     }

   cout << "\n";
  }

}
int main(){

  int n;
  cout << "how many * you want to see ?";
  cin >> n;
  printPattern_8(n);

}

pattern 9:→

logic:→

we have learn 2 pattern we just have to add those and boom it’s done.

solution :→


pattern 10 :→


pattern 11 :→


pattern 12 :→


pattern 13:→


pattern 14:→


pattern 15:→


pattern 16 :→


pattern 17 :→


problem 18:→


problem 19:→


problem 20 :→


problem 21 :→


problem 22:→