Learn, Build, and Grow Together.

Connect with fellow developers and gain access to tools that will help you build a profitable SaaS 🚀

Sign UpProgramming posts, videos, courses, and more

Insertion sort is a technique of sorting wherein you build a sorted array from an unsorted one by picking wrongly placed elements from the unsorted part of the array and placing them at the correct position in the sorted part.
What is insertion sort?
In this technique of sorting, we basically select an element of the array at a...

4

One of the most common text editors used by developers is Visual Studio Code. Microsoft created it to be the first cross-platform programming tool in the Visual Studio family that supported OS, Linux, and Windows .Visual Studio Code is by far one of the most popular code editors for web, mobile, and hardware developers.
In this...

6

In this article I'm gonna talk about selection sort algorithm and how to implement it in C language.
What is Selection Sort?
The main idea behind this sorting algorithm is to scan the unsorted part of the array repeatedly to find the smallest element in it and placing it at the beginning of this unsorted array.
You have to Selec...

8

Sorting means to arrange a group of things in a specific order. Algorithms that help us sort a group of items are called Sorting Algorithms.
In this article I'm gonna give a brief introduction about Sorting Algorithms and its various types that you might come across.
What are Sorting Algorithms?
They're nothing but just a way to...

5

Linear Search and Binary Search are two popular searching algorithms. In this article, we'll be comparing the two algorithms in order to find out which algorithm is better based on their applications.
An Overview
Everyday we come across various situations wherein we find ourselves searching for things. Similarly, a computer alwa...

6

Many of you guys requested us for NodeJS cheatsheets and here you go guys, this is an ultimate NodeJS cheatsheet.
In programs, the 'high level' scope is the global scope. That implies that in programs in case you're in the global scope 'var' something will characterize a global variable. In Node this is unique. The high level s...

7

Previously, we briefly discussed about time complexity of algorithms. You can check it out here if you haven't yet.
In this post we'll learn about the concept of time complexity in a more detailed way. A mathematical way of representing the time complexity of an algorithm. It's definitely gonna include some uncomfortable looking...

6

The time complexity of an algorithm is the time taken by an algorithm to run.
The significance
Sometimes, when we try to solve a problem, we might think of more than one way to solve it. Now some of these approaches might take less time to come to the solution while the others might take more time.
The approach that takes the le...

4

Introduction
In this post, we'll learn how to fetch a pull request locally and test it out before merging it into our project repository. We can also make changes to it if required and push those changes as well.
Testing the PR locally
Suppose, we have an open source project on GitHub and contributors are contributing to it in t...

4

Introduction
In this post, we'll look at the useRef() hook that provides a way to directly access a DOM node. We'll also look at scenarios where we can use the value of the reference returned by the Ref hook that is persisted between component re-renderings.
Prerequisites
An understanding of the useState() and useEffect() Hook...

4

Binary Searching algorithm is used to search for an element in a sorted array. It involves dividing an array into halves until the element is finally found.
I've already given a brief introduction of this algorithm in one of my previous posts. You can find it here if you haven't read that yet.
So let's get started with the algor...

4

Searching algorithms are designed to locate the position of an element (if present) in a data structure.
To search for an element in a linear data structure like an array, we can use many different types of searching algorithms. Here we're gonna talk about two most important searching methods - Linear Search and Binary Search....

4

So far we've discussed about how we can perform certain operations on a Binary Search Tree. It is no fun to learn about new stuff when you don't know where exactly you can use it. So, In this article I'm gonna be talking about the applications of Binary Tree Data Structure.
But first, lets find the answer to a simple question :...

6

In this article I'm gonna talk about how we can find the k'th maximum element in a given Binary Search Tree.
Previously we talked about the methods of finding the k'th minimum element in a BST. If you haven't read that yet, please check it out here because we're gonna use the similar concepts here.
In k'th minimum element search...

4

So far we've discussed about insertion, deletion and searching operations in a Binary Search Tree. If you haven't read them yet, you can check them out here.
In this post I'm gonna talk about how you can find the K'th - Minimum element in a Binary Search Tree.
So, let's start!
What is meant by the "K'th minimum element"...

