Data Structure topics

Task Scheduler - Algorithm and Data Structure Project [in JavaScript]

In this article at OpenGenus, we are going to build a task scheduler project which implements a priority queue, and we will use a min heap data structure to manage the tasks based on their priorities.

Data Structures

Mean of Array problem solved with Treap

In this article at OpenGenus, we have solved the Mean of Array problem using Treap Data Structure.

Data Structures

Ghost Town problem solved with Treap Data Structure

In this article at OpenGenus, we will discuss the Ghost town problem. This involves the concept of Treap data structure.

C Programming

Trie in C Programming Language (using struct)

To represent a Trie data structure in C, you can use a structure and pointers to create the nodes of the Trie.

Python

AVL Tree in Python [using OOP + Inheritance]

AVL (Adelson-Velsky and Landis) tree is a self-balancing binary search tree, where the balance factor of each node is the difference between the heights of its left and right subtrees i.e. either -1, 0, or 1.

Data Structures

Swarm Intelligence for Distributed Data Structures

Distributed data systems provide a way of organising and managing data across interconnected computers or devices. It provides benefits such as scalability, fault tolerance and data synchronization.

Java

Hash Map in Java using OOP concepts and Generics

In this article at OpenGenus, we will implement Hash Map in Java using OOP concepts and Generics.

JavaScript

Queue Data Structure in JavaScript [with OOP]

In this article at OpenGenus, we will delve into the queue data structure in JavaScript, understand its underlying principles, and learn how to implement and utilize queues effectively.

Java

Stack in Java using OOP concepts + Generics

In this article at OpenGenus, we will explore how to implement a stack using array in Java using OOP concepts and Generics.

C++

Heap in C++ using OOP and Template

In this article at OpenGenus, we will explore how to implement the heap data structure in C++ using principles of object-oriented programming (OOP) and templates.

Algorithms

27 Algorithm and Data Structure Project Ideas

In this article at OpenGenus, we will list important and unique project ideas that have algorithmic approaches behind them.

Python

Heap in Python using Object-Oriented Programming (OOP) concepts

In this article at OpenGenus, we will implement Heap in Python using Object Oriented Programming.

Python

Queue in Python using OOP concepts

In this article at OpenGenus, we will explore the implementation of a Queue in Python using the principles of Object-Oriented Programming (OOP). By utilizing OOP concepts in Python, we can create and manipulate queues in a structured and efficient manner.

C++

Doubly Linked List in C++ using OOP and Template

In this article at OpenGenus, we will review how we can utilize OOP and templates to create a versatile and efficient implementation of a doubly linked list in C++.

Python

B Tree in Python using OOP Concepts

In this article at OpenGenus, we will explore the implementation of a B-tree in Python using the principles of Object-Oriented Programming (OOP). By utilizing classes and objects, we'll create a B-tree structure that supports efficient insertion, searching, and display operations.

Python

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.