Visual and Speed Efficiency

Hi, guys!

Enjoy solving the new mission:

The mission was created by kurosawa4434 and is called the “Boundary Blocks”. Your task here is to find the coordinates of the non-adjacent blocks that make the boundary for the adjacent cells of the grid.

set(boundary_blocks(['..X',
                    '.X.',
                    'X..'])) == {(0, 2), (1, 1), (2, 0)}
set(boundary_blocks(['...',
                    '.X.',
                    'X..'])) == set()
set(boundary_blocks(['X.X.',
                    '.X..',
                    '..X.',
                    '....'])) == {(0, 0), (0, 2), (1, 1)}

Here are some great articles on visual and speed efficiency:
• You might want to clarify some things about Python dicts and memory usage, like: how much memory does a new, empty dict consume; what will happen to the memory usage if you add something to the dict; what happens as you expand your dictionary; will the memory be returned to the system if you remove items from your dictionary; and what if you remove everything from the dict?
• Start Stylin’ with Pandas and its new style API! This article will show examples of how to format numbers in a pandas DataFrame and use some of the more advanced pandas styling visualization options to improve your ability to analyze data with pandas.
• Julien Kervizic talks about the most popular data manipulation library for Python and what it takes to Become a Pro at Pandas. Don’t miss a lot of useful information on how to get the best out of pandas!

The users who’ve made the TOP 3 this month are tom-tom, Amesoeurs, and mortonfox. Great job! Keep on coding, guys!