Lexicographically Maximum Final Sequence

Problem Statement

Lexicographically Maximum Final Sequence Problem Description Amazon's fulfillment system processes a binary string called shipmentData to produce another binary string known as finalSequence via a transformation process. The transformation process works as follows: 1. Start with an empty finalSequence, i.e., finalSequence = "". 2. For each index i (0 finalSequence = "1101" - Index i=0: "" + "0" -> "0" reverse -> "0" - Index i=1: "0" + "1" -> "01" reverse -> "10" - Index i=2: "10" + "1" -> "101" reverse -> "101" - Index i=3: "101" + "1" -> "1011" reverse -> "1101" 2. For shipmentData = "1011" -> finalSequence = "1011" - Index i=0: "" + "1" -> "1" reverse -> "1" - Index i=1: "1" + "0" -> "10" reverse -> "01" - Index i=2: "01" + "1" -> "011" reverse -> "110" - Index i=3: "110" + "1" -> "1101" reverse -> "1011" 3. For shipmentData = "1101" -> finalSequence = "1110" - Index i=0: "" + "1" -> "1" reverse -> "1" - Index i=1: "1" + "1" -> "11" reverse -> "11" - Index i=2: "11" + "0" -> "110" re