# Find sub-string with given power

Given a string of lowercase alphabets, the task is to find indexes of a substring with given power. Assume power of a to be 1, b to be 2, c to be 3 and so on. Here the power of a substring means the sum of the powers of all the characters in that particular substring.

Examples:

Input: str = “geeksforgeeks” power = 36

Output: Substring from index 3 to 5 has power 36

Explanation: k = 11, s = 19, f = 6 i.e. k + s + e = 36.Input: str = “aditya” power = 2

Output: No substring with given power exists.

**Simple Approach:**

1. Calculate powers of all substrings using nested for loops.

2. If the power of any substring equals the given power then print the indexes of the substring.

3. If no such substring exists then print “No substring with given power exists”.

**Time Complexity:** O (n ^ 2).

**Efficient Approach:** Use map to store the powers.

1. For each element check if curr_power – power exists in the map or not.

2. If it exists in the map it means that we have a substring present with given power, else we insert curr_power into the map and proceed to the next character.

3. If all characters of the string are processed and we didn’t find any substring with given power, then substring doesn’t exist.

`// C++ program to find substring with given power ` `#include <bits/stdc++.h> ` `#define ll long long int ` `using` `namespace` `std; ` ` ` `// Function to print indexes of substring with ` `// power as given power. ` `void` `findSubstring(string str, ll power) ` `{ ` ` ` `ll i; ` ` ` `// Create an empty map ` ` ` `unordered_map<ll, ll> map; ` ` ` ` ` `// Maintains sum of powers of characters so far. ` ` ` `int` `curr_power = 0; ` ` ` `int` `len = str.length(); ` ` ` ` ` `for` `(i = 0; i < len; i++) { ` ` ` `// Add current character power to curr_power. ` ` ` `curr_power = curr_power + (str[i] - ` `'a'` `+ 1); ` ` ` ` ` `// If curr_power is equal to target power ` ` ` `// we found a substring starting from index 0 ` ` ` `// and ending at index i. ` ` ` `if` `(curr_power == power) { ` ` ` `cout << ` `"Substring from index "` `<< 0 << ` `" to "` ` ` `<< i << ` `" has power "` `<< power << endl; ` ` ` `return` `; ` ` ` `} ` ` ` ` ` `// If curr_power - power already exists in map ` ` ` `// then we have found a subarray with target power. ` ` ` `if` `(map.find(curr_power - power) != map.end()) { ` ` ` `cout << ` `"Substring from index "` ` ` `<< map[curr_power - power] + 1 ` ` ` `<< ` `" to "` `<< i <<` `" has power "` `<<power << endl; ` ` ` `return` `; ` ` ` `} ` ` ` ` ` `map[curr_power] = i; ` ` ` `} ` ` ` ` ` `// If we reach here, then no substring exists. ` ` ` `cout << ` `"No substring with given power exists."` `; ` `} ` ` ` `// Drivers code ` `int` `main() ` `{ ` ` ` `string str = ` `"geeksforgeeks"` `; ` ` ` `ll power = 36; ` ` ` ` ` `findSubstring(str, power); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

Substring from index 3 to 5 has power 36

**Time Complexity:** O (n)

## Recommended Posts:

- Minimum splits in a binary string such that every substring is a power of 4 or 6.
- Find if a given string can be represented from a substring by iterating the substring “n” times
- Find max length odd parity substring
- Length of the largest substring which have character with frequency greater than or equal to half of the substring
- Given two numbers as strings, find if one is a power of other
- Find the longest substring with k unique characters in a given string
- Partition given string in such manner that i'th substring is sum of (i-1)'th and (i-2)'th substring
- Find length of longest subsequence of one string which is substring of another string
- Substring Sort
- Substring Reverse Pattern
- Longest substring with count of 1s more than 0s
- Frequency of a substring in a string
- Longest Non-palindromic substring
- Palindrome Substring Queries
- Check if a string is substring of another

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.