PinnedNash4 Pillars of Object-Oriented ProgrammingObject-Oriented Programming (OOP) is one of the most popular programming paradigms. The concept is to model software based on data, not…Aug 17, 2022Aug 17, 2022
PinnedNash6 Types of Relationships in OOP (Object-oriented programming)By designing code based on OOP relationships, we can make it reusable, maintainable, and well-structured. And In this article, we are…Aug 20, 2022Aug 20, 2022
PinnedNash7 Sorting Algor Visualization to Refresh Your Algorithm Class.We will explore 7 sorting algorithms that we might have forgotten [Bubble-Selection-Insertion-Shell-Quick-Merge-Heap — Sort]Oct 1, 2022Oct 1, 2022
PinnedNashSharing Code Between Web & Electron Apps SummaryThis article will explain 4 strategies, which is the summarized version of the 40min video from the Slack Desktop Engineer.Sep 28, 2022Sep 28, 2022
NashReact Native Under the Hood | App.js Conf 2024 by Phillip Pan — Video SummaryIn this blog post, we dive into the key points from Phillip Pan, a Meta software engineer working on developing the React Native framework…Jul 5Jul 5
NashFollow Along with Fireship AI Art Generator Tutorial: DALL·E API via Node.jsAI image generation is so popular right now, right? So what about playing around with API instead of using their demo web app? This article…Nov 5, 2022Nov 5, 2022
Nash6 Lessons I Learned From “The Playlist” Netflix Series“The Playlist” actually gives you a glimpse of how creating a big tech platform works from various of perspectives. In this article, I will…Nov 3, 2022Nov 3, 2022
NashSpeech-to-Text via Python in 5 mins: Let’s try with AssemblyAI.Curious about Speech-to-Text? Want to play around? This article will show you how to get started with speech-to-text APIs, making it easier…Oct 23, 2022Oct 23, 2022
NashQuick Sort — Concepts and VisualizationQuick Sort is a Divide and Conquer algorithm. It will pick a pivot, and start partitioning by moving all the elements that are less than…Oct 2, 2022Oct 2, 2022
NashMerge Sort — Concepts and VisualizationMerge Sort is a Divide and Conquer algorithm. It will keep dividing the array into two halves until it becomes undividable, then it will…Oct 2, 2022Oct 2, 2022