https://github.com/robocraftyt01/data-structure

Learning Data Structure using JavaScript
https://github.com/robocraftyt01/data-structure

bigonotation clanguage java javascript leetcode-solutions notion problem-solving space-complexity stacks time-complexity typescript

Last synced: 2 months ago
JSON representation

Learning Data Structure using JavaScript

• Host: GitHub
• URL: https://github.com/robocraftyt01/data-structure
• Owner: RoBoCRAFTYT01
• License: unlicense
• Created: 2025-08-30T13:44:08.000Z (4 months ago)
• Default Branch: main
• Last Pushed: 2025-10-01T23:07:41.000Z (3 months ago)
• Last Synced: 2025-10-02T01:08:53.346Z (3 months ago)
• Topics: bigonotation, clanguage, java, javascript, leetcode-solutions, notion, problem-solving, space-complexity, stacks, time-complexity, typescript
• Language: Java
• Homepage:
• Size: 70.3 KB
• Stars: 3
• Watchers: 0
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • Contributing: CONTRIBUTING.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# 📚 Data Structure Repository

[![Made with TypeScript](https://img.shields.io/badge/Made%20with-TypeScript-3178C6?style=for-the-badge&logo=typescript&logoColor=white)](https://www.typescriptlang.org/)  

[![License: Unlicense](https://img.shields.io/badge/license-Unlicense-blue?style=for-the-badge)](LICENSE)  

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](https://www.notion.so/Data-Structure-2521bcd19f56804fb107cc70220d46c3?source=copy_link)

- [🎥 YouTube Video (Free Course)](https://www.youtube.com/watch?v=RBSGKlAvoiM)

- [🎓 Udemy Course – JS Algorithms & Data Structures Masterclass](https://www.udemy.com/course/js-algorithms-and-data-structures-masterclass/)

    - [Slides](https://cs.slides.com/colt_steele)

- [🧩 LeetCode Profile](https://leetcode.com/u/RoBoCRR/)

## 📝 Exercises

- [**LeetCode Solutions**](/Exercice/)

## 📖 Courses

- [**Introduction to Big-O**](/Courses/BigONotation/)

- [**Problem Solving**](/Courses/ProblemSolving/)

    - [**Approach**](/Courses/ProblemSolving/Approach/)

    - [**Patterns**](/Courses/ProblemSolving/Patterns/)

- [**Dynamic and Static Arrays**](/Courses/Static&DynamicArray/)

    - [Dynamic Array Code](/Courses/Static&DynamicArray/source.java)

- [**Linked Lists Introduction**](/Courses/LinkedList/)

[**Doubly Linked List Code**](/Courses/LinkedList/source.java)

- [**Stack Introduction**](/Courses/Stack/)

    - [Stack Implementation](/Courses/Stack/problem.ts)

    - 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

```bash

📂 Courses

 ┣ 📂 BigONotation

 ┣ 📂 ProblemSolving

 ┣ 📂 Static&DynamicArray

 ┣ 📂 LinkedList

 ┣ 📂 Stack

 ┗ … (more coming)

📂 Exercice

 ┣ 📂 Easy

 ┣ 📂 Medium

 ┗ 📂 Hard

```

# 🚀 Getting Started

## Clone the repo

```bash

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

cd data-structure

```

## Install dependencies (choose one)

```bash

# Using bun

bun install

# Using npm

npm install

# Using pnpm

pnpm install

```

## Build

```bash

# Using bun

bun run build

# Using npm

npm run build

# Using pnpm

pnpm run build

```

## Run tests

```bash

bun test

# or

npm test

# or

pnpm test

```

# 🧑‍💻 Author

**RoBo** – Full Stack Web Developer 


- [🔗 GitHub Profile](https://github.com/RoBoCRAFTYT01/) 

- [🔗 npm Profile](https://www.npmjs.com/~robo._.159)

# 🤝 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 →](/CONTRIBUTING.md)

# 📜 License

This project is licensed under [**The Unlicense**](https://unlicense.org/) – free and open forever.

You are free to use, modify, and distribute this project without restriction.