re.search clear solution for Word boundaries by kurosawa4434 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

re.search solution in Clear category for Word boundaries by kurosawa4434

from re import search


def boundaries(n: int, words: str) -> str:
    if words[n:] and words[n] != ' ':
        head = search('\S*$', words[:n]).group(0)
        body = search('\S*', words[n:]).group(0)
        return head + body


print("Example:")
print(boundaries(2, "a b c"))

# These "asserts" are used for self-checking
assert boundaries(2, "a b c") == "b"
assert boundaries(8, "+ - * / ( ) = 0") == "("
assert boundaries(12, "How do you do?") == "do?"
assert boundaries(6, "This is a very strange test...") == "is"
assert boundaries(0, "!!! What !!!") == "!!!"
assert boundaries(14, "test test ERROR") == "ERROR"
assert boundaries(1, "o o o!!!") == "error"

print("You are doing great! Now, it's time to check!")

Feb. 27, 2024

Comments:

gleb10101010101 on March 5, 2024, 10:56 a.m.
<a href="https://www.codingame.com/clashofcode/clash/report/355305074a4585cf384f1206ab38f6675bca142">Almost won</a> my own clash on codingame (based on this my mission) in Shortest mode. As base I used this your solution and shorted it to 138 symbols) ``` n,e,s=int(input()),input(),import('re').search print(s('\S$',e[:n]).group(0)+s('\S',e[n:]).group(0)if e[n:]and e[n]!=' 'else'error') ```

Strings Theory

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.