Task List: Data Structures

This is a task list focused on Data Structure topics for OpenGenus IQ :brain: and Cosmos

See this guide to understand how to use this task list.
Message @aditya if you need any help. You may work on uncompleted tasks, improve existing work and add questions for a completed task. See published posts here

Following is a small collection of scopes you may contribute to:

Basic data structures

Intermediate data structures

  • Binary Search tree (assigned to @Vaibhav)
    • maximum or minimum element in a binary search tree (assigned to @phm_123)
  • Heap
  • Self balancing binary tree:
  • Bitmask (assigned to @ajaybechara1)
  • Adjacency matrix
  • Adjacency list
  • Lowest Common Ancestor in a Binary Tree (assigned to @Meds)
  • Union Find (assigned to @saddhu1005)
  • Trie
  • Range minimum query
    • Native approach (assigned to @siddharth)
    • Square root decomposition (assigned to @siddharth)
    • Segment tree (assigned to @siddharth)
    • Fenwick tree
    • Sparse table
    • Cartesian tree
  • Range addition query (assigned to @siddharth)
    • Native approach (assigned to @siddharth)
    • Square root decomposition (assigned to @siddharth)
    • Segment tree (assigned to @siddharth)
    • Fenwick tree
    • Sparse table
    • Cartesian tree
  • Finding the number of elements less than a given number in a given range
    • Fenwick tree (assigned to @sagar)
  • Number of distinct elements in a index range
  • Square Root Decomposition
  • Sparse tree
  • Sparse table (assigned to @prashant-mahanta)
  • Binary lifting in Lowest Common Ancestor
  • Fractional cascading (binary search)
  • Longest Common Prefix array (LCP)
  • Prefix Sum Array
  • Rope Data Structure (assigned to @Ishmeetk21)
  • Gap buffer
  • Zipper
  • Piece table
  • order statistics tree
  • Patracia tree
  • Policy based data structures (C++)

Advanced data structures

Probabilistic data structures

  • Bloom filter
  • Count Min sketch
  • Skip list (assigned to @Robotjelly123)
  • Treap
  • Quotient filter
  • Rapidly-exploring Random Tree (RRT)

Kinetic data structure

  • Kinetic heap
  • Kinetic sorted list
  • Kinetic minimum spanning tree
  • Kinetic tournament/ priority queue

Problems / Applications of above data structures

  • Infix to postfix using Stack (assigned to @piyush26c)
  • Count inversions in an array using Fenwick Tree (assigned to @akshay_103)
  • postfix to infix using stack (assigned to @akshay_103)
2 Likes

(self assigned to @InfiniteVerma)

2 Likes

I want to write article and code on
Stack

1 Like

Assign Binomial Heap to @vidya

1 Like

Assign me Stack using queue

1 Like

Please assign Hash Map to @cat, thanks!

1 Like

Please assign me Doubly Linked list

1 Like

I want to work on Circular queue.

1 Like

I want to work on Fibonacci Heap. Please assign me for this task.

1 Like

I want to work on Bloom Filter

1 Like

Please assign me Probabilistic data structure: Bloom Filter @aditya
Thankyou

1 Like

@aditya please assign me Skip List Under Probabilistic data structures!!

1 Like

@aditya please assign me Queue using Stack data structure !!

1 Like

@aditya Assign me Infix to postfix using stack

1 Like

I would like to work on XOR linked list . Please assign me that

1 Like

Could you assign me Priority Queue?

1 Like

@aditya assign me singly linked list

Assign me lowest common ancestor in a binary tree.

1 Like

@aditya Please assign radix tree to me.

1 Like

Please assign me k-d tree.

1 Like