{"id":31572252,"url":"https://github.com/robocraftyt01/data-structure","last_synced_at":"2025-10-05T13:50:39.349Z","repository":{"id":312427131,"uuid":"1047468211","full_name":"RoBoCRAFTYT01/data-structure","owner":"RoBoCRAFTYT01","description":"Learning Data Structure using JavaScript","archived":false,"fork":false,"pushed_at":"2025-10-01T23:07:41.000Z","size":72,"stargazers_count":3,"open_issues_count":1,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-10-02T01:08:53.346Z","etag":null,"topics":["bigonotation","clanguage","java","javascript","leetcode-solutions","notion","problem-solving","space-complexity","stacks","time-complexity","typescript"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"unlicense","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/RoBoCRAFTYT01.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-08-30T13:44:08.000Z","updated_at":"2025-10-01T23:08:43.000Z","dependencies_parsed_at":"2025-08-30T15:26:50.822Z","dependency_job_id":"8d4d9f4b-ff00-4424-82ea-c643667e26d9","html_url":"https://github.com/RoBoCRAFTYT01/data-structure","commit_stats":null,"previous_names":["robocraftyt01/datatastructure","robocraftyt01/data-structure"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/RoBoCRAFTYT01/data-structure","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RoBoCRAFTYT01%2Fdata-structure","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RoBoCRAFTYT01%2Fdata-structure/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RoBoCRAFTYT01%2Fdata-structure/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RoBoCRAFTYT01%2Fdata-structure/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RoBoCRAFTYT01","download_url":"https://codeload.github.com/RoBoCRAFTYT01/data-structure/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RoBoCRAFTYT01%2Fdata-structure/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":278464272,"owners_count":25991177,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-05T02:00:06.059Z","response_time":54,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["bigonotation","clanguage","java","javascript","leetcode-solutions","notion","problem-solving","space-complexity","stacks","time-complexity","typescript"],"created_at":"2025-10-05T13:50:38.236Z","updated_at":"2025-10-05T13:50:39.340Z","avatar_url":"https://github.com/RoBoCRAFTYT01.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 📚 Data Structure Repository\n\n[![Made with TypeScript](https://img.shields.io/badge/Made%20with-TypeScript-3178C6?style=for-the-badge\u0026logo=typescript\u0026logoColor=white)](https://www.typescriptlang.org/)  \n[![License: Unlicense](https://img.shields.io/badge/license-Unlicense-blue?style=for-the-badge)](LICENSE)  \n\nWelcome to the Data Structure Learning Repository 🚀 \u003cbr /\u003e\nThis repo contains implementations, notes, and exercises on data structures and algorithms to help strengthen your computer science foundation.\n\n## 🔗 Resources\n- [📓 Notion Document](https://www.notion.so/Data-Structure-2521bcd19f56804fb107cc70220d46c3?source=copy_link)\n- [🎥 YouTube Video (Free Course)](https://www.youtube.com/watch?v=RBSGKlAvoiM)\n- [🎓 Udemy Course – JS Algorithms \u0026 Data Structures Masterclass](https://www.udemy.com/course/js-algorithms-and-data-structures-masterclass/)\n    - [Slides](https://cs.slides.com/colt_steele)\n- [🧩 LeetCode Profile](https://leetcode.com/u/RoBoCRR/)\n\n## 📝 Exercises\n- [**LeetCode Solutions**](/Exercice/)\n\n## 📖 Courses\n- [**Introduction to Big-O**](/Courses/BigONotation/)\n- [**Problem Solving**](/Courses/ProblemSolving/)\n    - [**Approach**](/Courses/ProblemSolving/Approach/)\n    - [**Patterns**](/Courses/ProblemSolving/Patterns/)\n- [**Dynamic and Static Arrays**](/Courses/Static\u0026DynamicArray/)\n    - [Dynamic Array Code](/Courses/Static\u0026DynamicArray/source.java)\n- [**Linked Lists Introduction**](/Courses/LinkedList/)\n\n[**Doubly Linked List Code**](/Courses/LinkedList/source.java)\n\n- [**Stack Introduction**](/Courses/Stack/)\n    - [Stack Implementation](/Courses/Stack/problem.ts)\n    - Stack Code\n- **Queue Introduction**\n    - Queue Implementation\n    - Queue Code\n- **Priority Queue Introduction**\n    - Priority Queue Min Heaps and Max Heaps\n    - Priority Queue Inserting Elements\n    - Priority Queue Removing Elements\n    - Priority Queue Code\n- **Union Find Introduction**\n    - Union Find Kruskal's Algorithm\n    - Union Find - Union and Find Operations\n    - Union Find Path Compression\n    - Union Find Code\n- **Binary Search Tree Introduction**\n    - Binary Search Tree Insertion\n    - Binary Search Tree Removal\n    - Binary Search Tree Traversals\n    - Binary Search Tree Code\n- **Hash Table**\n    - Hash table hash function\n    - Hash table separate chaining\n    - Hash table separate chaining source code\n    - Hash table open addressing\n    - Hash table linear probing\n    - Hash table quadratic probing\n    - Hash table double hashing\n    - Hash table open addressing removing\n    - Hash table open addressing code\n- **Fenwick Tree**\n    - Fenwick Tree range queries\n    - Fenwick Tree point updates\n    - Fenwick Tree construction\n    - Fenwick tree source code\n- **Suffix Array**\n    - Suffix Array introduction\n    - Longest Common Prefix (LCP) array\n    - Suffix array finding unique substrings\n    - Longest common substring problem suffix array\n    - Longest common substring problem suffix array part 2\n    - Longest Repeated Substring suffix array\n- **Balanced Binary Search Tree Rotations**\n- **AVL Tree**\n    - AVL tree insertion\n    - AVL tree removals\n    - AVL tree source code\n- **Indexed Priority Queue | Data Structure**\n    - Indexed Priority Queue | Data Structure\n    - Indexed Priority Queue | Data Structure | Source Code\n\n## 🛠️ Project Structure\n```bash\n📂 Courses\n ┣ 📂 BigONotation\n ┣ 📂 ProblemSolving\n ┣ 📂 Static\u0026DynamicArray\n ┣ 📂 LinkedList\n ┣ 📂 Stack\n ┗ … (more coming)\n📂 Exercice\n ┣ 📂 Easy\n ┣ 📂 Medium\n ┗ 📂 Hard\n```\n\n# 🚀 Getting Started\n\n## Clone the repo\n```bash\ngit clone https://github.com/RoBoCRAFTYT01/data-structure.git\ncd data-structure\n```\n\n## Install dependencies (choose one)\n```bash\n# Using bun\nbun install\n\n# Using npm\nnpm install\n\n# Using pnpm\npnpm install\n```\n\n## Build\n```bash\n# Using bun\nbun run build\n\n# Using npm\nnpm run build\n\n# Using pnpm\npnpm run build\n```\n\n## Run tests\n```bash\nbun test\n# or\nnpm test\n# or\npnpm test\n```\n\n# 🧑‍💻 Author\n**RoBo** – Full Stack Web Developer \u003cbr /\u003e\n- [🔗 GitHub Profile](https://github.com/RoBoCRAFTYT01/) \n- [🔗 npm Profile](https://www.npmjs.com/~robo._.159)\n\n# 🤝 Contributing\n**Contributions are welcome! 🎉**\nIf you’d like to improve code, add explanations, or suggest exercises:\n\n1. Fork the repo\n\n2. Create a branch (`git checkout -b feature-xyz`)\n\n3. Commit your changes (`git commit -m \"Added xyz\"`)\n\n4. Push to your branch (`git push origin feature-xyz`)\n\n5. Open a Pull Request\n\n[Read more →](/CONTRIBUTING.md)\n\n# 📜 License\nThis project is licensed under [**The Unlicense**](https://unlicense.org/) – free and open forever.\nYou are free to use, modify, and distribute this project without restriction.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobocraftyt01%2Fdata-structure","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frobocraftyt01%2Fdata-structure","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobocraftyt01%2Fdata-structure/lists"}