Graphs are one of the most important data-structures out there with a wide variety of practical uses. In this post, we will look at Graph Implementation in Java using HashMap. In case you want to know more Graph data structures and the types of graphs, please refer to this detailed Read more…
In this post, we will be implementing Graph Data Structure in C++. As a language, C++ provides a lot of STLs (or Standard Template Libraries) that make life easy when implementing advanced data structure. We will be using STL to implement a Graph. In case you want to know more Read more…
In this post, we will look at understanding the basics of Graph data structure. Graph is arguably one of the most practically used data structures. For example, below are some of the way graph data structure is useful: In the field of computer science, graphs can represent a computational flow. Read more…
In this post, we will look at the coin change problem dynamic programming approach. The specialty of this approach is that it takes care of all types of input denominations. This is unlike the coin change problem using greedy algorithm where certain cases resulted in a non-optimal solution. However, before Read more…
In this post, we will look at the solution for Coin Change Problem using Greedy Algorithm. But before that, let’s understand what Greedy Algorithms are in the first place. 1 – What are Greedy Algorithms? Greedy Algorithms are basically a group of algorithms to solve certain type of problems. The Read more…
Linked List is a linear data structure. The major difference linked lists have from arrays is that the elements in a linked list are not stored in contiguous memory location. In this post, we will be understanding linked lists and also implementing various linked list related operations in C++. If Read more…
Maximum Subarray Sum is an interesting problem that provides insight into different ways to solving a problem. The important point is that each solution to the problem has a different time complexity. And as a result, this problem acts as a good example of how we should think about solving Read more…
Array is one of the most basic data structures out there. We use it in a wide variety of applications as well as real-life situations. In this post, we will look at various array operations in detail. We will also be understanding the time and space complexity of these various Read more…
Arrays are one of the most important and most common data structures out there. Any respectable application, framework or library will probably be using arrays in some form. Also, when it comes to coding interviews, arrays are still the most frequently asked data structure. In this post, we will understand Read more…
In this post, we are going to look at the Min Stack Get Operation problem. As the name itself suggests, this problem is about implementing an operation on Stack that allows the consumer to fetch the minimum element. So what’s so hard about it? Well – the catch here is Read more…
