feat: add LeetCode problem 434

[PalAditya]

Adds solution of problem 434 for leetcode. Beats 100% Time, 97.18% space

Description of Change

References

Checklist

• Added description of change
• Added file name matches File name guidelines
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• I acknowledge that all my contributions will be made under the project's license.

[PalAditya]

Proof of it being optimal 😄

[Panquesito7]

Thanks! 🚀

[alexpantyukhin]

What if to simplify the solution with only one loop? Something like that:

int countSegments(char * s){
    int sLen = strlen(s);
    int prevSpace = 1;
    int result = 0;
    char currChar;

    for (int i = 0; i < sLen; i++){
        currChar = s[i];
        if (s[i] != ' ' && prevSpace){
            result++;
        }

        prevSpace = (currChar == ' ');
    }

    return result;
}

It beats 100% also :)

[PalAditya]

@alexpantyukhin - Your version is simply superior, so I can't think of a good reason to not use it directly 😄
I have added one explanatory comment which maybe unnecessary, but hopefully still explains the correctness of the logic as I see it.
P.S: Not sure if this PR is still valid, since I have pretty much copy-pasted your version apart from the comment. Please let me know

[Panquesito7]

Not sure if this PR is still valid, since I have pretty much copy-pasted your version apart from the comment. Please let me know

Both your contribution and @alexpantyukhin's contribution will be mentioned and kept, so I don't think there's much to worry about :) Thanks.