Data Structures

In algorithmic problems involving graphs, we use several well-known algorithms. Two of them are graph traversal algorithms: Breadth First Search and Depth First Search. And two more, A* and Dijkstra’s algorithm, are used when we want to find the optimal path from one node to another within a graph. In…

Let us assume you are given an array and you are asked to return the largest element in the array. Then there are two possibilities for this to think of, one is if the array is sorted, then we can directly return the last element in the array. If the…

A bitset is a data structure that stores a sequence of bits (values of 0 or 1) in a compact form. It is typically used to represent a set of boolean values and provides efficient operations for setting, testing, and resetting individual bits, as well as for performing bitwise operations…

I learned about data structure and algorithms in November 2022. In this post, I would briefly like to introduce what I have studied concerning data structure and algorithms. Regarding data structure, we can use Collection Framework in JAVA because the framework has an efficient version of list, set, and map…

As we already aware of, searching an array/list for a number is something we happen to do every now and then in our daily jobs. For that, we also have so many libraries and utility functions to help us search instead of writing all the code ourselves. So why this…

Algorithms and Data Structures From Zero to Hero — In this blog, we will be discussing the quicksort algorithm, a popular sorting algorithm that is known for its efficiency and effectiveness. Quicksort is a divide and conquer algorithm, which means that it works by dividing the unsorted list into smaller sub-lists and then sorting each sub-list independently before combining…

Problem Desciption : Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: MinStack() initializes the stack object. void push(int val) pushes the element val onto the stack. void pop() removes the element on the top of the stack. int…

This guide will teach you how to design algorithms. It’s not an easy task, but it’s definitely worth the effort! Let’s start… Decide what the algorithm must do. The first step in designing an algorithm is to determine what the algorithm must do. This can be done by defining your problem and thinking about how it…

java Math class provides sqrt() method to find the square root of a number. In this section,we will create a Java program to find the square root of n — java Math class provides sqrt() method to find the square root of a number. In this section,we will create a Java program to find the square root of n In Java, finding the square root of a number is very easy if we are using the pre-defined method. Java Math class provides sqrt() method to find the square root of a number. In this section, we will create a Java program to find the square root of a number…