Length of Last Word - Leetcode 58 - Python

[@NeetCode]

✅ EASY PLAYLIST: kzbin.info/www/bejne/gX3PiXZ8fJqHpKM

[@chiraagpala3243]

will you be making a hard playlist as well?

[@aNoobLikeSaibot]

I answered this question by myself with no help and it was pretty awesome. I finally did a problem without help. I used a for loop and started from the end of the string to the beginning. The conditions were, if my counter variable is zero and next character is a space, continue, else if, increment counter variable by one and else is break. Hope that makes some senses but it worked!

[@marztianpapi3419]

my code was new = s.strip(“ “).split(“ “) return len(new[-1])

[@amra-dev]

If you are interested in Solving Python Builtin Functions, this might help. stip() will remove all covering spaces from string split(" ") will split string into array separated by " " len(res[-1]) will return length of last word res = s.strip().split(" ") return len(res[-1])

[@gayan1742]

But then it would be 10x slower.

[@venkatasundararaman]

@@gayan1742 Actually it is faster than the solution in the video. Runtime: 28 ms, faster than 91.49% of Python3 online submissions for Length of Last Word. I feel it is ok to use the built in function as we are going to only use them in real world scenario.

[@gayan1742]

@@venkatasundararaman ​ Maybe it's because the solution in the video uses two iterations, which is not really necessary. Iterating from the last character to the left until a space is found, then returning the length does also work. The last time I tried, it took only 0 ms. Not sure if it is because I used Java or not.

[@lambdadelta_witch]

Splitting needs to be done only once, so s.rsplit(maxsplit=1)

[@mufaddalmotiwala8672]

better still, you can just do return(len(s.split()[-1]))

[@swimmingshi]

strip() and split() string will also do. but watching your video I find sometimes algorithmic solutions might not be intuitive at first but your solution is really clever. I will keep watching your videos

[@leeroymlg4692]

don't need to .strip(). split() removes all the whitespace

[@user-nq7nt1rq9b]

Hey man one personal question for you from where did you have learned the basic of Data structure and algorithm and your video are pretty much helpful to me Thanks a Ton

[@shivarajbandaru2216]

class Solution: def lengthOfLastWord(self, s: str) -> int: x="1" y=[] for i in reversed (s): if i>x: y.append(i) if len(y)>0: if i

[@everyontech2716]

easy class Solution: def lengthOfLastWord(self, s: str) -> int: temp = "" # using strip method we are actually remove whitespace from lefft and right side string = s.strip() for i in string: if i.isspace(): temp = "" else: temp = temp + i return len(temp)

[@rajarajan1338]

A very simple method class Solution: def lengthOfLastWord(self, s: str) -> int: count = 0 for i in s[::-1]: if i == " ": if count >= 1: return count else: count += 1 return count

[@GfoxSim]

I solved this in one line using Python3 built-in functions and it's fast and efficient. return len(s.strip().split()[-1])

[@QuantumVortex17]

I have submitted this: class Solution(object): def lengthOfLastWord(self, s): array = s.split(' ') x = array[len(array)-1] count = 0 while x == '': count += 1 x = array[len(array) - count] if x != '': counter = 0 for i in x: counter += 1 return counter

[@mutaherkhan2161]

This code is not working on leedcode compiler. I getting time out errror

[@KrutiDugade]

This is because he forgot to decrement "i" by 1 in next while loop. This works: def lengthOfLastWord(self, s: str) -> int: i, length = len(s) - 1, 0 while s[i] == " ": i -= 1 while i >= 0 and s[i] != " ": length += 1 i -= 1 return length Or you can use other solution in the comments using strip function.

[@dasshrs]

My solution: At first we go trough every spaces from the end of the array. Once we reach not space element, this is a word start. After we add elements when non-space character is present. If we have more then one word_symbols saved it's the word that has already started and if we reach other space chracter it's actually an end. class Solution: def lengthOfLastWord(self, s: str) -> int: word_symbols = 0 for i in range(len(s) - 1, -1, -1): if s[i] == ' ' and word_symbols != 0: break if s[i] == ' ': word_symbols = 0 else: word_symbols += 1 return word_symbols

[@unknownboy8174]

class Solution: def lengthOfLastWord(self, s: str) -> int: words=s.split() if words: return len(words[-1]) else: return 0

[@lamedev1342]

My solution: I used extra memory but tried to reduce the time by implementing a hashmap. def lengthOfLastWord(self, s: str) -> int: length = 0 values = {} s += " " for i in s: if i != " ": length += 1 else: if length > 0: values[i] = length length = 0 return values.get(' ')

