Binary TreesBinary Trees36
  1. 1Preorder Traversal of a Binary Tree using Recursion
  2. 2Preorder Traversal of a Binary Tree using Iteration
  3. 3Inorder Traversal of a Binary Tree using Recursion
  4. 4Inorder Traversal of a Binary Tree using Iteration
  5. 5Postorder Traversal of a Binary Tree Using Recursion
  6. 6Postorder Traversal of a Binary Tree using Iteration
  7. 7Level Order Traversal of a Binary Tree using Recursion
  8. 8Level Order Traversal of a Binary Tree using Iteration
  9. 9Reverse Level Order Traversal of a Binary Tree using Iteration
  10. 10Reverse Level Order Traversal of a Binary Tree using Recursion
  11. 11Find Height of a Binary Tree
  12. 12Find Diameter of a Binary Tree
  13. 13Find Mirror of a Binary Tree
  14. 14Left View of a Binary Tree
  15. 15Right View of a Binary Tree
  16. 16Top View of a Binary Tree
  17. 17Bottom View of a Binary Tree
  18. 18Zigzag Traversal of a Binary Tree
  19. 19Check if a Binary Tree is Balanced
  20. 20Diagonal Traversal of a Binary Tree
  21. 21Boundary Traversal of a Binary Tree
  22. 22Construct a Binary Tree from a String with Bracket Representation
  23. 23Convert a Binary Tree into a Doubly Linked List
  24. 24Convert a Binary Tree into a Sum Tree
  25. 25Find Minimum Swaps Required to Convert a Binary Tree into a BST
  26. 26Check if a Binary Tree is a Sum Tree
  27. 27Check if All Leaf Nodes are at the Same Level in a Binary Tree
  28. 28Lowest Common Ancestor (LCA) in a Binary Tree
  29. 29Solve the Tree Isomorphism Problem
  30. 30Check if a Binary Tree Contains Duplicate Subtrees of Size 2 or More
  31. 31Check if Two Binary Trees are Mirror Images
  32. 32Calculate the Sum of Nodes on the Longest Path from Root to Leaf in a Binary Tree
  33. 33Print All Paths in a Binary Tree with a Given Sum
  34. 34Find the Distance Between Two Nodes in a Binary Tree
  35. 35Find the kth Ancestor of a Node in a Binary Tree
  36. 36Find All Duplicate Subtrees in a Binary Tree
GraphsGraphs46
  1. 1Breadth-First Search in Graphs
  2. 2Depth-First Search in Graphs
  3. 3Number of Provinces in an Undirected Graph
  4. 4Connected Components in a Matrix
  5. 5Rotten Oranges Problem - BFS in Matrix
  6. 6Flood Fill Algorithm - Graph Based
  7. 7Detect Cycle in an Undirected Graph using DFS
  8. 8Detect Cycle in an Undirected Graph using BFS
  9. 9Distance of Nearest Cell Having 1 - Grid BFS
  10. 10Surrounded Regions in Matrix using Graph Traversal
  11. 11Number of Enclaves in Grid
  12. 12Word Ladder - Shortest Transformation using Graph
  13. 13Word Ladder II - All Shortest Transformation Sequences
  14. 14Number of Distinct Islands using DFS
  15. 15Check if a Graph is Bipartite using DFS
  16. 16Topological Sort Using DFS
  17. 17Topological Sort using Kahn's Algorithm
  18. 18Cycle Detection in Directed Graph using BFS
  19. 19Course Schedule - Task Ordering with Prerequisites
  20. 20Course Schedule 2 - Task Ordering Using Topological Sort
  21. 21Find Eventual Safe States in a Directed Graph
  22. 22Alien Dictionary Character Order
  23. 23Shortest Path in Undirected Graph with Unit Distance
  24. 24Shortest Path in DAG using Topological Sort
  25. 25Dijkstra's Algorithm Using Set - Shortest Path in Graph
  26. 26Dijkstra’s Algorithm Using Priority Queue
  27. 27Shortest Distance in a Binary Maze using BFS
  28. 28Path With Minimum Effort in Grid using Graphs
  29. 29Cheapest Flights Within K Stops - Graph Problem
  30. 30Number of Ways to Reach Destination in Shortest Time - Graph Problem
  31. 31Minimum Multiplications to Reach End - Graph BFS
  32. 32Bellman-Ford Algorithm for Shortest Paths
  33. 33Floyd Warshall Algorithm for All-Pairs Shortest Path
  34. 34Find the City With the Fewest Reachable Neighbours
  35. 35Minimum Spanning Tree in Graphs
  36. 36Prim's Algorithm for Minimum Spanning Tree
  37. 37Disjoint Set (Union-Find) with Union by Rank and Path Compression
  38. 38Kruskal's Algorithm - Minimum Spanning Tree
  39. 39Minimum Operations to Make Network Connected
  40. 40Most Stones Removed with Same Row or Column
  41. 41Accounts Merge Problem using Disjoint Set Union
  42. 42Number of Islands II - Online Queries using DSU
  43. 43Making a Large Island Using DSU
  44. 44Bridges in Graph using Tarjan's Algorithm
  45. 45Articulation Points in Graphs
  46. 46Strongly Connected Components using Kosaraju's Algorithm

