{"id":19944019,"url":"https://github.com/hiteshpatil2005/data-structures-algorithm","last_synced_at":"2026-02-23T11:38:33.816Z","repository":{"id":245094367,"uuid":"817427977","full_name":"hiteshpatil2005/Data-Structures-Algorithm","owner":"hiteshpatil2005","description":"Welcome to the DSA Repository👨🏻‍💻! This repository contains a comprehensive collection of code examples, implementations, and explanations for various Data Structures and Algorithms (DSA). Whether you're a beginner looking to learn the basics or an experienced programmer wanting to brush up on your skills, this repository has something for you.","archived":false,"fork":false,"pushed_at":"2025-06-09T04:08:46.000Z","size":1501,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-23T16:47:30.414Z","etag":null,"topics":["algorithms","applications","c","dsa-learning-series","java"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hiteshpatil2005.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":"Roadmap/DSA Roadmap.pdf","authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-06-19T17:25:16.000Z","updated_at":"2025-06-09T04:08:50.000Z","dependencies_parsed_at":"2024-09-14T04:25:04.738Z","dependency_job_id":"6694bf72-a5ee-42e3-bcbb-89abab0783d1","html_url":"https://github.com/hiteshpatil2005/Data-Structures-Algorithm","commit_stats":null,"previous_names":["hiteshpatil2005/data-structures-algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hiteshpatil2005/Data-Structures-Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiteshpatil2005%2FData-Structures-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiteshpatil2005%2FData-Structures-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiteshpatil2005%2FData-Structures-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiteshpatil2005%2FData-Structures-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hiteshpatil2005","download_url":"https://codeload.github.com/hiteshpatil2005/Data-Structures-Algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiteshpatil2005%2FData-Structures-Algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29741670,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-23T07:44:07.782Z","status":"ssl_error","status_checked_at":"2026-02-23T07:44:07.432Z","response_time":90,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithms","applications","c","dsa-learning-series","java"],"created_at":"2024-11-13T00:18:48.688Z","updated_at":"2026-02-23T11:38:33.791Z","avatar_url":"https://github.com/hiteshpatil2005.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003e\n    \u003cimg src=\"https://readme-typing-svg.herokuapp.com/?font=Righteous\u0026size=35\u0026center=true\u0026color=c8f707\u0026vCenter=true\u0026width=500\u0026height=70\u0026duration=4000\u0026lines=Data+Structures+Algorithms\"/\u003e\n\u003c/h1\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://t3.ftcdn.net/jpg/06/39/58/36/240_F_639583664_nAQdlXn0MEilgL6Kf6jOJQ9d3UpxXEpm.jpg\" alt=\"DSA Repository\" width =\"1000\" height=\"300\"\u003e\n\u003c/p\u003e\n\nWelcome to the DSA Repository📈! This repository contains various Data Structures and Algorithms implementations in different programming languages. Whether you are a beginner looking to understand the basics or an advanced learner aiming to refine your skills, this repository has something for everyone.\u003cbr\u003e\n### Languages 💡\n\n![Java](https://img.shields.io/badge/java-%23ED8B00.svg?style=for-the-badge\u0026logo=openjdk\u0026logoColor=white)\n![C](https://img.shields.io/badge/c-%2300599C.svg?style=for-the-badge\u0026logo=c\u0026logoColor=white)\n\n### Repository Strucutre 📂📂\n```\nData-Structures-Repository\n├── C\n│   ├── Linked_List\n│   │   ├── Doubly_linked_list\n│   │   │   └── Doubly_linked_list_program.c\n│   │   ├── Singly_Linked_List\n│   │   │   ├── Simple_linked_list.c\n│   │   │   └── Singly_linked_list.c\n│   │   └── Stack_using_singly_link_list.c\n│   ├── Queue\n│   │   ├── Circular_queue.c\n│   │   └── Queue_operation.c\n│   ├── Searching\n│   │   ├── Binary_search.c\n│   │   └── Linear_search.c\n│   ├── Sorting Algorithms\n│   │   ├── Bubble_sort.c\n│   │   ├── Insertion_sort.c\n│   │   └── Selection_sort.c\n│   └── Stack\n│       ├── applications_of_stack\n│       └── stack_operations.c\n├── Java\n│   ├── Graphs\n│   │   ├── BFS.java\n│   │   ├── DFS.java\n│   │   ├── Dijkstra.java\n│   │   ├── Graph.java\n│   │   ├── Kruskal.java\n│   │   └── Prims_Algorithm.java\n│   ├── Hash Table\n│   │   ├── Chaining.java\n│   │   └── HashTable.java\n│   ├── Heap\n│   │   ├── HeapSort.java\n│   │   └── PriorityQueue.java\n│   └── Trees\n│       ├── BinarySearchTree.java\n│       ├── BinaryTree.java\n│       └── HuffmanTree.java\n├── Roadmap\n│   └── DSA Roadmap.pdf\n├── img\n└── README.md\n```\n\n  \n## Table of Contents ⬇️⬇️\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eSearching Algorithm\u003c/td\u003e\n    \u003ctd\u003e1. Linear Search \u003cbr\u003e 2. Binary Search\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eSorting Algorithm\u003c/td\u003e\n    \u003ctd\u003e1. Bubble Sort \u003cbr\u003e 2. Insertion Sort \u003cbr\u003e 3. Selection Sort\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eStack\u003c/td\u003e\n    \u003ctd\u003eStack Operations :\u003cbr\u003e 1. Push \u003cbr\u003e 2. Pop \u003cbr\u003e 3. Peek \u003cbr\u003e 4. Display\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eStack Applications\u003c/td\u003e\n    \u003ctd\u003e1. Balancing of Parenthesis \u003cbr\u003e2. Decimal to Binary conversion \u003cbr\u003e 3. Evaluation of Postfix operation\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eQueue\u003c/td\u003e\n    \u003ctd\u003e1. Queue Operations \u003cbr\u003e 2. Circular Queue\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eLink List\u003c/td\u003e\n    \u003ctd\u003e1. Singly Link List \u003cbr\u003e 2. Doubly Link List\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eTrees\u003c/td\u003e\n    \u003ctd\u003e1. Binary tree operations \u003cbr\u003e 2. Binary Search Tree Operations \u003cbr\u003e 3. Huffman Implementation\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eGraphs\u003c/td\u003e\n    \u003ctd\u003e1. Graph Implementation \u003cbr\u003e 2. Kruskal Algorithm \u003cbr\u003e 3. Prims Algorithm \u003cbr\u003e 4. Breath First Search(BFS) \u003cbr\u003e 5. Depth First Search(DFS) \u003cbr\u003e 6. Dijkstra's Algorithm \u003c/td\u003e\n  \u003c/tr\u003e\n     \u003ctr\u003e\n    \u003ctd\u003eHash Table\u003c/td\u003e\n    \u003ctd\u003e1. Hash Table(Linear Probing) \u003cbr\u003e 2. Chaining \u003c/td\u003e\n  \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003eHeap\u003c/td\u003e\n    \u003ctd\u003e1. Heap Sort \u003cbr\u003e 2. Priority Queue \u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n\n\n## How to Contribute\nWe welcome contributions from the community! If you have an algorithm or data structure that you would like to add, please:\n1. Fork the repository\n2. Create a new branch (`git checkout -b feature/your-feature`)\n3. Commit your changes (`git commit -m 'Add some feature'`)\n4. Push to the branch (`git push origin feature/your-feature`)\n5. Create a new Pull Request\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://github.com/hiteshpatil2005/hiteshpatil2005/blob/main/Assest/HourStorm.gif\"\u003e\n\u003c/p\u003e\n\u003ch1 align=\"center\"\u003e\n    \u003cimg src=\"https://readme-typing-svg.herokuapp.com/?font=Righteous\u0026size=35\u0026color=c8f707\u0026center=true\u0026vCenter=true\u0026width=500\u0026height=70\u0026duration=4000\u0026lines=😊+HAPPY+CODING+😊\"/\u003e\n\u003c/h1\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhiteshpatil2005%2Fdata-structures-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhiteshpatil2005%2Fdata-structures-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhiteshpatil2005%2Fdata-structures-algorithm/lists"}