As you know, I have been doing a lot of algorithm questions lately. This week let’s talk about another classic interview question that often comes out: Meeting Room II (Leetcode #253).

In today’s blog, we will talk about another back it again at the algorithm question. This time is a little bit harder. I usually solve Breadth-First-Search (BFS) in a tree problem. Never in my life have I solved it with a non-tree data structure. For that reason, this problem is a good example to test the water. It is a popular interview question among big FANGG companies, especially Amazon (if you know). So let’s not talk more about it and dive deeper into the problem.

Here is the problem:

This week I encountered many interval questions in binarysearch.com and leetcode. Since I struggle from time to time on this topic, I would love to write a blog regarding interval topics. Today we are going to discuss leetcode #435 Non-overlapping Intervals.

Here is the question:

Back at it again with another algorithm blog! Today we will talk about one of the popular questions in Leetcode, #647 Palindromic Substrings. There are many ways to solve this problem. We are going to talk about ‘ expand around possible centers here.

Here is the question:

We want to return the number of ways to obtain a non-empty palindrome by trimming the string’s left and right sides (but without rearranging the string). As long as it produces a palindrome, the left and right trims can also be empty.

Intuition: Expand Around Possible Centers

The intuition of ‘expand around possible centers’ is that palindromes are…

Hello, today’s topic is back at it again with the algorithms blog. Today we are going to talk about leetcode question #724 Find Pivot Index. Before we are trying to solve the question, we should understand what prefix sum is.

What is the Prefix Sum?

Prefix sum in the array is iterating through index 1 to last and adding the present element with the previous value. People also called this term cumulative sum, inclusive scan, or scan of the sequence number. The intuition behind this is that the prefix array’s previous position will have the previous elements' sum. In that way, we can find the…

This week’s blog is going to be different than usual. Let’s take a break from tech and talk about human beings. Recently I saw many people talking about imposter Syndrome in the job searching process. Imposter syndrome is a common experience for everyone; we all have been through imposter syndrome somewhere in our lifetime. Today I want to share my three simple principles on how I avoid imposter syndrome. I hope this article can help and reduce your imposter syndrome in many ways.

Don’t compare yourself with others.

Developers often spend much time deciding the correct data structure to use. Choosing the right data structure can make it easier to operate data, saving time, and making code more comprehensive. The two most prevailing data structures for storing collections of data are Objects and Arrays. Developers use Objects to store key/value pairs and Arrays to store indexed lists. However, ECMAScript 2015 introduced two new types of iterable objects: Sets and Maps; these are ‘keyed collections,’ which means their behavior is slightly different and offers performance advantages.

The difference between Map and Object

There are two main differences between Map and a traditional Object in Javascript.

Direct iteration

…

This article will show a quick introduction of a for loop, a forEach, a for of, and a for in. We are going to talk about what are their differences and similarities in this article.

For Loop

This method is the most traditional type of iteration in Javascript. It takes three expressions; a variable declaration and expression to be evaluated before each iteration, and an expression to be evaluated after each iteration. Let's dive into an example.