I believe that I discovered a method to generate several NP-complete problems. The NP-completeness proof is not immediately apparent to *me*. I did not find any reference in complexity literature to my problems and their $NP$-completeness. Such problems include the following posts:

How hard is reconstructing a permutation from its differences sequence?

Recognizing sequences sortable by transpositions?

Is it fine to post question asking for proofs of $NP$-completeness of several problems?