Add files via upload

Author: shashankch292

Strings/AmazingSubarrays.cpp

@@ -0,0 +1,61 @@
+/*
+You are given a string S, and you have to find all the amazing substrings of S.
+
+Amazing Substring is one that starts with a vowel (a, e, i, o, u, A, E, I, O, U).
+
+Input
+
+Only argument given is string S.
+Output
+
+Return a single integer X mod 10003, here X is number of Amazing Substrings in given string.
+Constraints
+
+1 <= length(S) <= 1e6
+S can have special characters
+Example
+
+Input
+ ABEC
+
+Output
+ 6
+
+Explanation
+Amazing substrings of given string are :
+1. A
+2. AB
+3. ABE
+4. ABEC
+5. E
+6. EC
+here number of substrings are 6 and 6 % 10003 = 6.
+
+LINK: https://www.interviewbit.com/problems/amazing-subarrays/
+*/
+
+#define MOD 10003
+
+bool check(char c)
+{
+ c = tolower(c);
+ if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u')
+ return true;
+ return false;
+}
+
+int Solution::solve(string A)
+{
+ int n = A.length();
+ int ans = 0;
+
+ for(int i=0;i<n;i++)
+ {
+ if(check(A[i]))
+ {
+ ans = (ans + (n-i))%MOD;
+ }
+ }
+
+ return ans;
+}