Udacity Front-end Nano-degree so far

Hey you all. So i’m reviewing Udacity front-end Nano-degree so far. At the time I am writing this i’m 63% through the JavaScript section, which is section 3 of the Nano-degree. I’m reviewing part way just to update you all, and if worse case scenario I don’t get to complete it. I know the deadline…

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,…

………………………………………………………..

  So, I’ve decided to temporarily censor this post for about two weeks. I don’t want to delete it although it’s embarrassing but it’s part of my journey and I like to have an archive of my entire experience to look back on one day.  🙂 ____________________________________________________________________________________________ This entire process is demoralizing. They couldn’t even…

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…

Sentence Reverse – Python

This was the question I received in my first ever Pramp interview. I failed terribly at it, but now it seems so easy. #progress Input_array = [ ‘p’, ‘e’, ‘r’, ‘f’, ‘e’, ‘c’, ‘t’, ‘ ‘, ‘m’, ‘a’, ‘k’, ‘e’, ‘s’, ‘ ‘, ‘p’, ‘r’, ‘a’, ‘c’, ‘t’, ‘i’, ‘c’, ‘e’ ] Output_array = [ ‘p’,…

Decrypt Message (Python)

This is one of the problems I received on Pramp. For this problem we are acting in reverse. We are given the steps on how to encrypt a word, but we have to figure out how to decrypt it. First we create a function called “decrypt”, then we set a variable, “prev” to 1. We…

One Edit Away Python

This is a challenging one and a Dynamic Programming problem. This was also in Cracking the Coding Interview, the strings chapter. What this question calls for is to check whether a word is only one edit away from another word. For example bike, pike == True Mall, Malls == True blew, blue == False aale,…

Compress a string (Python)

Hello everyone! Today I will be breaking down the algorithm to compress a string. For example Given: “aaabccccd” Should return: “a3b1c4d1” First, we define a function called “compress” with one argument, “string”. Next, we set a new variable, “res”, to an empty string so that we can add the final result to it. We set…

Coding Challenge (Round 2)

So I have “solved”(attempted) 90/91 algorithms since I began this journey a few weeks ago. Here is the youtube video that expands on/compliments this blog post. At the time of the video I only solved 85. At the time of writing this post, I am at 91. 20 CodeWars (7 kyu) 10 Interview Cake 5…