P versus NP [1-2] Problems are one of the most important open questions in mathematics and theoretical computer science. Jeevan – Kushalaiah Method is a method to find the possible number of combinations between n-elements. This article explains about Algorithm to solve subset sum problem quickly and easily. The problems on subset sum problems perform arithmetic operations that can be calculated in terms of exponential time - polynomial time. Major part of the article deals with Class-P type problems which in be solved on a deterministic Turing Machine. This article is mainly prepared on the basis of an article in Wikipedia.