Pages

Sunday, March 30, 2025

Diamond Pattern problem in C++

 #include <iostream>

using namespace std;
// quote- break down bigger problems into smaller problems
// Diamond pattern -


/*
pseudocode
1. build first pyramid
then second pyramid
*/
int main() {
    int n = 4;

    // first pyramid
    for(int i = 1; i <= n; i++){
        // spaces
        for(int j = 1; j <= n-i; j++){
            cout << " ";
        }
        // stars
        for(int j = 1; j <= 2*i-1; j++){
            cout << "*";
        }
        cout << endl;
       
    }
    // second pyramid
    for(int i = n; i >= 1; i--){

        // spaces
        for(int j = 1; j <= n-i; j++){
            cout << " ";
        }
        // stars
        for(int j = 1; j <= 2*i-1; j++){
            cout << "*";
        }
       

        cout << endl;

    }

    return 0;

}

OUTPUT-
* *** ***** ******* ******* ***** ***
*

No comments:

Post a Comment

3917. Count Indices With Opposite Parity (Brute Force) O(n2) + Optimized Solution O(n) + tips LEETCODE WEEKLY 500

  class Solution {     public int [] countOppositeParity ( int [] nums ) {          // approach 1 - checks every pair         int n = n...