Question
Count the hashtags in a social post. A hashtag is a '#' followed by one or more letters or digits; it ends just before the first character that is neither. Tags compare case-insensitively. Return a dictionary mapping each lowercase tag (without the '#') to how many times it appears. A bare '#' with nothing valid after it is not a hashtag. For example, '#DevLife rocks #devlife' yields {'devlife': 2}.
count_hashtags(post: str) → dict[str,int]["Loving the new build #DevLife #devlife and #Rust!"]out{"rust":1,"devlife":2}State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.