Constructing maximal pipedreams of double Grothendieck polynomials

Pechenik, Speyer and Weigandt defined a statistic $\mathsf{rajcode}(\cdot)$ on permutations which characterizes the leading monomial in top degree components of double Grothendieck polynomials. Their proof is combinatorial: They showed there exists a unique pipedream of a permutation $w$ with row weight $\mathsf{rajcode}(w)$ and column weight $\mathsf{rajcode}(w^{-1})$. They proposed the problem of finding a ``direct recipe'' for this pipedream. We solve this problem by providing an algorithm that constructs this pipedream via ladder moves.