Here are the summarized coding challenge questions (which, in my perspective, lack meaningfulness): Create a Python script that reads a text file and identifies the four largest lexicographically non-overlapping substrings that meet certain conditions. These conditions include that the substrings must be contained within a single line, consist of strictly alphanumeric characters, and have a length of five characters. For each of these substrings, compute a pair representing its position: the line number in the file and the starting index within that line. Treat these four pairs as points in a Cartesian plane and calculate the area and perimeter of the quadrilateral formed by them. Replace these four locations in an output text file with underscores and design appropriate test cases.
Check out your Company Bowl for anonymous work chats.