{"id":15134321,"url":"https://github.com/atomhudson/dsa","last_synced_at":"2025-10-23T09:31:29.050Z","repository":{"id":238895099,"uuid":"797381062","full_name":"atomhudson/DSA","owner":"atomhudson","description":"Data Structures and Algorithms","archived":false,"fork":false,"pushed_at":"2024-12-31T13:15:11.000Z","size":1793,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-30T17:38:33.998Z","etag":null,"topics":["dsa","dsa-algorithm","dsa-learning-series","dsa-practice","dsalgo","eclipse-ide","intellij-idea","java","java-8","jdk","jdk17","springtoolsuite"],"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/atomhudson.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":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-07T18:06:01.000Z","updated_at":"2024-12-31T13:15:15.000Z","dependencies_parsed_at":"2024-05-08T18:51:26.388Z","dependency_job_id":"4b51b31b-bf7c-44f8-a7a2-c38277e96320","html_url":"https://github.com/atomhudson/DSA","commit_stats":{"total_commits":45,"total_committers":2,"mean_commits":22.5,"dds":0.1333333333333333,"last_synced_commit":"8e9ea4f4d443032a6f8c631960161283d1eed464"},"previous_names":["atomhudson/dsa"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/atomhudson%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/atomhudson%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/atomhudson%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/atomhudson%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/atomhudson","download_url":"https://codeload.github.com/atomhudson/DSA/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":237807490,"owners_count":19369597,"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":["dsa","dsa-algorithm","dsa-learning-series","dsa-practice","dsalgo","eclipse-ide","intellij-idea","java","java-8","jdk","jdk17","springtoolsuite"],"created_at":"2024-09-26T05:04:27.963Z","updated_at":"2025-10-23T09:31:29.045Z","avatar_url":"https://github.com/atomhudson.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structures and Algorithms\n\nWelcome to the Data Structures and Algorithms (DSA) repository! This repository contains a collection of problems, solutions, and resources aimed at helping you strengthen your understanding and implementation skills in DSA. The content is designed for intermediate learners who have a basic understanding of programming and want to deepen their knowledge in DSA.\n\n## Contents\n\n- [Introduction](#introduction)\n- [Prerequisites](#prerequisites)\n- [Topics Covered](#topics-covered)\n  - [Data Structures](#data-structures)\n  - [Algorithms](#algorithms)\n\n[//]: # (- [Setup Instructions]\u0026#40;#setup-instructions\u0026#41;)\n\n[//]: # (- [Contributing]\u0026#40;#contributing\u0026#41;)\n\n[//]: # (- [License]\u0026#40;#license\u0026#41;)\n\n## Introduction\n\nThis repository is designed for individuals who have a basic grasp of programming and are looking to enhance their understanding of data structures and algorithms. The problems and solutions provided here will help you build a strong foundation in DSA, preparing you for technical interviews and advanced coursework.\n\n## Prerequisites\n\nTo get the most out of this repository, you should have:\n\n- Basic programming knowledge in a language like Java, Python, or Algorithm_and_Practice.C++\n- Understanding of basic programming concepts such as variables, loops, and conditionals\n- Familiarity with basic data structures (arrays, linked lists) and algorithms (sorting, searching)\n\n## Topics Covered\n\n### Data Structures\n\n1. **Arrays and Strings**\n   - Dynamic arrays and array manipulation\n   - String operations and pattern matching\n\n2. **Linked Lists**\n   - Singly linked lists\n   - Doubly linked lists\n   - Circular linked lists\n\n3. **Stacks and Queues**\n   - Stack operations and applications\n   - Queue operations and applications\n   - Priority queues and heap implementation\n\n\u003c!-- 4. **Trees and Graphs**\n   - Binary trees, binary search trees\n   - AVL trees, red-black trees\n   - Graph representations (adjacency matrix, adjacency list)\n   - Graph traversal algorithms (BFS, DFS)\n\n5. **Hashing**\n   - Hash tables and hash functions\n   - Collision resolution techniques\n\n6. **Heaps**\n   - Binary heaps\n   - Heap operations and applications\n--\u003e\n### Algorithms\n\n1. **Sorting Algorithms**\n   - Bubble sort, selection sort, insertion sort\n   - Merge sort, quick sort, heap sort\n   - Counting sort, radix sort, bucket sort\n\n2. **Searching Algorithms**\n   - Linear search, binary search\n   - Search algorithms in data structures (BST, hash table)\n\n3. **Recursion and Backtracking**\n   - Recursive algorithms and problems\n   - Backtracking algorithms and applications (N-Queens, Sudoku)\n\n\u003c!-- 4. **Dynamic Programming**\n   - Principles of dynamic programming\n   - Classic dynamic programming problems (Knapsack, LCS, LIS)\n\n5. **Greedy Algorithms**\n   - Principles of greedy algorithms\n   - Classic greedy problems (Activity Selection, Huffman Coding)\n\n6. **Graph Algorithms**\n   - Minimum spanning tree (Kruskal's, Prim's)\n   - Shortest path algorithms (Dijkstra's, Bellman-Ford, Floyd-Warshall)\n   - Network flow algorithms --\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fatomhudson%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fatomhudson%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fatomhudson%2Fdsa/lists"}