Interview Special: Top 10 Pattern-Based Coding Questions in C

When you walk into a technical interview for a software engineering role, the interviewer isn't just looking for whether you memorized syntax. They want to evaluate your logic-building skills, spatial reasoning, and ability to handle edge cases.

Among junior and mid-level coding rounds, pattern-based questions remain a favorite screening tool. Why? Because solving them requires precise command over nested loops, variable scope, boundary conditions, and control flow.

In this special interview guide, we will break down the top 10 pattern-based coding questions in C that frequently appear in technical assessments, complete with explanations and code implementations.

Why Do Interviewers Ask Pattern Questions?

• Loop Mastery: They test whether you truly understand how inner and outer loops interact.

• Algorithmic Thinking: They measure your ability to map mathematical relationships (rows vs. columns) to code.

• Attention to Detail: Small off-by-one errors or mismanaged spaces instantly break a pattern, revealing your debugging discipline.

The Top 10 Pattern Coding Questions

1. Solid Square Matrix

• The Challenge: Print a solid square of stars.

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            printf("* ");
        }
        printf("\n");
    }
    return 0;
}

2. Right-Angled Triangle

• The Challenge: Print stars increasing row by row.

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            printf("* ");
        }
        printf("\n");
    }
    return 0;
}

3. Inverted Right-Angled Triangle

• The Challenge: Print a triangle that starts wide and shrinks.

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= (n - i + 1); j++) {
            printf("* ");
        }
        printf("\n");
    }
    return 0;
}

4. Numeric Right-Angled Triangle

• The Challenge: Print numbers instead of stars in a triangle format (1, 1 2, 1 2 3, etc.).

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            printf("%d ", j);
        }
        printf("\n");
    }
    return 0;
}

5. Repeated Row Number Triangle

• The Challenge: Print the row number repeatedly across each row (1, 2 2, 3 3 3, etc.).

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            printf("%d ", i);
        }
        printf("\n");
    }
    return 0;
}

6. Floyd's Triangle

• The Challenge: Print consecutive numbers continuously across rows (1, 2 3, 4 5 6, etc.).

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4, num = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            printf("%d ", num++);
        }
        printf("\n");
    }
    return 0;
}

7. Centered Pyramid Pattern

• The Challenge: Print a symmetrical centered pyramid using spaces and stars.

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int space = 1; space <= (n - i); space++) printf(" ");
        for (int star = 1; star <= (2 * i - 1); star++) printf("*");
        printf("\n");
    }
    return 0;
}

8. Diamond Pattern

• The Challenge: Combine an upright pyramid and an inverted pyramid to form a complete diamond.

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 3;
    // Upper Pyramid
    for (int i = 1; i <= n; i++) {
        for (int s = 1; s <= (n - i); s++) printf(" ");
        for (int st = 1; st <= (2 * i - 1); st++) printf("*");
        printf("\n");
    }
    // Lower Inverted Pyramid
    for (int i = n - 1; i >= 1; i--) {
        for (int s = 1; s <= (n - i); s++) printf(" ");
        for (int st = 1; st <= (2 * i - 1); st++) printf("*");
        printf("\n");
    }
    return 0;
}

9. Binary 0-1 Triangle

• The Challenge: Alternate 1 and 0 values in a triangular grid based on row/column parity.

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            if ((i + j) % 2 == 0) printf("1 ");
            else printf("0 ");
        }
        printf("\n");
    }
    return 0;
}

10. Hollow Square Border Pattern

• The Challenge: Print a square where only the outer border contains stars, and the inside is hollow (spaces).

• Code Implementation:

#include <stdio.h>

int main() {
    int n = 4;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == 1 || i == n || j == 1 || j == n) {
                printf("* ");
            } else {
                printf("  "); // Inner empty space
            }
        }
        printf("\n");
    }
    return 0;
}

Interview Success Tips

1. Talk Through Your Logic: Interviewers love candidates who verbalize their thought process. Explain why you are setting your inner loop boundary or handling whitespace.

2. Dry Run with Small Inputs: Before finalizing your code, manually trace your loops on paper using $N = 3$ to catch potential fencepost errors.

3. Keep Code Clean: Use meaningful loop counters (row, col) when tackling multi-layered patterns to avoid confusion.

Mastering these 10 patterns guarantees that you will walk into your next coding interview with the confidence and logic-building agility required to ace loop-based challenges!

For all Pattern Programs list click here: 

…till the next post, bye-bye & take care