diff --git a/DSA/Basic-DSA-Questions/Sparse Arrays/Sparse Arrays.cpp b/DSA/Basic-DSA-Questions/Sparse Arrays/Sparse Arrays.cpp
new file mode 100644
index 00000000..36d2c8b1
--- /dev/null
+++ b/DSA/Basic-DSA-Questions/Sparse Arrays/Sparse Arrays.cpp	
@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+#include<string.h>
+
+using namespace std;
+
+string ltrim(const string &);
+string rtrim(const string &);
+
+
+vector<int> matchingStrings(vector<string> strings, vector<string> queries) {
+vector<int> ans;
+for(int i=0;i<queries.size();i++){
+    int val=0;
+    for(int j=0;j<strings.size();j++){
+        int res=strcmp(&queries[i][0], &strings[j][0]);
+        if(res==0){
+            val++;
+        }
+    }
+    ans.push_back(val);
+}
+return ans;
+}
+
+int main()
+{
+    vector<string> strings;
+    vector<string> queries;
+    strings={"abcde","sdaklfj","asdjf","na","basdn","sdaklfj","asdjf","na","asdjf","na","basdn","sdaklfj","asdjf"};
+    queries={"abcde","sdaklfj","asdjf","na","basdn"};
+    for(int i=0;i<queries.size();i++){
+       cout<< matchingStrings(strings,queries)[i]<<endl;
+        
+    }
+}
diff --git a/DSA/Basic-DSA-Questions/Sparse Arrays/Sparse Arrays.txt b/DSA/Basic-DSA-Questions/Sparse Arrays/Sparse Arrays.txt
new file mode 100644
index 00000000..85e94f0b
--- /dev/null
+++ b/DSA/Basic-DSA-Questions/Sparse Arrays/Sparse Arrays.txt	
@@ -0,0 +1,14 @@
+There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. 
+
+Function Description
+
+Complete the function matchingStrings in the editor below. The function must return an array of integers representing the frequency of occurrence of each query string in strings.
+
+matchingStrings has the following parameters:
+
+    -string strings[n] - an array of strings to search
+    -string queries[q] - an array of query strings
+
+Returns
+
+    -int[q]: an array of results for each query