Semi interesting article. But remember folks,

Wealth ≠ success.

Smart ≠ wealth.

A readable, sensible, step-by-step solution

After a break, I started teaching myself more of Python by taking on data structure and algorithms questions on Leetcode. The reverse an integer one is one I thought would be simple enough to dive back in.

I chose to write about this question because, while simple, there are many…

A Step-by-Step Guide with Code Walk Through

In this Leetcode problem, we’re told that we’re given an ordered array of positive integers that has some missing numbers as input, along with a number (k). Our task: find the kth missing number in that input array. Sounds more complicated than it…

Remember those edge cases!

While this problem might not be too difficult at first glance, I believe the main lesson of it is dealing with edge cases. The problem states that we’ll get a string of upper/lower case alphabet characters, along with white spaces. …

Applying separation of concerns concepts and backtrack recursion

After bootcamp graduation I spent a lot of time learning CS fundamentals, data structures and algorithms. And while I have seen and solved problems using recursion before (hello binary search tree traversals!) this was the first time I encountered a problem where…

I’m a visual learner and thinker. So let’s tackle this leetcode problem in a non-esoteric way.

Problem Statement

Pretty simple when it’s not in mathy/code speak: we’re given one number (n) and another number (k). We have to return the kth factor of n. …

I was recently solving a problem, where one of the sub problems to solve was finding the second largest number in an array of integers. I’m humble enough to admit it: I froze for a bit. I know the typical methods for moving/returning at the start and end we use…

A guide to solving LeetCode #46: Permutations

If you’re reading this, I reckon that, like me, you were having difficulty solving this LeetCode problem. Or, also like me, you want to lean into understanding recursion better. This is the post for you. …

Tackling permutations and recursion one step at a time.

Solving a permutation problem with recursion has been particularly difficult for me to wrap my head around. It just doesn’t seem as natural as iteration. So let’s take a gentle journey, you and me. We’ll walk through a recursive solution together…

I failed the interview question. Let’s make sure we both learn a lesson.

I recently had a tech interview where I was asked this question:

Given an array of characters return a string that counts the number of each consecutive letter.

Example: [“a”, “b”, “b”, “a”] should return “a1b2a1”


Saul Feliz

Always learning.

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