PinnedWhy You Should Be Writing Software Tests as an Indie DevIt seems like a waste of time, but not doing it sooner will waste even more of your time.Aug 20, 2025路5 min read路13
Explanation for Leetcode 230: Kth Smallest Element in BST - Solution Code in Java and JavaScriptOct 18, 2023路2 min read路20
How to Use the Position Property in CSSCSS has many properties for styling web pages and web apps; one of those properties you may use is the position property. There are 5 different types of positions: Absolute Fixed Relative Sticky Static In this article, you will learn about all...Sep 14, 2023路3 min read路12
Preorder, Inorder, Postorder Traversal with Binary Trees: Leetcode Solution Provided in JavaPreorder, Inorder, and Postorder are three of the four ways to traverse a binary tree. These approaches are the three ways to do a depth-first search of a binary tree. Preorder Traversal - involves accessing the root first, then visiting its left ch...Sep 10, 2023路4 min read路22
Getting Over Your Shyness With Showcasing Your Projects and How to Get StartedYou have to get over your shyness when it comes to showcasing your dev skills. It is important that you showcase your work because it helps you grow your skills and get recognition. Getting feedback, good and bad, will let you know what you need to i...Sep 7, 2023路3 min read路19
Big O NotationBig O notation is primarily used to describe the upper bound or worst-case time complexity of an algorithm. It provides an estimation of how an algorithm's runtime will grow as the input size increases to its largest possible value. In this article, ...Sep 3, 2023路11 min read路39
RecursionRecursion is a programming method where a function calls itself until it solves a problem by breaking it down into smaller instances of the same problem. Imagine you have a set of nesting dolls. Each doll can have a smaller doll inside. Recursion is...Aug 31, 2023路2 min read路19
Binary Search: What It is and How to Implement ItBinary search is an important algorithm for computer programmers to know because it is a very efficient way to search for an element in a sorted list. The time complexity of binary search is O(log n). This makes binary search much faster than other s...Aug 26, 2023路3 min read路16
