Crossed Wires

X = the Manhattan distance from the central port to the closest intersection

X = the fewest combined steps the wires must take to reach an intersection

R8,U5,L5,D3U7,R6,D4,L4

Split the input at the only newline character to create an array with two strings  Split each string at each comma character to create nested arrays with stringsCreate a legend mapping each of the four directions with an amount between -1 and 1 to adjust a current x,y coordinateFor each of the wires  Initialize a coordinate at 0,0  Initialize an array that will store stringified representations of the coordinates  For each instruction in the wire's list of instructions    Extract the first character as the direction    For i from 1 to the integer associated with the direction      Add to the array of coordinates a stringified representation of the current coordinate moved one step in the current direction    Update the current coordinate so it matches the one represented by the last value in the array of coordinates  Return the generated list of visited coordinatesFilter the first list of visited coordinates  Only keep values that also appear in the second list of visited coordinatesGenerate a list of numbers using the filtered list  Each number will equal the sum of the absolute value of each visited coordinate's x,y positionsSort the list in ascending orderReturn the first number (the smallest number)

Split the input at the only newline character to create an array with two strings  Split each string at each comma character to create nested arrays with stringsCreate a legend mapping each of the four directions with an amount between -1 and 1 to adjust a current x,y coordinateFor each of the wires  Initialize a coordinate at 0,0  Initialize an object, locations, that will map stringified representations of the coordinates to the length of the path by the time that coordinate is reached  Initialize length at 0  For each instruction in the wire's list of instructions    Extract the first character as the direction    For i from 1 to the integer associated with the direction      Increment length by 1      Add to locations a key whose label is a stringified representation of the current coordinate moved one step in the current direction, and whose value is set to length    Update the current coordinate so it matches the most recently added key in locations  Return locationsCreate a list containing all the keys from the locations object generated from the first wire's visited coordinates  Filter the list, keeping only values that are also keys in the locations object generated from the second wire's visited coordinatesGenerate a list of numbers using the filtered list  Each number will equal the sum of the length of each path at the shared coordinate value of both wiresSort the list in ascending orderReturn the first number (the smallest number)