I was so enthralled by the Codefights Challenges of writing shortest code last weekend. After several attempts, I finally managed to rank #1 in this MatchingParentheses problem with one-line solution of only 77 chars(excludes whitespace). Curtailing chars of solution is fun with little tricks. In the following I will show the tricks I used in this problem. Problem Description: Given a string para, consisting of symbols '(', '[', '{', ')', ']', '}' and ' ', find out if it is a correct bracket sequence (CBS in short) with occasional whitespace (' ') characters.