We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. Substring Diff
  5. Discussions

Substring Diff

  • mickeyvn
     + 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