easyBasic Recursion

Understand Recursion (Print N times)

Use recursion to print the word hello exactly n times, once per line.

GeeksforGeeks ↗

Work through the cases

3 examples

Input notation

An integer n from 1 through 100.

Expected result

n lines containing hello.

Case 1

Input

Expected output

hello
hello

Case 2

Input

Expected output

hello

Case 3

Input

Expected output

hello
hello
hello

These notes use simplified input/output notation. The linked platform defines the method signature and judge format.

FROM IDEA TO IMPLEMENTATION

Understand the approach.

Compare the documented approaches below. Brute force, better, and optimal versions appear where available; a direct exercise may need only one approach.

Print once and recurse on n-1. Stop at zero. Time and call-stack space: O(n).

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        ArrayList<Long> values = new ArrayList<>();
        while (in.hasNextLong()) values.add(in.nextLong());
        long[] a = values.stream().mapToLong(Long::longValue).toArray();
        long n = a[0];
        class R { void f(long k) { if(k==0)return; System.out.println("hello"); f(k-1); } } new R().f(n);
    }
}

Reference code. Platform solutions may use supplied node types, imports, or collection libraries; foundational examples are complete programs.