Length of Last Word


Problem Statement :


Given a string s consisting of words and spaces, return the length of the last word in the string.

A word is a maximal 
substring
 consisting of non-space characters only.

 

Example 1:

Input: s = "Hello World"
Output: 5
Explanation: The last word is "World" with length 5.
Example 2:

Input: s = "   fly me   to   the moon  "
Output: 4
Explanation: The last word is "moon" with length 4.
Example 3:

Input: s = "luffy is still joyboy"
Output: 6
Explanation: The last word is "joyboy" with length 6.
 

Constraints:

1 <= s.length <= 104
s consists of only English letters and spaces ' '.
There will be at least one word in s.


Solution :



title-img 


                            Solution in C :

int lengthOfLastWord(char * s){
    int count=0, i;
    int x=strlen(s)-1;
    for(i=strlen(s)-1;i>=0;i--){
        if(s[i]!=' ')
        break;
        x=x-1;
    }
 for(i=x;i>=0;i--){
     if(s[i]==' ')
     break;
     count++;
 }
 return count;
}
                        


                        Solution in C++ :

class Solution {
public:
    int lengthOfLastWord(std::string s) {
        // Trim the input string to remove leading and trailing whitespaces
        size_t first_not_space = s.find_first_not_of(' ');
        size_t last_not_space = s.find_last_not_of(' ');
        s = s.substr(first_not_space, last_not_space - first_not_space + 1);

        // Extract the substring starting from the last occurrence of space + 1 to the end
        size_t last_space = s.find_last_of(' ');
        std::string last_word = s.substr(last_space + 1);

        // Return the length of the last word
        return last_word.length();
    }
};
                    


                        Solution in Java :

class Solution {
    // Function to calculate the length of the last word in a given string
    public int lengthOfLastWord(String s) {
        // Trim the input string to remove leading and trailing whitespaces
        s = s.trim();
        
        // Extract the substring starting from the last occurrence of space + 1 to the end
        String lastWord = s.substring(s.lastIndexOf(' ') + 1);
        
        // Return the length of the last word
        return lastWord.length();
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def length_of_last_word(self, s: str) -> int:
        # Trim the input string to remove leading and trailing whitespaces
        s = s.strip()
        
        # Extract the substring starting from the last occurrence of space + 1 to the end
        last_word = s[s.rfind(' ') + 1:]
        
        # Return the length of the last word
        return len(last_word)


View More Similar Problems

Cycle Detection

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer

View Solution →

Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

View Solution →

Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function

View Solution →

Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

View Solution →

Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →

Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →