Data Structure topics

Doubly Linked List in Python using OOP concepts

In this article at OpenGenus, we will design doubly linked list and implement using OOP concepts in Python Programming Language.

C++

Adjacency list and matrix in C++

In this article, we will take a look at the concept of Adjacency list and Adjacency matrix and how to implement both data structures in C++ Programming Language.

JavaScript

Doubly linked list in JavaScript

In this article at OpenGenus, I will explain what are doubly linked lists and how to implement them using JavaScript.

Algorithms

Range greatest common divisor (GCD) query using Sparse table

In this article at OpenGenus, we will be discussing one of the common problem in computer science that involves finding the GCD of a given range of numbers in an array. One of the efficient solution is to use sparse table data structure to solve this problem.

Algorithms

My Calendar III Problem [Solved with Segment Tree, Sweep Line]

In this article at OpenGenus, we have solved the Calendar 3 problem that is to find number of conflicting meetings in a given range of time. We have solved this using the concept of Sweep Line and Segment tree with Lazy Propagation.

Data Structures

B Tree in C++ with OOP and template

B-trees are frequently implemented in C++ as templates, allowing for flexible customization for various data and application types. The balanced tree structure of the B-tree data structure makes it ideal for efficient data searching, insertion, and deletion.

Data Structures

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.

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.