Like me, you too are new to the world of styled-components. Well, my fellow curious Front end developer look no further!! …
In case you are interested in seeing the quotesGenerator component in action here is the link to my website: https://keeks5456.github.io/
Everyone has their favorite quote(s) they love to either tell people, post about on their Facebook or get tattooed on their body to cherish forever!
If you are curious to…
Move Zeroes is a leetcode challenge that prompts you to move all the zeroes in an array to the end of that array.
The Problem:
Given an array of nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.
Example:
Input…This weekend I attended a Hackathon called “Health and Wellness”, hosted by Major League Hacking Community. This time around I went into this hackathon with the plan to either find a group or create my own project! …
As I continue my battle in learning how to solve algorithms for future technical interviews, I was recommended by a friend to schedule mock interviews on a site called Pramp!
Once you have signed up for Pramp, you receive 6 interview credits for you to you any time! You will…
If you’re like me, practicing a code challenge is probably the one thing that’s got you feeling extremely nervous about that technical interview coming up soon, or even tomorrow! That’s okay, they are meant to be challenging, otherwise, they wouldn't be called code challenges!
Luckily, they are not impossible to…
For my final project for Module 5 at Flatiron, it was the day before our projects were due for presentations. Unfortunately, my project was not how I envisioned it to look or function. That was okay, I had already accepted that it wouldn't. …
What does it mean to find the “maximum depth ” of a tree data structure?
Luckily, it is as simple as finding the last remaining french fry at the bottom of your bag! …
Continuing on from my latest blogs of learning about Tree and Graph data structures, I wanted to also write about the two ways to traverse these data structures using Breadth-First Search & Depth-First Search!
What is a Depth-First Search algorithm?
Depth-first search is an algorithm and searches or traverses through a graph or tree data structure…
