Algorithms Set Partition Problem (Same sum) Set Partition Problem: determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is same. The time complexity of solving this using Dynamic Programming takes O(N x SUM) time.
Algorithms Number of ordered pairs such that (A[i] & A[j])=0 Given array A[] of n integers, find out the number of ordered pairs such that (A[i]&A[j])=0. This can be done using dynamic programming in O(N*(2^N)) time
Algorithms Calculating Permutation Coefficient Given n and k, we will calculate permutation coefficient using dynamic programming in O(N * K) time complexity.