Category: Data Structures and Algorithm

Why a HashMap is faster than Array?
In computer science, storing and retrieving objects or elements from a group of things is very important. The way you store data and how easily (or better to say, how quickly) you can access the data from a group of lots of different data sets is a crucial process. Data structures like Arrays and HashMaps…

Mastering Binary Search: A Comprehensive Guide for Programmers
Binary search is a vital computer science algorithm widely used in various applications. The algorithm is an efficient way to search for a specific item in a sorted list of data. If you are a programmer, mastering binary search is a musthave skill. It helps to improve your performance, optimize your code, and solve complex…

Simple explanation of Bit Manipulation for DSA in Javascript  Bit Masking
This is the second part of the Bit Manipulation twoblog series. Bit manipulation is the act of algorithmically manipulating bits or other pieces of data shorter than a word. Bit manipulation is something that has constant time complexity. Bitwise operators are used in programming to manipulate bits, as well as for some boolean operations. In…

Simple explanation of Bit Manipulation for DSA in JavaScript  Number System
So we have arrived now at our next stop in the series of “Understanding Data Structure and Algorithms with JavaScript 🚀”, which is the Bit Manipulation. Bit manipulation is one of the most critical topics in competitive programming competitions point of view because using BIT methods can decrease your submission time, directly increasing your rank among…

Simple and Best Explanation on Sliding Window Algorithm with Diagram
Welcome to another blog of the series “Understanding Data Structure and Algorithms with JavaScript 🚀”. The sliding window algorithm is one of the most popular techniques in order to find the suitable subarray or substring for a given problem. It helps reduce the use of nested loops into a single loop, thus decreasing the time complexity…

Introduction to Recursion – Learn In The Best Way with JavaScript  Part 1
Recursion is one of the important and challenging topics for many developers to understand and master. Recursion is also a foundation for many other algorithms and techniques. Developers often get confused and it gets difficult to visualize what is happening at each stage during recursion execution. Here is an article explaining the working of Recursion…

Simple Explanation on BFS and DFS Graph Traversal Methods
Graph Traversal is one of the most important topics in the Graph series. It is also one of the most popular interview questions one might expect, because of the ton of realworld applications there are! As discussed in the last blog, we understood different methods of adding and removing edges and vertex. In this blog…

Basic operations in Graph Data structure
Graphs are nonlinear data structures consisting of a finite set of nodes and edges. In our last blog, we studied and understood what really is a Graph data structure, its importance, and its application. This blog will teach different operations associated with the Graph data structure, like adding vertex or edge and removing vertex or…

Introduction to Graph Data Structure
So we have arrived now at our next stop in the series of “Understanding Data Structure and Algorithms with JavaScript 🚀”, which is the Graph data structure. Like the Tree data structure, the graph data structure is also a nonlinear structure consisting of nodes and edges. You can imagine it as a pictorial presentation of an…

Simple Explanation of Sorting Algorithms with JavaScript  Part 2
This is the second part of the Sorting Algorithms with Javascript from the “Understanding Data Structure and Algorithms with JavaScript ” series. In this blog, we will discuss two significant sorting algorithms known as Merge and Quick Sorting algorithms. We will also discuss its Working, Implementation with Javascript, Illustration, and the time complexity of each…