Data Structure Learning Series for Competitive Programming

Hi all, Welcome to the Data Structure Learning Series for Competitive Programming, here we will be sharing all the material's and Codeforces Practice Problem Contest based on discussed topic for you to learn and Practice Problem Solving. Every week a new topic will be released with all the material and Practice Problem sets and you will have a week to study and solve them.

Started on Monday - 7th September 2020





Image Src: Google

The different types of data structure which we shared will be discussing here are,

Basic Data Structures
  • Arrays

  • Stack and Queue



  • Trees
    • Introduction to Trees
    • Binary Tree
    • Binary Search Tree
    • Balanced Binary Search Tree / AVL Tree
Advanced-Data Structures
  • Heap
  • Priority Queue
  • Trie Data Structure
  • Binary Indexed Tree / Fenwick Tree
  • Segment Tree
    • 1D Segment Tree
    • 2D Segment Tree 
    • 3D Segment Tree
  • Suffix Trees
  • Suffix Arrays
Note: Implementations are in C++
All these topics will be discussed in detail in coming articles. Every topic will have a practice problem set and some solved problems from Codeforces, CodeChef, HackerEarth, etc.

If you have some content OR material related to this OR we have missed something then do share them through the comment section for which we will be thankful to you.

Thank You
With 💙 by Learn DSA