Reverse Every Word in a String

Problem Statement

Given a string containing one or more words separated by spaces, your task is to reverse each word individually, while keeping the order of words the same.

Each word is defined as a sequence of characters separated by spaces. Spaces should be preserved between words, but the characters of each word should appear in reverse order.

This operation should not affect extra spaces or punctuation. The final result should be a single string with all words reversed.

Examples

Input String Output String Description
"hello world" "olleh dlrow" Each word is reversed individually
"data structures" "atad serutcurts" Two words reversed, order remains
" a b c " " a b c " Single-letter words are the same; spaces preserved
" hello world " " olleh dlrow " Multiple spaces between and around words are preserved
"example" "elpmaxe" Single word reversed
" " " " Only spaces, no words to reverse
"" "" Empty string returns empty string

Visualization Player

Solution

To solve this problem, the goal is to reverse the characters of each individual word while maintaining the original word order and spacing.

Let’s break it down:

1. Words are separated by spaces: So the first step is to split the input string into a list of words. For example, splitting "hello world" by spaces gives us ["hello", "world"].

2. Reverse each word: Now, for each word in the list, we reverse its characters. "hello" becomes "olleh", and "world" becomes "dlrow".

3. Maintain spacing: When joining the words back, we use exactly one space between them. However, it’s important to handle leading, trailing, or multiple spaces correctly. If the original string had extra spaces, the output should reflect that. In programming, some built-in functions like split() remove extra spaces, so we might have to handle spacing manually in those cases.

4. What happens in edge cases?

  • If the input is an empty string (""), there’s nothing to reverse, so the output should also be an empty string.
  • If the input contains only spaces (like " "), then the result should still be the same number of spaces—there are no words to reverse.
  • If the input has one word, then we simply reverse that word and return.
  • If the input contains punctuation or symbols, we treat them as part of the word and reverse them along with the word. For example, "hello!" becomes "!olleh".

This solution is efficient and easy to understand. It makes use of string operations like splitting, reversing, and joining—all of which are beginner-friendly and commonly available in most programming languages.

Final note: Always consider edge cases like empty strings, multiple spaces, or single-letter words. The trick is to focus only on reversing characters of each word and not disturbing the spacing unless required by the problem.

Algorithm Steps

  1. Split the input string using space as delimiter into a list of words.
  2. Iterate through each word in the list.
  3. For each word, reverse its characters using a loop or inbuilt reverse method.
  4. Join all the reversed words using a single space.
  5. Return the resulting string.

Code

Java
Python
JavaScript
C
C++
C#
Kotlin
Swift
Go
Php
public class ReverseWords {
  public static String reverseEachWord(String s) {
    String[] words = s.split(" ", -1); // include trailing spaces
    StringBuilder result = new StringBuilder();

    for (int i = 0; i < words.length; i++) {
      StringBuilder word = new StringBuilder(words[i]);
      result.append(word.reverse());
      if (i != words.length - 1) result.append(" ");
    }
    return result.toString();
  }

  public static void main(String[] args) {
    String input = "Hello World";
    System.out.println("Reversed: " + reverseEachWord(input));
  }
}

Time Complexity

CaseTime ComplexityExplanation
Best CaseO(n)We scan each character in the string once during splitting, reversing, and joining.
Average CaseO(n)Each word is reversed individually, and all characters are processed linearly.
Worst CaseO(n)Even if the string has long words or many spaces, we still traverse each character only once.

Space Complexity

O(n)

Explanation: A new string is built to store the reversed output, proportional to the input size.