We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent dd38a1f commit 274735aCopy full SHA for 274735a
src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.py
@@ -4,15 +4,15 @@
4
import math
5
6
7
-def sherlock_and_anagrams(s: str) -> int:
+def sherlock_and_anagrams(s_word: str) -> int:
8
9
candidates = {}
10
- size = len(s)
+ size = len(s_word)
11
12
# Calculate all substrings
13
for i in range(0, size):
14
for j in range(0, size - i):
15
- substr = s[i:size - j]
+ substr = s_word[i:size - j]
16
print(f'i: {i}, {size} size - j: {size - j} | substr: {substr}')
17
18
# Add substrings to a candidate list.
0 commit comments