BackmediumStrings Accenture

Reverse Substring Concatenation Solution

Problem Statement

Given a string `s` of length `n`, return a comma-separated string of all substrings of `s` in reverse order, where each substring in the output string should be in reverse order.

Example 1

Input

abc

Output

c,b,a

Example 2

Input

abcd

Output

d,c,b,a

Constraints

1 <= n <= 1000
s contains only lowercase English letters
s is not empty
n is a positive integer

Reverse Substring Concatenation Solution

Problem Statement

Input

Output

Input

Output

Constraints

More Strings Problems

Optimized Approach

Step-by-Step Dry Run

Tested Solutions