Practice Python Problems with LadderPuzzles | Ver. A

It’s okay to not know how to solve the problems and skip them after 5 minutes.

Finish the function has999(nums) below to return True if there are at least three items in the list nums that are adjacent and all equal to 9, otherwise return False.

Step 1: Read the question above. Step 2: In your own words, describe the initial approach to solving it (it does not need to be complete or perfect!). Step 3: Hit 'Get Ladder Puzzle' when ready to see a planning puzzle. Step 4: Interact with the planning puzzle in your preferred ways. Step 5: Write your solution in this code box and click 'Save & Run' — your code will be tested automatically. ==== from unittest.gui import TestCaseGui class myTests(TestCaseGui): def testOne(self): self.assertTrue(has999([1, 9, 9, 9]) == True, "has999([1, 9, 9, 9])") self.assertTrue(has999([1, 9, 9, 1]) == False, "has999([1, 9, 9, 1])") self.assertTrue(has999([9, 9, 9]) == True, "has999([9, 9, 9])") self.assertTrue(has999([9, 9, 1, 9]) == False, "has999([9, 9, 1, 9])") self.assertTrue(has999([9, 9]) == False, "has999([9, 9])") self.assertTrue(has999([9]) == False, "has999([9])") self.assertTrue(has999([]) == False, "has999([])") self.assertTrue(has999([1, 9, 9, 9, 1]) == True, "has999([1, 9, 9, 9, 1])") self.assertTrue(has999([9, 1, 9, 9, 9]) == True, "has999([9, 1, 9, 9, 9])") self.assertTrue(has999([1, 3, 9]) == False, "has999([1, 3, 9])") myTests().main()

Finish the function sum7(nums) to return the sum of all numbers in the list nums that are not 7 and not immediately after a 7.

Return 0 for an empty list or if there is no qualifying number after a 7. There can be multiple 7s in the list.

Step 1: Read the question above. Step 2: In your own words, describe the initial approach to solving it (it does not need to be complete or perfect!). Step 3: Hit 'Get Ladder Puzzle' when ready to see a planning puzzle. Step 4: Interact with the planning puzzle in your preferred ways. Step 5: Write your solution in this code box and click 'Save & Run' — your code will be tested automatically. ==== from unittest.gui import TestCaseGui class myTests(TestCaseGui): def testOne(self): self.assertTrue(sum7([1, 2, 3]) == 6, "sum7([1, 2, 3])") self.assertTrue(sum7([7, 1, 2, 3]) == 5, "sum7([7, 1, 2, 3])") self.assertTrue(sum7([1, 7, 2, 3]) == 4, "sum7([1, 7, 2, 3])") self.assertTrue(sum7([7, 7, 1, 2]) == 2, "sum7([7, 7, 1, 2])") self.assertTrue(sum7([]) == 0, "sum7([])") self.assertTrue(sum7([7]) == 0, "sum7([7])") self.assertTrue(sum7([7, 1]) == 0, "sum7([7, 1])") self.assertTrue(sum7([1, 7]) == 1, "sum7([1, 7])") myTests().main()

Please do not scan the page to see the completed previous problems. Try to solve the problem on your own first.

It’s okay to not know how to solve and skip it after 5 minutes.

Finish a function sum_skip2(nums) that takes a list of integers and returns their sum, but whenever two adjacent 2s are found, skip both of them and the number immediately after the pair. Return the sum of the numbers that are not skipped.

def sum_skip2(nums): ==== from unittest.gui import TestCaseGui class myTests(TestCaseGui): def testOne(self): self.assertTrue(sum_skip2([1, 2, 2, 3]) == 1, "sum_skip2([1, 2, 2, 3])") self.assertTrue(sum_skip2([1, 2, 2, 3, 4]) == 5, "sum_skip2([1, 2, 2, 3, 4])") self.assertTrue(sum_skip2([1, 1, 2, 2, 1]) == 2, "sum_skip2([1, 1, 2, 2, 1])") self.assertTrue(sum_skip2([2, 2]) == 0, "sum_skip2([2, 2])") self.assertTrue(sum_skip2([1, 3]) == 4, "sum_skip2([1, 3])") self.assertTrue(sum_skip2([]) == 0, "sum_skip2([])") self.assertTrue(sum_skip2([1]) == 1, "sum_skip2([1])") self.assertTrue(sum_skip2([1, 2]) == 3, "sum_skip2([1, 2])") myTests().main()

Finish the function is_ascending(nums) that returns True if the list contains at least three consecutive numbers that are in ascending order (where equal adjacent values do not count as ascending), and False otherwise.

If the list has less than 3 numbers in it, return False.

Before you write code, what steps will you take to approach this problem? You can write your plan in the space below.

# Write your code here. ==== from unittest.gui import TestCaseGui class myTests(TestCaseGui): def testOne(self): self.assertTrue(is_ascending([1, 2, 3]) == True, "is_ascending([1, 2, 3])") self.assertTrue(is_ascending([1, 2, 1, 2, 3]) == True, "is_ascending([1, 2, 1, 2, 3])") self.assertTrue(is_ascending([3, 2, 1]) == False, "is_ascending([3, 2, 1])") self.assertTrue(is_ascending([1, 2]) == False, "is_ascending([1, 2])") self.assertTrue(is_ascending([]) == False, "is_ascending([])") self.assertTrue(is_ascending([1]) == False, "is_ascending([1])") self.assertTrue(is_ascending([1, 1, 1]) == False, "is_ascending([1, 1, 1])") self.assertTrue(is_ascending([1, 1, 2]) == False, "is_ascending([1, 1, 2])") self.assertTrue(is_ascending([3, 2, 2, 3, 4]) == True, "is_ascending([3, 2, 2, 3, 4])") self.assertTrue(is_ascending([3, 2, 1, 2, 1]) == False, "is_ascending([3, 2, 1, 2, 1])") self.assertTrue(is_ascending([1, 3, 2, 1, 5]) == False, "is_ascending([1, 3, 2, 1, 5])") self.assertTrue(is_ascending([5, 1, 2, 3, 1]) == True, "is_ascending([5, 1, 2, 3, 1])") myTests().main()

Write a total45(nums) function that takes a list of integers and returns the sum of all items in the list, excluding any numbers that fall within a 4-to-5 sequence (inclusive).

A 4-to-5 sequence starts at a 4 and ends at the next 5, and all numbers between them (including the 4 and 5 themselves) are excluded from the sum. If present, there will always be exactly one 4 and one 5, and the 4 will always appear before the 5.

Before you write code, what steps will you take to approach this problem? You can write your plan in the space below.

# Write your code here. ==== from unittest.gui import TestCaseGui class myTests(TestCaseGui): def testOne(self): self.assertTrue(total45([1, 2, 4, 5, 6]) == 9, "total45([1, 2, 4, 5, 6])") self.assertTrue(total45([1, 2, 4, 3, 5, 6]) == 9, "total45([1, 2, 4, 3, 5, 6])") self.assertTrue(total45([4, 5, 1, 2, 3]) == 6, "total45([4, 5, 1, 2, 3])") self.assertTrue(total45([4, 5]) == 0, "total45([4, 5])") self.assertTrue(total45([4, 1, 2, 3, 5]) == 0, "total45([4, 1, 2, 3, 5])") self.assertTrue(total45([]) == 0, "total45([])") self.assertTrue(total45([1, 2, 3]) == 6, "total45([1, 2, 3])") myTests().main()

You have attempted of activities on this page