tvl-depot/scratch/facebook/moderate
William Carroll a0e9e2b310 Solve unsorted-substring a second time
This solution operates in O(n) time instead of O(n*log(n)) time, which
surprisingly isn't *that* big of a difference...

Consider a size of n of 10M...
  1) ~10s
  2) ~0.5s

So, yes, the O(n*log(n)) will take 100x longer to complete, but for an enormous
input size of 10M elements, it can still complete in under a minute. The
difference between that and the second, faster, algorithm, is just 9s.
2020-11-14 15:28:23 +00:00
..
decompress-xml.py Write encoded XML parser and pretty-printer 2020-11-14 14:00:00 +00:00
parser.py Write encoded XML parser and pretty-printer 2020-11-14 14:00:00 +00:00
tic-tac-toe-checker.py Solve tic-tac-toe checker 2020-11-13 17:45:07 +00:00
unsorted-substring.py Solve unsorted-substring a second time 2020-11-14 15:28:23 +00:00