When I was in a lecture, my students tried to troll me and asked the question that was banned from codeforces because of being NP hard. I did not know anything about that problem and I have tried to solve it. I struggled a lot but finally, I solved the problem in O($$$N*N$$$) complexity. I will not share my full solution because I do not want to give opportunities to people who will use this solution for bad ideas. I know you will not believe me but I will share some pictures while I was solving the problem. (It is up to you to believe...) (Also I do not believe that the world is a fair place, so I know I will not gain anything if I share my solution because I am a Turkish person and it is sad, but many of the population of the world do not love Turkish people.)
UPD: This is the zoomed version of original photo.
Auto comment: topic has been updated by Formatci (previous revision, new revision, compare).
Also, I have felt racism in Tureng reward because I published the best theorem about NP problems in 2017 but they do not give me a Tureng reward because I am Turkish people. So I think there was fairness in Tureng 2017 awards.
Oh, the auto keyboard changed Turing to Tureng. I am sorry.
Instead of this shit , please go help the suffering people in southern provinces affected by earthquake.
At least give the problem if you want anyone to believe you.
It is written in the blog. The question in codeforces which was erased from codeforces because of being NP. You cannot find it in codeforces now because of this reason but you can find it in Um_nik's video.
Action speaks louder than words. Nobody believes you by doing so.