Merge pull request codemistic#628 from NarpatAanjana/main

GFG problem

Author: gantavyamalviya

CPP/Geek and Strings.cpp

@@ -0,0 +1,24 @@
+class Solution{
+public:
+ vector<int> prefixCount(int N, int Q, string li[], string query[])
+ {
+ unordered_map<string,int> mp;
+ 
+ for(int i=0;i<N;i++)
+ {
+ string s ="";
+ for(int j=0;j<li[i].size();j++)
+ {
+ s +=li[i][j];
+ mp[s]+=1;
+ }
+ }
+ vector<int> ans(Q, 0);
+ for(int i=0;i<Q;i++)
+ {
+ ans[i] = mp[query[i]];
+ }
+ 
+ return ans;
+ }
+};

CPP/Problems/Number of Dice Rolls With Target Sum.cpp

@@ -0,0 +1,30 @@
+class Solution {
+public:
+ 
+ int solve(int n, int k ,int t,vector<vector<int>>&dp){
+ if(n == 0 && t == 0 )
+ return 1;
+ 
+ if(n == 0) 
+ return 0;
+ 
+ int take = 0; 
+ 
+ if(dp[n][t] != -1) 
+ return dp[n][t]; 
+ 
+ for(int i = 1;i<=k;i++) { 
+ if(t >= i) {
+ take += solve(n-1,k,t-i , dp);
+ take %= 1000000007;
+ } 
+ }
+ return dp[n][t] = take; 
+ }
+ 
+ int numRollsToTarget(int n, int k, int target) {
+ vector<vector<int>> dp(n+1 , vector<int> (target+1,-1));
+ return solve(n , k ,target , dp);
+ } 
+ 
+};