212223242526272829303132333435363738394041424344454647484950515253545556575859

class Solution:
    # Function to reverse every word in the given string
    def reverseWords(self, s: str) -> str:
        n = len(s)  # Length of string
        
        # List to store the words present in string
        words = []
        
        # Pointers to mark the start and end of a word
        start = end = 0
        
        i = 0
        while i < n:
            
            # Finding the first character of a word (if any)
            while i < n and s[i] == ' ':
                i += 1
            
            # If no word is found, break 
            if i >= n:
                break
            
            start = i  # Storing the index of first character of word
            
            # Finding the last character of the word
            while i < n and s[i] != ' ':
                i += 1
            
            end = i - 1  # Storing the index of last character of word
            
            # Add the found word to the list of words
            wordFound = s[start:end + 1]
            words.append(wordFound)
        
        ans = ""
        
        # Adding all the words to result in the reverse order 
        for i in range(len(words) - 1, -1, -1):
            ans += words[i]
            
            # Adding spaces in between words
            if i != 0:
                ans += ' '
        
        return ans  # Return the stored result


if __name__ == "__main__":
    s = " amazing coding skills "
    
    # Creating an instance of Solution class
    sol = Solution()
    
    # Function call to reverse every word in the given string
    ans = sol.reverseWords(s)
    
    # Output
    print("Input string:", s)
    print("After reversing every word:", ans)

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758

class Solution {
    // Function to reverse every word in the given string
    reverseWords(s) {
        let n = s.length; // Length of string
        
        // List to store the words present in string
        let words = [];
        
        // Pointers to mark the start and end of a word
        let start, end;
        
        let i = 0;
        while (i < n) {
            
            // Finding the first character of a word (if any)
            while (i < n && s[i] === ' ') i++;
            
            // If no word is found, break 
            if (i >= n) break;
            
            start = i; // Storing the index of first ch