• + 2 comments

    Good problem. My Java solution is an optimized O(n^3). The longest time it takes is 0.77s. https://www.hackerrank.com/challenges/substring-diff/submissions/code/11510387