Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
from typing import List, Union, Collection, Mapping, Optional
from abc import ABC, abstractmethod

class Solution:
def lengthOfLastWord(self, s: str) -> int:

lst_s = s.split()

return len(lst_s[-1])
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
from typing import List, Union, Collection, Mapping, Optional
from abc import ABC, abstractmethod

class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:

if not strs:
return ''

min_strs, max_strs = min(strs), max(strs)
count = 0

for i in range(len(min_strs)):

if min_strs[i] == max_strs[i]:
count += 1
else:
break

return min_strs[:count]
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
import unittest
from src.my_project.interviews.top_150_questions_round_22\
.ex_19_length_last_word import Solution

class LengthLastWordTestCase(unittest.TestCase):

def test_length_last_word(self):
solution = Solution()
output = solution.lengthOfLastWord(s="Hello World")
target = 5
self.assertEqual(output, target)
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
import unittest
from src.my_project.interviews.top_150_questions_round_22\
.ex_20_longest_common_prefix import Solution

class LongestCommonPrefixTestCase(unittest.TestCase):

def test_longest_common_prefix(self):
solution = Solution()
output = solution.longestCommonPrefix(strs=["flower","flow","flight"])
target = 'fl'
self.assertEqual(target, output)

def test_longest_no_common_prefix(self):
solution = Solution()
output = solution.longestCommonPrefix(strs=["dog","racecar","car"])
target = ''
self.assertEqual(target, output)

def test_longest_common_prefix_null_list(self):
solution = Solution()
output = solution.longestCommonPrefix(strs=[])
target = ''
self.assertEqual(target, output)