# Algorithms Challenge - #3: String Transform

**URL:** <https://forum.kirupa.com/t/algorithms-challenge-3-string-transform/684004>\
**Category:** programming\
**Created:** [November 12, 2026, 4:05pm UTC](https://forum.kirupa.com/t/algorithms-challenge-3-string-transform/684004 "2026-11-12T16:05:06Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![WaffleFries](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/wafflefries/32/31185_2.png) [@WaffleFries](https://forum.kirupa.com/u/WaffleFries)\
**Post date:** [November 12, 2026, 4:05pm UTC](https://forum.kirupa.com/t/algorithms-challenge-3-string-transform/684004/1 "2026-11-12T16:05:06Z")

</div>

Implement a function that moves the first character of a string to the end, returning the transformed string. If the input is empty, return an empty string.

**Examples:**

- `rotate_left("hello")` returns `elloh`
- `rotate_left("a")` returns `a`
- `rotate_left("")` returns `""`

```python
def rotate_left(s: str) -> str:\n pass

```

**Rules:**

- Any language or pseudocode is fine. The stub just shows the shape.
- Say the time complexity of your approach.
- short rule
- one well defined function with input and output
- 2 to 4 word topic label

Post your solution as a reply. Answer goes up in about a day.