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.     >>> case = [[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     """ You must refer to this while writing for the code above Helper:  def longest_chain(lst: List[int]) -> int: count = 0  i = 0 while (i < len(lst) and lst[i] != 0):  i += 1  count += 1  return count  """ Please do this on python  you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import ""'

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

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.

    >>> case = [[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
    """

You must refer to this while writing for the code above Helper: 

def longest_chain(lst: List[int]) -> int:

count = 0 
i = 0
while (i < len(lst) and lst[i] != 0): 
i += 1 
count += 1 
return count 

""" Please do this on python 

you should not use any of the following:

  • dictionaries or dictionary methods
  • try-except
  • break and continue statements
  • recursion
  • map / filter
  • import ""'
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Array
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education