📚 Data Structure Repository

Welcome to the Data Structure Learning Repository 🚀
This repo contains implementations, notes, and exercises on data structures and algorithms to help strengthen your computer science foundation.

🔗 Resources

• 📓 Notion Document
• 📓 W3School Data Structures and Algorithms Document
• 🎥 YouTube Video (Free Course)
• 🎓 Udemy Course – JS Algorithms & Data Structures Masterclass
  • Slides
• 🧩 LeetCode Profile

📝 Exercises

• LeetCode Solutions

📖 Courses

• Introduction to Big-O
• Problem Solving
  • Approach
  • Patterns
• Dynamic and Static Arrays
  • Dynamic Array Code
• Linked Lists Introduction

Doubly Linked List Code

• Stack Introduction
  • Stack Implementation
  • Stack Code
• Queue Introduction
  • Queue Implementation
  • Queue Code
• Priority Queue Introduction
  • Priority Queue Min Heaps and Max Heaps
  • Priority Queue Inserting Elements
  • Priority Queue Removing Elements
  • Priority Queue Code
• Union Find Introduction
  • Union Find Kruskal's Algorithm
  • Union Find - Union and Find Operations
  • Union Find Path Compression
  • Union Find Code
• Binary Search Tree Introduction
  • Binary Search Tree Insertion
  • Binary Search Tree Removal
  • Binary Search Tree Traversals
  • Binary Search Tree Code
• Hash Table
  • Hash table hash function
  • Hash table separate chaining
  • Hash table separate chaining source code
  • Hash table open addressing
  • Hash table linear probing
  • Hash table quadratic probing
  • Hash table double hashing
  • Hash table open addressing removing
  • Hash table open addressing code
• Fenwick Tree
  • Fenwick Tree range queries
  • Fenwick Tree point updates
  • Fenwick Tree construction
  • Fenwick tree source code
• Suffix Array
  • Suffix Array introduction
  • Longest Common Prefix (LCP) array
  • Suffix array finding unique substrings
  • Longest common substring problem suffix array
  • Longest common substring problem suffix array part 2
  • Longest Repeated Substring suffix array
• Balanced Binary Search Tree Rotations
• AVL Tree
  • AVL tree insertion
  • AVL tree removals
  • AVL tree source code
• Indexed Priority Queue | Data Structure
  • Indexed Priority Queue | Data Structure
  • Indexed Priority Queue | Data Structure | Source Code

🛠️ Project Structure

📂 Courses
 ┣ 📂 BigONotation
 ┣ 📂 ProblemSolving
 ┣ 📂 Static&DynamicArray
 ┣ 📂 LinkedList
 ┣ 📂 Stack
 ┗ … (more coming)
📂 Exercice
 ┣ 📂 Easy
 ┣ 📂 Medium
 ┗ 📂 Hard

🚀 Getting Started

Clone the repo

git clone https://github.com/RoBoCRAFTYT01/data-structure.git
cd data-structure

Install dependencies (choose one)

# Using bun
bun install

# Using npm
npm install

# Using pnpm
pnpm install

Build

# Using bun
bun run build

# Using npm
npm run build

# Using pnpm
pnpm run build

Run tests

bun test
# or
npm test
# or
pnpm test

🧑‍💻 Author

RoBo – Full Stack Web Developer

• 🔗 GitHub Profile
• 🔗 npm Profile

🤝 Contributing

Contributions are welcome! 🎉 If you’d like to improve code, add explanations, or suggest exercises:

1. Fork the repo

2. Create a branch (git checkout -b feature-xyz)

3. Commit your changes (git commit -m "Added xyz")

4. Push to your branch (git push origin feature-xyz)

5. Open a Pull Request

Read more →

📜 License

This project is licensed under The Unlicense – free and open forever. You are free to use, modify, and distribute this project without restriction.