How m-saad-k/hackerrank-max-unique-substring-length-in-a-session works
This is a small Python script that computes the longest sequence of distinct alphabetic characters under its reset rules. Its entry point calls the function with a hardcoded sample and prints the result; it does not read user input. The function resets its current sequence on nonletters or repeated characters. The graph reflects the single provided source file.
Main entry points: main.py Script entry
Components 4
Other components
- Script runner
- Script entry
main.py - Length function
main.py - Terminal output
Connections 4
- Script runner → Script entry: runs
- Script entry → Length function: calls
- Length function → Script entry: returns length
- Script entry → Terminal output: prints result