Solve this algorithm problem using Pythkn

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Solve this algorithm problem using Pythkn

You are given an array segments consisting of N
integers denoting the lengths of several segments. Your
task is to find among them four segments from which a
rectangle can be constructed. What is the minimum.
absolute difference between the side lengths of the
constructed rectangle?
Write a function:
int solution (intl segments); that, given an array
segments, returns the minimum absolute difference
between the side lengths of the constructed rectangle
or -1 if no rectangle can be constructed.
Examples:
1. For segments = [2, 2, 2, 2, 21, we can construct only a
2 x2 rectangle out of the given segments. The function
should return O.
2. For segments = [911, 1, 3, 1000, 1000, 2, 2, 999,
1000, 911, we can construct three rectangles: 2 x 911, 2
x 1000, and 911 x 1000. Out of those three possibilities,
the best one is 911 x 1000. The function should return
89.
3. For segments = [4, 1, 1, 1, 3], we cannot construct any
rectangle out of the given segments. The function
should return -1.
Transcribed Image Text:You are given an array segments consisting of N integers denoting the lengths of several segments. Your task is to find among them four segments from which a rectangle can be constructed. What is the minimum. absolute difference between the side lengths of the constructed rectangle? Write a function: int solution (intl segments); that, given an array segments, returns the minimum absolute difference between the side lengths of the constructed rectangle or -1 if no rectangle can be constructed. Examples: 1. For segments = [2, 2, 2, 2, 21, we can construct only a 2 x2 rectangle out of the given segments. The function should return O. 2. For segments = [911, 1, 3, 1000, 1000, 2, 2, 999, 1000, 911, we can construct three rectangles: 2 x 911, 2 x 1000, and 911 x 1000. Out of those three possibilities, the best one is 911 x 1000. The function should return 89. 3. For segments = [4, 1, 1, 1, 3], we cannot construct any rectangle out of the given segments. The function should return -1.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY