Commit 66ac34b

committed

Update

1 parent 5cbbf90 commit 66ac34bCopy full SHA for 66ac34b

File tree

+61

-0

lines changed

+61

-0

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+# Task 12`
	`2`	`+# Implement a function to find the largest palindrome in a given string.`
	`3`	`+`
	`4`	`+def find_largest_palindrome(message):`
	`5`	`+ if not message:`
	`6`	`+ raise Exception("String cannot be empty")`
	`7`	`+ if not message.isascii():`
	`8`	`+ raise Exception("String cannot be digits or other special characters")`
	`9`	`+ tmp = message.split(" ")`
	`10`	`+ return max(tmp, key=len)`
	`11`	`+`
	`12`	`+`
	`13`	`+def test_find_largest_palindrome():`
	`14`	`+ input_string = "How are you?"`
	`15`	`+ expected_value = "How"`
	`16`	`+ assert find_largest_palindrome(input_string) == expected_value`

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+# Task 13`
	`2`	`+# Write a program to check if two strings are anagrams.`
	`3`	`+`
	`4`	`+def is_anagram(first_string: str, second_string: str) -> bool:`
	`5`	`+ if len(first_string) != len(second_string):`
	`6`	`+ return False`
	`7`	`+ else:`
	`8`	`+ first_string = first_string.lower()`
	`9`	`+ second_string = second_string.lower()`
	`10`	`+ for letter in first_string:`
	`11`	`+ if letter not in second_string:`
	`12`	`+ return False`
	`13`	`+ return True`
	`14`	`+`
	`15`	`+`
	`16`	`+def test_is_anagram():`
	`17`	`+ first_string = "silent"`
	`18`	`+ second_string = "listen"`
	`19`	`+ assert is_anagram(first_string, second_string) == True`
	`20`	`+`
	`21`	`+`
	`22`	`+def test_is_not_anagram():`
	`23`	`+ first_string = "silent"`
	`24`	`+ second_string = "listens"`
	`25`	`+ assert is_anagram(first_string, second_string) == False`

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,20 @@`
	`1`	`+# Task 14`
	`2`	`+# Write a program to find the second largest number in a list.`
	`3`	`+import pytest`
	`4`	`+`
	`5`	`+`
	`6`	`+def find_second_largest(numbers):`
	`7`	`+ max = numbers[0]`
	`8`	`+ second_max = numbers[0]`
	`9`	`+ for number in numbers:`
	`10`	`+ if number > max:`
	`11`	`+ max = number`
	`12`	`+ for number in numbers:`
	`13`	`+ if second_max < number < max:`
	`14`	`+ second_max = number`
	`15`	`+ return second_max`
	`16`	`+`
	`17`	`+`
	`18`	`+def test_find_second_largest():`
	`19`	`+ numbers = [1, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5]`
	`20`	`+ assert find_second_largest(numbers) == 4`

Comments

(0)