Disclaimer: It's highly recommend trying to solve it before looking at the solution.

Approach

Algorithm

Intuition: This pattern prints rows of decreasing-length alphabet sequences starting from 'A'. In the first row, it prints from 'A' to 'E', in the second from 'A' to 'D', and so on, reducing by one letter each row.

The outer loop runs for N rows (from 0 to N-1).
In the inner loop, for each row i, we print characters from 'A' up to 'A' + (N - i - 1).
This ensures that the number of characters decreases by 1 with each row.
After each inner loop finishes, print a newline to move to the next row.

Code

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

// Function to print the pattern of alphabets in a decreasing order
void pattern15(int N) {
    // Outer loop for the number 