Subset Sum Problem-New Representation Approach for finding the solution

Abstract The Subset Sum problem is an non deterministic problem where we need to find a resultant number from a set of numbers to perform the addition of subset of a set. Non-polynomial problems comprise of the set of decision problems where answer to any instance of the problem is true then it can be easily proved why the solution is true. Non-Deterministic Polynomial problems are the collection of problems where if the solution is true, then it provides the complexity of the problem in polynomial time [1]. In this paper we will demonstrate the new representation method for subset sum problem which is very easy and help to the students and research scholar to find the solution.