The Big Int |

Re-igniting a love for programming.
Episode 32 - Better Anagrams
In episode 6, we wrote a Python script to find anagrams. Since the algorithm evaluated every combination of a given input and then filtering them through a dictionary, this was obviously very slow. It had a complexity of O(n!). Here's a better way to do it. It has a big-O complexity of just O(n)


We are Ravi and RK. Our channel is an opportunity for you to kindle or re-kindle your love for programming.

Join us on this journey. We release an episode (or two) every Saturday. Subscribing to our channel and clicking the bell will notify you when new content is available.

Let us know if you would like to see us code-up something interesting. We would love to hear from you.

No copyrights here. You are free to copy anything and everything here.