5

In this post I'm gonna be talking about deletion of a node in Binary Search Tree.
There can be three scenarios for deletion of a node in a Binary Search Tree.
Let's first discuss the three scenarios.
The three situations of deletion
1. Node to be deleted is a leaf node
It has the easiest deletion procedure.
When you want to del...

4

In this post, I'm gonna be talking about how we can search for an element in a Binary Search Tree.
It is very easy to search for an element in a Binary Search Tree, easier than even in an array.
All you have to do is compare the element's value with the value you're searching for at each level until you reach the targeted elemen...

6

As a side hustle, I teach tech recruiters web and software development technologies using plain English. It helps them with understanding job specs and resumes and it makes all of us, tech people, happier.
I run a weekly newsletter and often get feedback from recruiters via email or LinkedIn DMs.
I thought that I could try to co...

3

In this article I'm gonna talk about the ways of traversal we can perform on Binary Trees.
A node of a binary tree primarily consists of three components -
it's own data (D)
It's left child (L)
It's right child (R)
Consider a node to be the most basic unit of a binary tree. Then the traversal methods that can be performed on...

5

A Binary Search Tree is a Tree in which each node has not more than two child nodes, and each of the child nodes are inserted in the tree based on a certain rule - the left child should have value less than the parent node and the right child should have the value greater than the parent node.
A good example for a Binary Search...

8

Binary trees are a type of Tree data structure wherein each node has at-most 2 child nodes.
We've already discussed about Tree data structure. So, in this article we're gonna talk about the implementation of Binary Trees in C.
This is how a Binary Tree looks like. As you can see here, no node has more than 2 child nodes.
Basic...

6

A Tree is a non linear data structure. Unlike the data structures that we've learned so far like - Linked Lists, Stacks, Queues, etc. In this type of data structure, one element can be linked to more than one element.
Tree data structure, just like the other data structures we've learned so far, is an example of abstract data ty...

5

Till now we've come across many different types of data structures. In this article I'm gonna be talking about a concept called Abstract Data Type.
Primitive Data Types
But before getting started with that, let's first talk about what we exactly mean by "Data types".
So, here's the definition for you - A data type of a...

6

Till now we've talked about linked lists and the basic operations associated with it. But today we're gonna talk about linked lists only, but with a slight variation.
In a linked list, traversal can be done one way(a node only had "next" component associated with it), in a doubly linked list, traversal can be done both...

6

A queue is a linear data structure which follows FIFO principle in deletion and insertion operations.
In real sense queue is just a sequence of objects(people, vehicles, etc.) waiting for their turn to come.
For instance, it could be a queue of people waiting for their turn to come to buy tickets for a movie show, it could be a...

6

TD;DR: If you are a good software designer Copilot will not help you very much.
What is GitHub Copilot?
GitHub Copilot is an AI pair programmer.
It was trained with a huge coding database of common small routines.
It also can recognize bad comments and create imperative code from them.
GitHub copilot is a text transformer simi...

8

A stack is a linear data structure in which operations can be done in a specific order. Stacks follow the LIFO (Last In First Out) Principle.
I'm sure you might've heard of a stack of different things like a stack of papers or a stack of books. The stack data structure is exactly the same thing.
The operations on a stack like -...

6

Hi!, today in this blog we'll be discussing some great free resources to learn JavaScript right from the scratch.
So, are you excited? Let's go then! 🚀
So first things first, are you a person like me who prefers written tutorials more effective than video tutorials? (comment below 😉)
Here are some GREAT tutorials out there:
Do...

11

Hello Folks 👋
This is Savio here. I'm young dev with an intention to enhance as a successful web developer. I love building web apps with React. I have proved my superiority in frontend technologies.
Today, Let's learn how you can create a well-efficient search filter in React ✌️. So, let's start!
Create React App
First of all,...

8

After a long time, a new post on JavaScript methods is here... Let's learn about the indexOf() method.
indexOf()
It accepts two parameters: The required parameter of searchValue indicates the content you want to search for in a string.
The optional start parameter indicates the position of the string in which the search will be...

6

Loading More Content