Skip to content

gives positions of occurrence of a substring using rolling hash functions

Notifications You must be signed in to change notification settings

nurdidemm/Rolling-Hash-Functions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Rolling-Hash-Functions

Given two strings:

S = s1s2s3...sn

T = t1t2t3...tn

returns the positions of T where S is a substring using rolling hash functions.


Input Format

The input consists of two lines. The first line contains the string S and the second line contains T.


Output Format

The output contains all indices i such that S is a substring of T at index i, in sorted order, one on each line.

The indices are 1-based.

S is guaranteed to occur at least once in T.

About

gives positions of occurrence of a substring using rolling hash functions

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages