Data Structure topics

Fenwick Tree vs Segment Tree

In this article, we will understand the difference between two key data structures namely Fenwick Tree/ Binary Indexed Tree (BIT) and Segment Tree. We solve the problem "Sum Query Mutable" to explore the differences.

Minimum Spanning Tree (MST)

Water distribution [solved using Minimum Spanning Tree]

In this article, we have solved the problem of Water distribution using Minimum Spanning Tree, Union Find and Sorting Algorithms.

C++

Trie in C++ using OOP concepts

In this article, we'll look at how the Trie data structure is implemented in C++ using principles of object-oriented programming (OOP).

segment tree

Booking Concert Tickets in Groups [using BIT and Segment Tree]

In this article, we have solved the problem of Booking Concert Tickets in Groups. This involve the concept of Binary Indexed Tree and Segment Tree.

trie

Lexicographic sorting using Trie

Lexicographic sorting is a way of sorting a set of strings based on their alphabetical order We can also say that the order in which those words appear in a dictionary.

Python

Trie in Python using OOP concepts

In this article, we have implemented Trie Data Structure in Python Programming Language using OOP concepts. We have explained the implementation design step by step.

JavaScript

Built-in Hash Table in JavaScript

In this article, we will explore how hash tables work in JavaScript, with examples and tips. Built-in Hash Table in JavaScript involve using a Map with 2 key methods set and get.

Data Structures

Kinetic Heap

In this article, we will explore the topic of Kinetic Heap Data Structures, including its implementation and practical applications.

Data Structures

Data Structures (DS) and Quick Revision

Data structures are a fundamental concept in computer science that provides a way to organize and store data in a computer so that it can be accessed and modified efficiently.

Data Structures

Applications of 24 Different Data Structures

In this article, we have listed and explained the real-life applications of 24 Different Data Structures ranging from common ones like Array, Linked List to Geometric Data Structures like R-Tree to Probabilistic Data Structures like LogLog.

Time Complexity

Time and Space Complexity of B+ Tree

B+ trees an interesting name isn't it? So in this article, we will closely analyze the time & space complexities for different operations in different cases of B+ Tree Data Structure.

Data Structures

(a,b) Tree Data Structure

An (a,b)-tree is a type of self-balancing tree data structure that is designed to maintain a balance between the height of the tree and the number of elements stored in the tree. In short we can say that (a,b)-tree is a generalization of a B-tree. Now lets get to know it in depth.

Algorithms

2D Prefix Sum

In this article, we discuss about how to find the Prefix sum of a given matrix that is 2D Prefix Sum. We have demonstrated 3 methods to find the 2D prefix sum.

Data Structures

Abstract Data Type in Data Structure

In this article, we have explained the concept of Abstract Data Type in Data Structure in depth along with code examples and theoretical examples of Data Structures. The best examples of Abstract Data Type come from C++ STL (Standard Template Library) and Java Collections.

Algorithms

Stack vs Linked List

In this article, we will be discussing about "Stack vs Linked List" in detail.

Algorithms

Heap vs Binary Tree

Today we are going to compare two non linear data structures binary trees and heaps since both are non liner there tend to be confusion regarding both of these usually we will try to remove these confusion.

Algorithms

Binary Heap

Binary heap is a complete Binary tree structured as a heap data structure. Binary heaps are common way of implementing priority queues.

Algorithms

Design LFU (Least Frequently Used) Cache

In this article, we will be designing a LFU (Least Frequently Used) Cache using different Data Structures such as Singly Linked List, Doubly Linked List, Min Heap and much more.

Algorithms

Separate chaining collision resolution technique

In this article, we are going to see how we can actually resolve the collisions which happen during hash mapping using Separate chaining collision resolution technique.

linked list

Linked List Interview Questions [with answers]

This is the list of Interview Questions based on Linked List Data Structure. You must practice these Multiple Choice Questions. This will help you master Linked List Coding Questions for Interviews at companies like Google and Microsoft.

Data Structures

Binary Search Tree with Parent Pointer

In this article, we have covered Binary Search Tree with Parent Pointer which is a modification of the standard Data Structure, Binary Tree.

Culture

Inventor of Linked List

Linked List is one of the most fundamental Data Structure and it was developed in 1953 by Hans Peter Luhn, Allen Newell, Cliff Shaw and Herbert Simon from IBM and RAND Corporation.

Data Structures

Circular Doubly Linked List

In this article, we have explored Circular Doubly Linked List and operations that can be performed on it. It is a combination to two Data Structures namely Circular Linked List and Doubly Linked List.

Data Structures

Introduction to Tree Data Structure

In this article, we have presented a detailed introduction to Tree Data Structure. This will quickly give you the idea of Tree, how it is implemented and the different types that are used.

Culture

OpenGenus Visual Documentation

In this article, we give a detailed documentation of the development of OpenGenus Visual project which is an open-source Visualization tool for Algorithms and Data Structures.