For C#, it's quite similar; var count = 0; var end = s.Length - 1; while(s[end] == ' ') { end--; } for(var i = end; i >= 0 && s[i] != ' '; i--) { count++; } return count;

[@scottwarner9856]

Instead of iterating through the entire string char by char in C# (which could take much longer the lengthier the end of the string is), you can just use built in string methods .Trim() and .Split() to solve this more quickly in just 3 lines of code: string trimmed = s.Trim(' '); //removes given whitespace chars from ends of s string[] words = trimmed.Split(' '); //splits words in trimmed into separate strings return words[words.Length - 1].Length; //returns length of last word in arr words

[@suhelmakkad]

class Solution: def lengthOfLastWord(self, s: str) -> int: length, prevLength = 0, 0 for char in s: if char == " ": if length != 0: prevLength = length length = 0 else: length += 1 return length if length != 0 else prevLength

[@Famelhaut]

1 liner solution: class Solution: def lengthOfLastWord(self, s: str) -> int: return len(s.split()[-1])

[@lollollollol1622]

im a newb but this is my solution class Solution: def lengthOfLastWord(self, s: str) -> int: s = ' '.join(s.split()) last = s[::-1] count = 0 last = last + " " for c in last: if c == " ": return(count) break count +=1

[@muneerak1833]

class Solution(object): def lengthOfLastWord(self, s): strr=s.strip() str=strr.split(" ") l=str[-1] return len(l)

[@abdulhalimabdullahi9907]

s = " fly me to the moon " l = s.split() last_word = l[-1] print(len(last_word))

[@razapanjwani-z2s]

why not just strip() and convert the string into array and get the last word from the array and then just return its length?

[@venkatrushivanga1025]

class Solution: def lengthOfLastWord(self, s: str) -> int: endIdx=len(s)-1 strIdx=0 while endIdx>=0: if s[endIdx]==" " and strIdx!=0: return strIdx-endIdx if s[endIdx]!=" " and strIdx==0: strIdx=endIdx endIdx-=1 return strIdx-endIdx

[@kiraqueenyt5161]

wow i got the exact same solution

[@sophearyrin]

In Java code solution: class Solution { public int lengthOfLastWord(String s) { int count =0; s = s.trim(); int n = s.length(); for(int i=n-1; i>=0; i--){ if(s.charAt(i) != ' '){ count++; }else{ break; } } return count; } }

[@vatsalsharma5791]

Hey can you please make a video on “matrix block sum”

[@paragsarkar8258]

def lengthOfLastWord(s): i , length = len(s) - 1, -1 while i >= 0: if s[i] == ' ' and length != -1: return length - i if s[i] != ' ' and length == -1: length = i i -= 1 return length + 1 if length != -1 else 0 I did it like this

[@user-vm8yk9ic2c]

i love you sooo much dude

[@stutipatel1059]

I used the same method, but seems to be exceeding time limit

[@lasredchris]

Question for you Neetcode - do you think doing these problems improve your ability as a software engineer at all?

[@sancho608]

No. They are just silly questions. Just like common entrance exams for high school. They don't really help you out in high school

[@sabu4539]

i used trim() and split(" "). think that's ok

[@harrisamin]

Hey Neet, I think I brute forced this with 1 for loop, but leetcode doesn't like my solution. Could you or anyone else help me evaluate my solution? and its efficiency in big o notation? class Solution: def lengthOfLastWord(self, s: str) -> int: maxStr = '' for i in range(len(s)): if s[i] != ' ': maxStr += s[i] continue if s[i:] == ' '*len(s[i:]): return len(maxStr) maxStr = '' return len(maxStr) Thanks in advance! -Harris

[@vinaydeshpande]

How's about? class Solution: def lengthOfLastWord(self, s: str) -> int: return (len((s.split())[len(s.split())-1]))

[@gamesandsoftwares1441]

my answer : arr=s.split() return(len(arr[-1])) beats 100%

[@sabarishnarayanan4818]

return len(s.split()[-1])

[@techno-tronics4946]

Sir how do I start with DP?

[@9eyeKnight]

just tried to do with beginner knowledge but it only beats 5% lol var lengthOfLastWord = function(s){ s = s.toLowerCase() let a = '' let c = '' let alpha = 'qwertyuioplkjhgfdsazxcvbnm' for(i=s.length-1;i>-1;i--){ a = a + s[i] } for(let i=0;i-1){ break } } for(let i=0; i-1){ c = c+ a[i] }else if (a[i]==' '){ return c.length } } return c.length }

[@ridhwana2331]

return len(s.strip().split(" ")[-1]) this would work too

[@user-nm2wc1tt9u]

class Solution: def lengthOfLastWord(self, s: str) -> int: new = s.split() req = new[-1] return len(req) Done with built in functions