Re:Why HackerRank and other coding tests are ageist
by yorwba on Wednesday September 06, 2017 @08:45AM
(#15183146)
> When you’ve got a history of having built a high frequency trading system for Citadel, Deutsche Bank, Morgan Stanley, you’ll know a lot about latency and order flow – but you might not know how to find a maximal duplicated substring within a palindrome on a HackerRank-type test.
I have only a vague idea of the requirements in financial technology, but aren't streams of financial data central to it? And repeating substrings correspond to pattern repetitions, so they might be important, especially the longest ones.
I think if you can find the longest repeating pattern in a stream of data, you should also be able to find maximal duplicated substrings in palindromes.
Maybe it's more about the way the problem is phrased rather than about the difficulty of coming up with a solution?
I have only a vague idea of the requirements in financial technology, but aren't streams of financial data central to it? And repeating substrings correspond to pattern repetitions, so they might be important, especially the longest ones.
I think if you can find the longest repeating pattern in a stream of data, you should also be able to find maximal duplicated substrings in palindromes.
Maybe it's more about the way the problem is phrased rather than about the difficulty of coming up with a solution?