def large_position(matrix: list[list[int]], row: int, col: int) -> int: """ Returns the area of the largest rectangle whose top left corner is at position , in . You MUST make use of the helper here as you loop through each row of the matrix. Do not modify (i.e., mutate) the input matrix. >>> case100 = [[1, 0, 1, 0, 0], ... [1, 0, 1, 1, 1], ... [1, 1, 1, 1, 1], ... [1, 0, 0, 1, 0]] >>> large_position(case1, 0, 0) 4 """ Helper: def longest_chain(lst: List[int]) -> int: count = 0 # defining count variable as 0. Using it for counting the length of the sequence. i = 0 # defining i variable as 0. Using it for index position while (i < len(lst) and lst[ i] != 0): # iterating through out the list while i is lesser than the length of the list and until we encounter any 0 i += 1 # increasing the index value count += 1 # increasing the count return count # returning the count value """ you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import""'
def large_position(matrix: list[list[int]], row: int, col: int) -> int:
"""
Returns the area of the largest rectangle whose top left corner is at
position <row>, <col> in <matrix>.
You MUST make use of the helper <longest_chain> here as you loop through
each row of the matrix. Do not modify (i.e., mutate) the input matrix.
>>> case100 = [[1, 0, 1, 0, 0],
... [1, 0, 1, 1, 1],
... [1, 1, 1, 1, 1],
... [1, 0, 0, 1, 0]]
>>> large_position(case1, 0, 0)
4
"""
Helper:
def longest_chain(lst: List[int]) -> int:
count = 0 # defining count variable as 0. Using it for counting the length of the sequence.
i = 0 # defining i variable as 0. Using it for index position
while (i < len(lst) and lst[
i] != 0): # iterating through out the list while i is lesser than the length of the list and until we encounter any 0
i += 1 # increasing the index value
count += 1 # increasing the count
return count # returning the count value
""" you should not use any of the following:
- dictionaries or dictionary methods
- try-except
- break and continue statements
- recursion
- map / filter
- import""'
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
