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.
I'm using C# and highest I could achieve right now is 53% pass test cases, all of the remaining testcase fails are either "abort called : Out of Memory" or runtime too long. I used Hash tables, and for the large input string it goes above 1 million hash size which is what I think makes it throw out of memory, any ideas how this can be avoided? should I redo and try a new approach? because on my local machine I can run the tests properly. I've tried optimizing as much as I can too.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Pseudo-Isomorphic Substrings
You are viewing a single comment's thread. Return to all comments →
I'm using C# and highest I could achieve right now is 53% pass test cases, all of the remaining testcase fails are either "abort called : Out of Memory" or runtime too long. I used Hash tables, and for the large input string it goes above 1 million hash size which is what I think makes it throw out of memory, any ideas how this can be avoided? should I redo and try a new approach? because on my local machine I can run the tests properly. I've tried optimizing as much as I can too.