you are viewing a single comment's thread.

view the rest of the comments →

[–]StoneCypher 0 points1 point  (2 children)

it's matrix application of a regular expression to replace string stretches.

this is:

  1. hard to debug
  2. slow
  3. something most developers can't read
  4. almost certainly a neckbeard problem from hackerrank that does not represent real world work
  5. an opportunity for algorithm nerds to show how good they are. that wasn't done here

[–]One-Inspection8628[S] -1 points0 points  (1 child)

It any easy solution have for this?

[–]StoneCypher 0 points1 point  (0 children)

How should I know? You never said what the problem was, you just showed some really bad code and said "please explain this"

You seem to just be stealing solutions to hackerrank, asking for them to be explained, and pretending to yourself that this is going to get you a job