הפוך מקוון מחרוזת

/1.There is a task to reverse a string using splitting the character dot(.) , Without reversing the word.
2.The string should be given by the user like :
input string : This.is.not.the.proper.way
output reverse string : way.proper.the.not.is.This
3.Please clear ,what is the problem in the code ?/

    #include <stdio.h>    #include <string.h>    char *func(int i, int j, char *str){        char new[50];        int k = 0;        int l;        for (k=0,l=i;k<=j-i+1,l<=j;k++,l++){           new[k]= str[l];        };    return *new;    }    int main()    {        int i,j,x;        char str[50];        printf("Give any string  ");        scanf("  %s",str);        x = strlen(str);        j = x-1;        int k = 0;        for (i=x-1;i>=0;i--){            if (str[i] == '.'){                printf("%s", func(i,j,str));                k = k+1;                j = i-j;            };        };       return 0;    }

How exactly can you take a string, split it, reverse it and join it back together again without the brackets, commas, etc. using python?

Having fun in c++ on CodeWars trying to reverse the letters of the words in a string, words delimited by spaces ie. "Hello my friend" --> "olleH ym dneirf", where extra spaces are not lost.

My answer is failing the tests, but when I diff my answer and the suggested answer there is no output. I also tried checking the length of the original and reversed strings and there is a significant difference in their lengths, depending on the string. However, when I compare the outputs they are again identical in terms of length, and there is no trailing whitespace.

int main() {    std::string s("The quick brown fox jumps over the lazy dog.");    std::cout <<"Old: "<<s<<std::endl;    std::cout <<"New: "<<reverse(s)<<std::endl;    //lengths are not the same    std::cout <<"Length of s: "<<s.length()<<std::endl;    std::cout <<"Length of reverse(s): "<<reverse(s).length()<<std::endl;    //check for trailing whitespace    std::cout <<"Last 5 chars of reverse(s): "<<reverse(s).substr(reverse(s).length() - 6)<<std::endl;}

std::string reverse(std::string str) {    std::string word;    std::string revWord;    std::string result;    char space(' ');    int cursor = 0;    for(int i = 0; i < str.length(); i++){        std::string revWord;        if (str[i] == space || i == str.length() - 1){            if (i == str.length() - 1)                i++;            word = str.substr(cursor, i - cursor);            for(int j = word.length(); j >= 0; j--){                revWord.push_back(word[j]);            }            word = revWord;            if(i != str.length() - 1)                result.append(word + " ");            cursor = i+1;        }    }    return result;}

Console Output:

Old: The quick brown fox jumps over the lazy dog.New: ehT kciuq nworb xof spmuj revo eht yzal .god Length of s: 44Length of reverse(s): 54Last 5 chars of reverse(s): .god

Any ideas?

I need a little help. I found a question like "Write a Java program that will reverse each word of user given string without altering their position and using any built in function."

I solved a code for reversing the whole sentence, but I don't know how to solve this one. Please help me...

import java.io.*;class test25 {     public static void main(String args[]) throws IOException {         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));        System.out.print("Enter string: ");        String s = br.readLine();        String reverse = "";        int length = s.length();        for (int i = length - 1; i >= 0; i--)            reverse = reverse + s.charAt(i);        System.out.println("Result:" + reverse);     } }

I have the the string "re\x{0301}sume\x{0301}" (which prints like this: résumé) and I want to reverse it to "e\x{0301}muse\x{0301}r" (émusér). I can't use Perl's reverse because it treats combining characters like "\x{0301}" as separate characters, so I wind up getting "\x{0301}emus\x{0301}er" ( ́emuśer). How can I reverse the string, but still respect the combining characters?