You are on page 1of 1

priority_queue<int> heap(B.begin(),B.

end());

TreeNode* root=new TreeNode(A[mid]);

bool** dp; dp = new bool*[n];


for (int i=0; i<n; ++i)dp[i] = new bool[sum];

nck..
int C[k + 1];
memset(C, 0, sizeof(C));

C[0] = 1; // nC0 is 1

for (int i = 1; i <= n; i++) {


// Compute next row of pascal triangle using
// the previous row
for (int j = min(i, k); j > 0; j--)
C[j] = C[j] + C[j - 1];
}
return C[k];

binary_search(prime.begin(), prime.end(), consSum)

vector<string> &dict
unordered_set<string> dictSet(dict.begin(), dict.end());