Question

The language is python

Write the function

largest_edge_group(vertices)

that consumes vertices, a list of list of integer containing the coordinates of the consecutive vertices of a polygon. The function largest_edge_group returns the size of the largest group of same length edges.

Your function must run in O(n), where n is the length of vertices.

Example

largest_edge_group([[0,0],[1,1],[0,2],[-2,3],[-1,2]]) => 3

Hint
Remember, it is not possible to compare Floats for strict equality, but since the coordinates are integers, the squared distance is too.

Restrictions

Do not import any modules other than math and check. You are always allowed to define your own helper/wrapper functions, as long as they meet the assignment restrictions. Do not use Python constructs from later modules (e.g. commands continue or break, zip, anything with set or enumerator, etc.).

Answer 1

Solution:

Function:

def largest_edge_group(vertices):
    #list to store edge length
    distance=[]
    #list to store count of the edges of same length upto the point of time
    len_count=[]
    for i in range(len(vertices)-1):
        # **2 is to find square, and square root is not taken for strict equality
        dist=((vertices[i][0]-vertices[i+1][0])**2)+((vertices[i][1]-vertices[i+1][1])**2)
        distance.append(dist)
        len_count.append(distance.count(dist))
    return max(len_count)

Output while running the program in python shell: