- \n
- Python strings don’t have a built in
.reverse()<\/code> method, so you need a workaround.<\/li>\n\n\n\n- The fastest and most common method is slicing:
text[::-1]<\/code>.<\/li>\n\n\n\n- Other reliable options include
reversed()<\/code> withjoin()<\/code>, a for loop,join()<\/code> withlist.reverse()<\/code>, recursion, and a stack based approach.<\/li>\n\n\n\n- All 6 methods run in O(n) time for most practical purposes, but they differ in readability, space usage, and interview suitability.<\/li>\n\n\n\n
- If you need to reverse the order of words instead of characters, that’s a different problem with a different solution.<\/li>\n<\/ul>\n\n\n\n
Why Python Doesn’t Have a Built-In String Reverse<\/strong><\/h2>\n\n\n\n
If you’ve searched for a
.reverse()<\/code> method for strings and come up empty, you’re not alone. Python<\/a> strings are immutable, which means they can’t be changed in place the way lists can.<\/p>\n\n\n\nThat’s exactly why list has a
.reverse()<\/code> method<\/a> and string doesn’t. You’ll need one of the six approaches below instead, and picking the right one depends on whether you’re writing production code or preparing for a coding interview.<\/p>\n\n\n\n\n \ud83d\udca1 Did You Know?<\/strong>\n
\n Python strings skip the .reverse() method entirely because they’re immutable. Mutable sequences like lists get in-place methods such as .reverse() and .append(), but strings always return a new object instead of modifying themselves.\n\n\n\n6 Ways to Reverse a String in Python<\/strong><\/h2>\n\n\n\n
![\"6](\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/07\/ChatGPT-Image-Jul-15-2026-07_56_35-AM-1200x657.webp\" "\\"\\"")
<\/figure>\n\n\n\n1. Slicing with
[::-1]<\/code><\/strong><\/h3>\n\n\n\nThis is the method most Python developers<\/a> reach for first. It’s short, readable, and doesn’t need a loop or import.<\/p>\n\n\n\n
text = \"GUVI\"\nreversed_text = text[::-1]\nprint(reversed_text) # IVUG<\/code><\/pre>\n\n\n\n2.
reversed()<\/code> withjoin()<\/code><\/strong><\/h3>\n\n\n\nreversed()<\/code> returns an iterator, not a string, so you pair it with\"\".join()<\/code> to rebuild the string.<\/p>\n\n\n\ntext = \"GUVI\"\nreversed_text = \"\".join(reversed(text))\nprint(reversed_text) # IVUG<\/code><\/pre>\n\n\n\n3. For Loop<\/strong><\/h3>\n\n\n\n
Useful when you want to see exactly how the reversal happens, character by character.<\/p>\n\n\n\n
def reverse_with_loop(text):\n result = \"\"\n for char in text:\n result = char + result\n return result\n\nprint(reverse_with_loop(\"GUVI\")) # IVUG<\/code><\/pre>\n\n\n\n4.
join()<\/code> withlist.reverse()<\/code><\/strong><\/h3>\n\n\n\nHere you convert the string to a list, reverse the list in place, then join it back.<\/p>\n\n\n\n
def reverse_with_join(text):\n chars = list(text)\n chars.reverse()\n return \"\".join(chars)\n\nprint(reverse_with_join(\"GUVI\")) # IVUG<\/code><\/pre>\n\n\n\n5. Recursion<\/strong><\/h3>\n\n\n\n
This method breaks the string down until it hits an empty string, then rebuilds it in reverse as the calls return.<\/p>\n\n\n\n
def reverse_recursive(text):\n if len(text) == 0:\n return text\n return reverse_recursive(text[1:]) + text[0]\n\nprint(reverse_recursive(\"GUVI\")) # IVUG<\/code><\/pre>\n\n\n\n6. Stack (LIFO)<\/strong><\/h3>\n\n\n\n
Push every character onto a stack, then pop them off. Since a stack is last in, first out, the popped order is automatically reversed.<\/p>\n\n\n\n
def reverse_with_stack(text):\n stack = list(text)\n result = \"\"\n while stack:\n result += stack.pop()\n return result\n\nprint(reverse_with_stack(\"GUVI\")) # IVUG<\/code><\/pre>\n\n\n\nIf you want to build a stronger foundation before moving to advanced string and data structure problems, HCL GUVI’s Python Course<\/a> covers this with hands on projects and placement support.<\/strong><\/em><\/p>\n\n\n\n
Method Comparison In Python Reverse String: Time, Space, and Readability<\/strong><\/h2>\n\n\n\n
![\"Method](\"https:\/\/www.guvi.in\/blog\/wp-content\/uploads\/2026\/07\/ChatGPT-Image-Jul-15-2026-07_59_35-AM-1200x675.webp\" "\\"\\"")
<\/figure>\n\n\n\nMethod<\/th> Time Complexity<\/th> Space Complexity<\/th> Readability<\/th> When to Use<\/th><\/tr><\/thead> Slicing [::-1]<\/code><\/td>O(n)<\/td> O(n)<\/td> High<\/td> Everyday scripts, quick fixes<\/td><\/tr> reversed()<\/code> +join()<\/code><\/td>O(n)<\/td> O(n)<\/td> High<\/td> Pythonic, iterator based style<\/td><\/tr> For loop<\/td> O(n\u00b2)*<\/td> O(n)<\/td> Medium<\/td> Learning how reversal works internally<\/td><\/tr> join()<\/code> +list.reverse()<\/code><\/td>O(n)<\/td> O(n)<\/td> Medium<\/td> When you already have a list of characters<\/td><\/tr> Recursion<\/td> O(n)<\/td> O(n)<\/td> Low for beginners<\/td> Practicing recursive thinking<\/td><\/tr> Stack<\/td> O(n)<\/td> O(n)<\/td> Medium<\/td> Demonstrating LIFO logic in interviews<\/td><\/tr><\/tbody><\/table> Method Comparison: Time, Space, and Readability<\/figcaption><\/figure>\n\n\n\n *The for loop version is O(n\u00b2) in the worst case because each concatenation (
char + result<\/code>) creates a brand new string, since strings are immutable. For short strings this rarely matters, but avoid it for large text.<\/p>\n\n\n\nReverse String Without Slicing: For Interview Coding Rounds<\/strong><\/h2>\n\n\n\n
Some interviewers specifically ask you to reverse a string without slicing, to check if you understand pointer based logic. Here’s the two-pointer swap approach, done on a list since strings can’t be modified in place.<\/p>\n\n\n\n
def reverse_without_slicing(text):\n chars = list(text)\n left, right = 0, len(chars) - 1\n while left < right:\n chars[left], chars[right] = chars[right], chars[left]\n left += 1\n right -= 1\n return \"\".join(chars)\n\nprint(reverse_without_slicing(\"GUVI\")) # IVUG<\/code><\/pre>\n\n\n\nYou start with pointers at both ends of the list, swap the characters, then move the pointers toward the middle. This is the same logic used to check for palindromes, so it’s worth practicing before interviews.<\/p>\n\n\n\n
Reverse Words in a String (Not Characters): A Different Problem<\/strong><\/h2>\n\n\n\n
This one trips up a lot of beginners. Reversing a string flips the character order. Reversing the words in a sentence keeps each word intact but flips their order.<\/p>\n\n\n\n
sentence = \"Learn Python with GUVI\"\nreversed_words = \" \".join(sentence.split()[::-1])\nprint(reversed_words) # GUVI with Python Learn<\/code><\/pre>\n\n\n\nHere,
.split()<\/code> breaks the sentence into a list of words,[::-1]<\/code> reverses that list, and\" \".join()<\/code> puts it back together with spaces. If you’re asked this in an interview, clarify which version they mean before you start coding.<\/p>\n\n\n\nCommon Mistakes to Avoid<\/strong><\/h2>\n\n\n\n
- \n
- Assuming strings have a
.reverse()<\/code> method.<\/strong> Only lists have it. Calling.reverse()<\/code> on a string raises anAttributeError<\/code>. Use slicing orreversed()<\/code> instead.<\/li>\n\n\n\n- Using string concatenation inside a loop for long text.<\/strong> Since strings are immutable, each concatenation builds a new string. For large inputs, this gets slow. Prefer
join()<\/code> or slicing.<\/li>\n\n\n\n- Mixing up “reverse a string” with “reverse the words in a string.”<\/strong> These are two different problems with two different solutions, and interviewers often ask both.<\/li>\n\n\n\n
- Forgetting the base case in recursion.<\/strong> Skipping it for an empty string causes infinite recursion and a
RecursionError<\/code>.<\/li>\n<\/ol>\n\n\n\n - Using string concatenation inside a loop for long text.<\/strong> Since strings are immutable, each concatenation builds a new string. For large inputs, this gets slow. Prefer
- The fastest and most common method is slicing: