{"id":24232589,"url":"https://github.com/theleopard65/my-dsa-journey","last_synced_at":"2026-05-07T22:35:43.181Z","repository":{"id":271422998,"uuid":"912801483","full_name":"TheLeopard65/MY-DSA-JOURNEY","owner":"TheLeopard65","description":"This repository is a comprehensive collection of my work and understanding as I go through various DSA topics. I created this repo to document and showcase the concepts, implementations, and problem-solving techniques I learn throughout my journey.","archived":false,"fork":false,"pushed_at":"2025-02-17T18:30:29.000Z","size":125,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-17T19:35:47.570Z","etag":null,"topics":["array","c","cpp","dsa","graph","library","linked-list","merge-sort","queue","recursi","sorting","stack","strings","time-complexity","tree","use-cases","vector"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/TheLeopard65.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"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}},"created_at":"2025-01-06T12:26:35.000Z","updated_at":"2025-02-17T18:30:32.000Z","dependencies_parsed_at":"2025-01-07T17:49:42.887Z","dependency_job_id":"1b5995b6-f799-4ad1-b967-7854e3c2fa9e","html_url":"https://github.com/TheLeopard65/MY-DSA-JOURNEY","commit_stats":null,"previous_names":["theleopard65/my-dsa-journey"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheLeopard65%2FMY-DSA-JOURNEY","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheLeopard65%2FMY-DSA-JOURNEY/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheLeopard65%2FMY-DSA-JOURNEY/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheLeopard65%2FMY-DSA-JOURNEY/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TheLeopard65","download_url":"https://codeload.github.com/TheLeopard65/MY-DSA-JOURNEY/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241851322,"owners_count":20030962,"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","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":["array","c","cpp","dsa","graph","library","linked-list","merge-sort","queue","recursi","sorting","stack","strings","time-complexity","tree","use-cases","vector"],"created_at":"2025-01-14T15:44:34.052Z","updated_at":"2026-05-07T22:35:38.157Z","avatar_url":"https://github.com/TheLeopard65.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leopard's DSA Learning Journey\n\nWelcome to my **Data Structures and Algorithms (DSA) Learning Journey**! This repository is a comprehensive collection of my work and understanding as I go through various DSA topics. I created this repo to document and showcase the concepts, implementations, and problem-solving techniques I learn throughout my journey.\n\n### Contents\n\nThis repository covers the following important topics in DSA:\n\n1. **Time Complexity**: Learn about different time complexities like Constant, Logarithmic, Linear, Quadratic, etc., and how they affect algorithm efficiency.\n\n2. **Arrays**: Basic and advanced operations on arrays, including 1D and 2D arrays and their manipulation.\n\n3. **Strings**: Working with strings, including common string manipulation algorithms and libraries.\n\n4. **Linked Lists**: Covers singly linked lists, doubly linked lists, circular linked lists, and related operations.\n\n5. **Stacks**: Stack implementation using arrays and linked lists. Includes finite and infinite stacks.\n\n6. **Queues**: Covers circular queues, linear queues, and priority queues, all implemented using arrays and linked lists.\n\n7. **Vectors**: Dynamic and static vector implementations, including multidimensional vectors.\n\n8. **Recursion**: Examples of different types of recursion like tail recursion, non-tail recursion, and indirect recursion.\n\n9. **Trees**: Binary trees, AVL trees, and Binary Search Trees (BST), along with common operations like traversal and insertion.\n\n10. **Graphs**: Graph data structure, along with BFS, DFS, and Dijkstra's algorithm for directed and undirected graphs.\n\n11. **Hash Maps**: Implementation of hash maps using techniques like separate chaining, linear probing, quadratic probing, and double hashing.\n\n12. **Sorting Algorithms**: Implementations of common sorting algorithms like Bubble Sort, Selection Sort, Quick Sort, Merge Sort, etc.\n\n### Structure of the Repository\n\nThe repository is organized as follows:\n\n```\n.\n├── 1.Complexity-Analysis    # Understanding Time \u0026 Space Complexity\n├── 2.Array                  # Array implementations and problems\n├── 3.Strings                # String manipulation techniques\n├── 4.Linked-Lists           # Linked List implementations\n├── 5.Stack                  # Stack implementations (finite, infinite, etc.)\n├── 6.Queue                  # Queue implementations (linear, circular, priority)\n├── 7.Vector                 # Vector (dynamic/static) implementations\n├── 8.Recursion              # Recursion concepts and examples\n├── 9.Trees                  # Tree data structures (Binary Tree, BST, AVL, B-Tree, Heap, Trie, etc.)\n├── 10.Graphs                # Graph algorithms (BFS, DFS, Dijkstra, etc.)\n├── 11.Hash-Maps             # Hash Map implementations (linear probing, separate chaining, etc.)\n├── 12.Bubble-Sort           # Bubble sort implementations\n├── 13.Selection-Sort        # Selection sort implementations\n├── 14.Quick-Sort            # Quick sort implementations\n├── 15.Merge-Sort            # Merge sort implementations\n└── LICENSE                  # Repository License\n```\n\n### How to Use\n\n1. Clone this repository to your local machine using:\n    ```bash\n    git clone https://github.com/TheLeopard65/MY-DSA-JOURNEY.git\n    ```\n\n2. Navigate into the directory you are interested in.\n\n3. Read the `README.md` in each folder for detailed explanations of the concepts and the implementations in each file.\n\n4. Run the individual programs to see the algorithms in action.\n\n5. Open the codes in VS-Code/nano/vim or any editor of your choice to learn from the code.\n\n### Contribution\n\nI will be continuously updating this repository as I learn new concepts. If you have any suggestions, improvements, or corrections, feel free to create an issue or submit a pull request.\n\n### License\n\nThis Repository is open-source and available under the [MIT License](LICENSE). Feel free to use it for your Learning!\n\n---\n\nHappy Learning! ✨\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheleopard65%2Fmy-dsa-journey","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheleopard65%2Fmy-dsa-journey","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheleopard65%2Fmy-dsa-journey/lists"}