Skip to content

README.md

Latest commit

 

History

History
63 lines (57 loc) · 1.71 KB

README.md

File metadata and controls

63 lines (57 loc) · 1.71 KB
Raw

🚀 Advanced Data Structures & Algorithms Practice

This repository contains my solutions and detailed notes on Disjoint Set Union (DSU), Segment Trees, Binary Search, Suffix Arrays, and the Two Pointers technique. My goal is to build a personal library of clean, efficient implementations and learning resources.

📋 Table of Contents

📚 Topics Covered

  • DSU (Union-Find with path compression & union by rank)
  • Segment Tree (standard and lazy propagation)
  • Binary Search (classic, bounds, and “search on answer”)
  • Suffix Array (construction, LCP, and pattern matching)
  • Two Pointers (sliding window, pair-sum, subarray techniques)

📂 Repository Structure

Data-Structures-Algorithms/
├── DSU/
│   ├── Step - 1
│   ├── Step - 2
│   ├── Step - 3
│   └── Step - 4 
│
│
├── Segment_Tree/
|   ├── Part - 1
|   |      ├── Step - 1
|   |      ├── Step - 2
|   |      ├── Step - 3
|   |      └── Step - 4
│   └── Part - 2
|          ├── Step - 1
|          ├── Step - 2
|          ├── Step - 3
|          └── Step - 4
│
├── Binary_Search/
│   ├── Step - 1
│   ├── Step - 2
│   ├── Step - 3
|   ├── Step - 4
│   └── Step - 5 
│
│
├── Suffix_Array/
│   ├── Step - 1
│   ├── Step - 2
│   ├── Step - 3
|   ├── Step - 4
│   └── Step - 5 
│
│
├── Two_Pointers/
│   ├── Step - 1
│   ├── Step - 2
│   └── Step - 3
│
│
└── ReadMe