Blog
An algorithm that selects the smallest value or element from an unsorted list in each iteration and moves it to the beginning of an unsorted list.
More Stories
Merge Sort
Similar to binary search, merge sort is a divide and conquer algorithm. The goal is to break down a complicated problem into sub-problems and recursively continue to divide them until we have plenty of simple problems that we can easily solve.
Objects
Objects are used to store keyed collections of different types of data which get more & more complex overtime.
DSA
In an early stage of being a software engineer, DSA or data structure & algorithm are some of the most important concepts to study. If you understand the fundamentals, you can dive deeper into the field without hesitation.
Array Flattening in JavaScript
An array can contain many things such as String, Number, Boolean, Object. This is how we store an ordered collection, where each item is indexed and starts from 0.
Prism with Next.js
Prism is a popular syntax highlighter commonly used with Markdown. This example shows how to use Prism with Next.js. Use the theme dropdown in the header to switch syntax highlighting themes.
Props & State in React
Conceptually, components are like JavaScript functions. They accept arbitrary inputs called “props” and return React elements describing what should appear on the screen.