Day 8 — Pattern Problems — Practice & Quiz

📝 Practice Problems

Given n, print a right-angled triangle of stars with n rows.

Input: n (integer)
Sample Output (n=4):

*
**
***
****

Use a nested loop where the inner loop prints i stars for row i.

Print Floyd's triangle for n rows starting from 1.

Sample Output (n=4):

Maintain a counter that increments each time you print a number.

Print an inverted right triangle of numbers starting from 1 to the current row length.

Sample Output (n=4):

Outer loop decreases from n to 1, inner loop runs from 1 to i.

Print a pyramid of numbers with each row showing 1 to row number, centered with spaces.

Sample Output (n=4):

Use string center alignment or space padding before the numbers.

Print a diamond of stars with a total of (2n - 1) rows.

Sample Output (n=3):

  *
 ***
*****
 ***
  *

First build the upper pyramid, then the inverted one.

Create a numeric pyramid where numbers increase and then decrease symmetrically.

Sample Output (n=5):

Use one loop to build ascending numbers, then another for descending.

Print a hollow diamond pattern of stars for given odd size.

Print stars only at the borders and spaces inside.

Print a zig-zag pattern across k columns and n rows.

Alternate upward and downward diagonals.

Generate Pascal's triangle formatted as centered numbers for n rows.

Use the formula C(n, k) = n! / (k! * (n-k)!).

Print a pyramid pattern where each row alternates between 0 and 1.

Use (i + j) % 2 to decide whether to print 0 or 1.