Begin by reversing the entire input string.
Iterate over the reversed string to handle each word.
Detect words as continuous sequences of characters separated by spaces.
Reverse each identified word to restore its correct character order.
Move the reversed word to the front while skipping extra spaces.
Trim any trailing spaces before returning the final string.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
private:
    void reverseString(string &s, int start, int end) {
        while (start < end) {
            swap(s[start++], s[end--]);
        }
    }

public:
    string reverseWords(string s) {
        int n = s.length();

        // Reverse the entire string
        reverseString(s, 0, n - 1);

        int i = 0, j = 0, start = 0, end = 0;

        while (j < n) {
            // Skip spaces
            while (j < n && s[j] == ' ') j++;
            if (j == n) break;

            start = i;

            // Copy the word characters forward
            while (j < n && s[j] != ' ') {
                s[i++] = s[j++];
            }

            end = i - 1;

            // Reverse the current word using start and end
            reverseString(s, start, end);

            // Add a space after the word if it's not the last word
            if (j < n) {
                s[i++] = ' ';
            }
        }

        // Remove trailing space if present
        if (i > 0 && s[i - 1] == ' ') i--;

        return s.substr(0, i);
    }
};


int main(){
    string s =  " amazing coding skills ";
    
    // Creating an in