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. Strings
  4. Pseudo-Isomorphic Substrings
  5. Discussions

Pseudo-Isomorphic Substrings

Sort by

recency

|

17 Discussions

|

  • mabalotjonrayp
     + 0 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.

  • mariocfbais
     + 1 comment
    def pseudoIsomorphicSubstrings(s):
    # Write your code here
    def cod(w):
        c, n, d = '', ord('a') - 1, {}
        for letter in w:
            if letter in d.keys():
                c += d[letter]
            else:
                n += 1
                c += chr(n)
                d[letter] = chr(n)
        return c

  • yashparihar729
     + 0 comments

    Here is my solution in java, python, C, C++, Csharp HackerRank Pseudo-Isomorphic Substrings

  • mineman1012221
     + 0 comments

    Here is the solution of Pseudo-Isomorphic Substrings Click Here

  • keramzit3000
     + 1 comment

    how to skip task?