Hello Everyone, I’d like to start a new series called “Quarantine and Code”. I saw the hashtag on twitter and it inspired me to do some tutorials while spending most of my time indoors. The algorithm I’ll be solving today is pretty famous. It’s a graph algorithm called Flood Fill and it’s very similar to…
Tag: algorithms
Sudoku Validator | Python w/ Tests
Hello, it has been a minute but I finally have a tutorial for you all: Sudoku Validator. I first saw this question on Pramp.com (and yes I bombed it). I finally came up with a great solution that I feel is teachable enough. The question goes, “given a 9×9 grid, verify whether it is a…
Print Spiral Matrix Python
Hello Everyone, today’s algorithm is the unintuitive “Print Spiral Matrix”. My friend got asked this question from Squarespace two years ago and I finally decided to tackle it. I failed, but shout out to the internet for eventually giving me the answer. Personally, I’d rate this a LeetCode medium-hard. It’s also a question on Pramp….
Climbing Stairs | Python | Leetcode
Hey everyone. I’d like to share a pretty popular Dynamic Programming algorithm I came across recently solving LeetCode Explore problems. It’s super cool. The algorithm asks us, given n (which is the staircase number/step), how many ways can we reach it taking only one or two steps at a time? Here is the video…
Rotate a Matrix: With New Array (Python)
Hello everyone. I have another algorithm for you all today. One I’ve been meaning to tackle for a while now. La rotation d’une matrice…Rotation of a Matrix! I have two versions for you all, both in Python. This post makes a copy of the original matrix and adds the correct values to it, the second…
Number Of Islands Tutorial (Python)
Hey everyone, glad to finally get this tutorial out to you all. I know I’ve been stating this for months now but I finally re-visited the question the other day and it was a lot less intimidating than when I had first seen the algorithm last year. I hope to simplify it for you all….
Interview Cake Review
Hey you all, I’ve been meaning to write a review about Interview Cake. Just to leave my feedback. I’ve solved/read through all of the 46 questions. There does not appear to be any unsponsored reviews from what I’ve researched, so here goes. Disclaimer: I am in no way being paid for this review and I…
Stack of Plates ~ Cracking the Code (Python)
Hello everyone, today I am showing you a Stack question out of Cracking the Coding Interview. The question is 3.3 in the Stacks and Queues chapter. I discovered this implementation on-line and commented it for better understanding. The video below is also an explanation of the process. The stack of plates question basically asks that,…
Sort Stack Python~ Cracking the Code
Hello, Everyone. I solved an algorithm in Cracking the Coding Interview a few days ago and thought i’d share my code since I could only find one partial Python implementation online. The first video below shows a visualization of what is expected. The second video is of me explaining the concept and implementing the code….
Round 4 Coding Challenge (Incomplete)
Hey readers, It has been two months since my last post. I am ending this challenge to begin a new one. Since my last post for round 4, I’ve only: Completed about 5 algorithms(on Code Wars) Applied to 145 jobs (in all rounds combined) Interviewed with Sparkbox (made to final round) Received a coding assignment…
Busiest Time in the Mall – Python
My 3rd question from Pramp. The Westfield Mall management is trying to figure out what the busiest moment at the mall was last year. You’re given data extracted from the mall’s door detectors. Each data point is represented as an integer array whose size is 3. The values at indices 0, 1 and 2 are…
Coding Challenge (Round 3)
Dang, so it’s been a month (I think) from my last blog post, but I reached my goal of solving 100+ algorithms a little over a week ago. If you count the mock interviews it would be 110. Honestly, this week I’ve been slacking. I think i’m burnt out. Here is the YouTube video for…
ColorfulCode's Journey 