Time for another weekly blog post. This week we will briefly talk about bubble sort. Bubble sort is a simple sorting algorithm that constantly compares the adjacent element and swaps it if it's not in order.

This is best used for arrays that are almost sorted due to their lengthy…

Algo — Medium

The following will be a quick walkthrough on a brute force solution for the array of products problem.


Write a function that takes in an array of integers and returns an array of the same length, where each element in the output array is equal to the…

Algo Expert — Easy

Today we are going to go over a simple coding question.


Given two arrays, we need to determine if the second array is a subsequence of the first array.

Subsequence: is a set of numbers that aren't necessarily adjacent in the array but that are in…

Medium — AlgoExpert


Given an array of integers, write a function that returns the first integer that appears more than once when the array is read from left to right.

  • The important thing to know by reading the problem is that they want the first so we will definitely not…

AlgoExpert — Medium

One of the problems I worked on this week was about Monotonic.


Monotonic: of a function or quantity) varying in such a way that it either never decreases or never increases.

In other words there is no change in direction. …

A short intro to singly linked lists.

Definition: A linked list has nodes and within each node has a value and a pointer to another node/null. Since this is singly linked list then it means it is only connected in one direction. There is no index. …

Level: Medium from HackerRank

This week me and two other friends tackled the Magic Square Coding Challenge. It was great to work together to come to a solution. Seeing different point of views, and thought processes makes it more fun, all while being able to share out loud your own…

This is short walk through on how to solve the longest consecutive sequence Leetcode problem #128.

The problem:

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

Example 1:

Input: nums = [100,4,200,1,3,2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3…

Nerly Ton

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