Before revision:  In classical computing any brute-force solution to the Maximum Clique Problem requires an exponential increase of time with the size of the problem (i.e., with time complexity of O(2^n)) . In this paper, Maximum Clique Problem has been solved using combinatorial approachof Grover's search algorithm . An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph  which makes the approach generalized in nature for Maximum Clique Problem.
After revision:  In classical computing any brute-force solution to the Maximum Clique Problem requires an exponential increase of time with the size of the problem (i.e., with time complexity of O(2^n)) . In this paper, a generalized algorithm for the k-Clique problem has been newly proposed using a classical-quantum hybrid approach, which can also be extended as a generalized algorithm for maximum clique problem. The complexity of the proposed algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph which makes the approach generalized in nature for Maximum Clique Problem.