Skip to content

Counts how many substrings of a bigger string are anagrams of each other.

Notifications You must be signed in to change notification settings

PedrobyJoao/Hardest-Logic-Exercise

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Substrings anagrams

Java exercise to improve my skills:

This is not a normal anagram counter. Here we are looking for SUBSTRINGS (inside a bigger string) that have the same characters, they are anagrams of each other.

Examples:

  • Input: "ovo" Output: 2 || ['o', 'o,] and ['ov', 'vo']
  • Input: "ifailuhkqq" Output: 3 || ['i', 'i'], ['q', 'q'] and ['ifa', 'fai']

How to use:

  • In terminal: "javac Anagrams.java"
  • "java Anagrams"
  • It will ask for an input "string"
  • Result

About

Counts how many substrings of a bigger string are anagrams of each other.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages