Is it possible to form a PDA for this language?
Yes, the language is context-free.  I recommend that you ignore that article on geeks for geeks; its so-called &quot;analysis&quot; is stated in a way that is highly ambiguous, and appears to be faulty in some cases.
Hint: The language has the form $L = \{a^j a^k b^k b^{2j}\}$.  Build a PDA that non-deterministically guesses $j$.  (I assume you know how to build a PDA for $\{a^n b^n\}$ and $\{a^n b^{2n}\}$.)