Music Festival Lineup Challenge

Problem Statement

Music Festival Lineup Challenge Problem Description A popular music festival is about to create its ultimate lineup. The festival organizers have received a series of back-to-back performer pairs. Each performer is represented by their unique stage name in lowercase letters. To ensure maximum attendance and optimize ticket sales, the festival needs a sophisticated software solution that can determine the optimal sequence in which all performers can perform at least once. If multiple sequences are possible, the solution should provide the smallest lexicographical order. The festival grid is structured as a P (number of rows) x Q (number of columns) matrix, where each row specifies a pair of performers who will take the stage consecutively. The primary objective is to generate a sequence that starts with a specified performer, "starter," as studies have shown this sequence attracts the largest audience. The function signature provided for implementation is: vector<string> findPerfo