eppsnet.com
Competitive Programming: SPOJ – Distinct Substrings
Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T