CareerCup

Can you give me an example of an output?

Hi 123ayanjit,
for example string str = "hello" and n=3 then we have to print hello n^n times which means 27 times. but please also consider that n is very large so we can't store it.

String(repeating: theString, count totalCount

print(str*(len(str)*len(str)))

If using recursion is allowed then we can generate as

package com.practice.algo;

public class PrinNNString {

  private static void printNNString(String s, int n, int k) {
    if (k == 1) {
      for (int i = 0; i < n; i++) {
        System.out.print(s);
      }
    } else {
      for (int i = 0; i < n; i++) {
        printNNString(s, n, k - 1);
      }
    }
  }

  private static void printNNString(String s, int n) {
    printNNString(s, n, n);
    System.out.println("");
  }

  public static void main(String[] args) {
    printNNString("Hello", 3);
    printNNString("Hello", 2);
    printNNString("Hello", 1);
  }

}

is there any other way to solve this problem? is it possible using tree?