There is a topic of p vs NP problems , Class P type ,Class NP type problems, is it of any use? It is given in the CORMEN book on algorithms . Is it of any use in Competitive programming?
Generally the problems that are there in Competitive programming belongs to P class and there are may problems in NP . You need to distinguish between them so that you can know if you can solve a problem in polynomial time or not but since in Competitive programming you don’t need to worry about that you won’t be needing it much. The problems in competitive programming are polynomial time solvable and even if they are not submitting non polynomial time gets accepted.
Just go through the concept once so that you are aware of it but you won’t be needing it here
You asked this on Quora too. If fact you A2Ad me this :3