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.
after reading the editorial I undertand why this problem is expert
the proposed sol uses musch less memory (unimportant, my uses 100k) and is much more fast (may be 32 (or 64) times faster ?)
BUT using basic C my sol runs in less than 1 sec on test case 12 (50k string) the only I have unlocked
All test run whith time limit so why use a contrived solution?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Hamming Distance
You are viewing a single comment's thread. Return to all comments →
after reading the editorial I undertand why this problem is expert the proposed sol uses musch less memory (unimportant, my uses 100k) and is much more fast (may be 32 (or 64) times faster ?) BUT using basic C my sol runs in less than 1 sec on test case 12 (50k string) the only I have unlocked All test run whith time limit so why use a contrived solution?