MakeMyTrip | OA | 3Aug 2025 | Symmetric Round-Trip Itinerary | Coding Assessment | Complete Solutions & Tips | Aug 3rd Campus Assessment

Question: Symmetric Round-Trip Itinerary Problem Statement: An airline planner has an itinerary string representing a sequence of airport codes joined by hyphens, e.g., "SFO-LAX-SEA-LAX-SFO-BOS" A subsequence of this itinerary is obtained by deleting zero or more airport codes without changing the order of the remaining codes. Find the length of the longest subsequence of airport codes that reads the same forwards and backwards (i.e., a palindromic subsequence), so the planner can identify the largest symmetric round-trip segment. Example: itinerary = ...