Print name N times using recursion
Recursion DSA practice problem on Onlearn.
Difficulty: easy.
Topics: Printing a Name N Times Using Recursion, Recursion, Functions, Time Complexity, Space Complexity, Big O Notation, Stack, space complexity, general programming, recursion base case, recursion, time complexity analysis, Recursive Function Components.
Print Name N Times using Recursion Problem Statement Given a string and an integer N, print the string N times using recursion. Input Specification The input will consist of two parts: A string, let's call it S. An integer N (1 <= N <= 1000), representing the number of times S should be printed. Output Specification Print the string S exactly N times, each on a new line. Sample Test Cases Sample Input 1: Sample Output 1: Difficulty Level: Easy