re.match, more intricate patterns, no comparisons creative solution for All Upper II by Splitter - python coding challenges

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

re.match, more intricate patterns, no comparisons solution in Creative category for All Upper II by Splitter

import re

def is_all_upper(text: str) -> bool:
    is_text_invalid_match = re.match(r'\A[ \d]*\Z', text)
    is_text_valid_match = re.match(r'\A(?
                        March 13, 2020

                        
                            Comments:
                            
                                
                                    jakubbortlik
 on Dec. 5, 2022, 7:43 a.m.

                                    <p>Regular expressions can certainly do this kind of job, but it can be much simpler:
```
def is<em>all</em>upper(text):
    pattern = re.compile(
        """(?=.*[A-Z])   # At least one upper case character (positive lookahead)
        [^a-z]+           # One or more non-lowercase characters""",
        re.VERBOSE,
    )
    return bool(pattern.fullmatch(text))
```
Notice, that in your solution you evaluate `is<em>text</em>valid_match` twice. Instead, you could just `return True` at the end of the function.</p>

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.