This can be done by iterative swapping using two pointers. The first pointer points to the beginning of the string, whereas the second pointer points to the end. Both pointers keep swapping their elements and go towards each other. Essentially, the algorithm simulates the rotation of a string with respect to its midpoint.
Time Complexity : O(n)

printPattern(int n)
{
// Outer loop to handle number of rows n in this case
for (int i = 0; i < n; i++) {
// Inner loop to handle number of columns values changing acc. to outer loop
for (int j = 0; j <= i; j++) {
Print stars (*)
}
Print new line
}
}

1 Lists are mutable. Tuples are immutable
2 In Lists, implication of iterations is Time-consuming. The implication of iterations is comparatively Faster
3 The list is better for performing operations, such as insertion and deletion. Tuple data type is appropriate for accessing the elements
4 Lists consume more memory. Tuple consume less memory as compared to the list