Reverse a String Using Recursion

Problem

Reverse a string using recursive calls.

Examples

Example 1

Input: "hello"

Output: "olleh"

Example 2

Input: "abc"

Output: "cba"

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Reverse a String Using Recursion

Reverse a string using recursive calls. Reduce the problem by one character per recursive call. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n²) time due to string slicing and concatenation; O(n) recursion stack.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.