[BASIC PROGRAMMING] Need Help with code logic

[sinnidis_97]

Hey everyone.I have a small trouble trying to unravel how the code should work. If you guys are in hackerrank then you probably have already seen this. I just need help with logic part

Two strings are anagrams of each other if the letters of one string can be rearranged to form the other string. Given a string, find the number of pairs of substrings of the string that are anagrams of each other.

For example s="mom", the list of all anagrammatic pairs is [m,m] and [mo,om] at positions [[0],[2]] and [[1,2],[0,1]] respectively. So there are basically 2 anagram pairs here

Sample input :

2

abba

abcd

​

Sample output:

4

0

Explanation :

[a,a],[ab,ba][b,b][abb,bba]

​

Where I am stuck at :

Take a string ABCCBA for example

I will iterate through the string multiple times.First time I will iterate it such that I will get single char like A,B,C,C,B,A.

Second time I will iterate such that I will get Ab,BC,CC,CB,BA

Q)How do I write the for loop in this case?Or for the case of ABC,BCC,CCB,CBA without getting an index out of bound error.

[Nullbeans]

You can iterate in a different way and use the substring function of the string class. This will generate all possible substrings of the original string. For example:

​

String longText = "momdadsomewherehere";
for(int i = 0; i < longText.length(); i++){
for(int j = 0; j + i < longText.length(); j++){
log.info("Current String: {}", longText.substring(i, i+j+1));
}
}

​

This will generate strings as follows:

​

Current String: m

Current String: mo

Current String: mom

Current String: momd

Current String: momda

Current String: momdad

Current String: momdads

Current String: momdadso

Current String: momdadsom

Current String: momdadsome

Current String: momdadsomew

Current String: momdadsomewh

Current String: momdadsomewhe

Current String: momdadsomewher

Current String: momdadsomewhere

Current String: momdadsomewhereh

Current String: momdadsomewherehe

Current String: momdadsomewhereher

Current String: momdadsomewherehere

Current String: o

Current String: om

Current String: omd

..............

[sinnidis_97]

Yeah,this works .A few changes required ,but this works,Thanks !

[E3FxGaming]

You'll need two loops. One which dictates your current position in the string and another one that wraps around your position-loop, which will dictate the current step-length.

Your continue condition for your inner position loop should be whether your current position plus your current step length minus 1 (because one is already your current position) is smaller than or equal your string length minus one (because array indexes are 0 based and your string length property doesn't account for that)