Wondering if this is doable in regex? | Together Java | Page 1

unborn oar Jul 18, 2024, 1:00 AM

#

Hello! Just working on hacker rank and came across an easy substring problem but am wondering how you could solve the problem using regex. Quite naive with regex but heres my failed attempt.

The problem is to determine the flexographically largest and smallest K sequence of characters in a string.

pulsar foxBOT Jul 18, 2024, 1:00 AM

#

<@&987246883653156906> please have a look, thanks.

graceful stratus Jul 18, 2024, 2:32 AM

#

what makes something flexographically large?

#

and no

#

generally regexes are taught in theory of computation courses to illustrate something less powerful than a turing machine

#

so if you want to understand when it is theoretically possible to use regexes

#

(aside from wacky lookbehind behavior that might make it turing complete idk)

#

then you should dig into that course work

#

key words are "theory of computation, regex"

unborn oar Jul 18, 2024, 2:41 AM

#

graceful stratus what makes something flexographically large?

was just looking to split the string at K intervals using a regex expression, compareTo is for lexographical comparison🙏

#Wondering if this is doable in regex?