Hello all ! I’m slowly walking into data structures & I mean very slowly. Last week I dabbled in Trees, no to be confused with Tries. What’s the difference? A tree is a structure of recursive nodes, most seen in problems are binary tree and balanced tree. A trie is a kind of tree but mainly used for retrieval hence the name trie, but there all other types of tries. Each type of tree has different behavior, structure and use cases. I recently did a very basic preorder traversal of a binary tree on LeetCode.

To get the expect output…


Hello all! Still working my way through the wild world of algorithms and data structures. Lately I’ve been grinding on LeetCode almost everyday trying to solve easy level problems but even the easy problems can be very hard. Coming from a bootcamp, problem solving isn’t really something that’s fully taught but it’s kind of difficult to teach while also teaching how to build things. Through doing algorithmic problems is where I’m picking up the skill, very so slowly but making progress. One of the things I’m recognizing though is some problems can be solved with specific techniques. One of these…


Hello all, One of the first algorithms I did was find the palindrome. A palindrome is a word, phrase or sequence of characters that reads the same left to right & right to left. When I initially came across this problem I just wanted to solve it to get the test to past, aka brute force. I didn’t consider time complexity, much less gave thought to a simpler way. My initial amateur approach was checking every single letter that's in the argument. Whether it was true or false, the function will check every single character.


My last blog I discussed arrays and Linked List, the pros and the cons. Linked Link are a data structure and have a very specific way that they are written, they use the class keyword. The Linked List contains a head, tail and length property. It also contains nodes which are a value and pointer to another node or null. Linked List do not have indexes so random access isn’t allowed!

Node set up

First we define the Node class then the constructor which takes in a value. A constructor is a special function of the class that is responsible for initializing the…


I’ve finally worked up the courage to dive into data structures, interestingly I find data structures to be slightly less terrifying than algorithms. I’ve been doing some LeetCode and I am absolutely starting with all easy questions but recently I got a question that required the solution to be solved using a data structure, I was not ready. If you’ve been reading my blogs you know that I attended the Flatiron School’s immersive software engineering program. In bootcamps you’re only taught how to build applications on the fly, not solve complex algorithms and solve it using the best solution that…


I haven’t really written too much about programming on the backend, mostly because I prefer frontend programming. Recently I’ve started working on my mobile app Plantbae again and I am working on adding more features and then deploying it to the app for everyone to use. When I first started working on the app as my final project, I was in a position where I didn’t have to consider whether my app was scaleable. In bootcamp I was taught Ruby followed by Ruby on Rails and although I really enjoyed Rails and it made a lot of things easier but…


Hello all ! I am still taking a slow walk through algorithms before understanding algos and really breaking down code, whenever I needed to iterate over an array or an object I usually went with a method that I’ve used before. Of course I learned about filter() and reduce() but I learned a whole bunch of other things too! I very quick realized I forgot a lot of the fundamentals of Javascript & working through algos understanding the fundamentals is key!

filter() :

The filter() method creates a new array of elements that pass the conditional provided. In other words…


Hello again ! My last couple of blogs have been about algorithms and what I’ve learned working with algorithms is how important it is to understand the fundamentals of a programming language. Often times when I look at solutions and it make sense to me but I also like to go over what each syntax does literally. Last week while going through technical questions that are asked during interviews, on of them was what is the difference between the forEach and map methods. I’ve used map more often than forEach but I’ve used it but thinking about the question I…


Hello again ! Since diving into algorithms I’ve done several that involved searching for something specific or returning something. Last week though I came across an algorithm in which you would write a function that accepts a positive number. The function should console log a sequence in the pattern of steps with n levels using the # symbol. Make sure the step has spaces on the right hand side.

this is the expected output when n = 5.

As I do with all problems, I restate it in my own words to make sure I understand what is expected of me. I think about what is the input, but…


Hello again ! I’ve been doing algo for the last month and I’m actually getting better finally but as I get into more difficult I realized I needed to really brush up on my fundamentals of JS. Closures is one of those fundamentals but when I looked into, I didn’t see how it was different than declaring a global variable. When using global variables you are able to access that variable anywhere.

In my short time of programming, I’ve only ever used global variables because that’s what I was taught. For my small applications and code challenges, using global variables…

Dolly Desir

The sassy developer

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store