{"id":23773001,"url":"https://github.com/mdalamin5/secondstepto-dsa","last_synced_at":"2026-04-02T08:30:17.011Z","repository":{"id":269458038,"uuid":"907477582","full_name":"MDalamin5/SecondStepTo-DSA","owner":"MDalamin5","description":"SecondStepTo-DSA is a comprehensive journey through Data Structures and Algorithms (DSA). This repository features organized implementations, problem-solving solutions, and detailed explorations of core concepts. Aimed at sharpening skills, it covers topics from basics to advanced, helping coders level up their understanding and mastery of DSA.","archived":false,"fork":false,"pushed_at":"2025-02-10T14:27:50.000Z","size":770,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-21T05:15:39.591Z","etag":null,"topics":["bellman-ford-algorithm","bfs","binary-search-tree","cpp-oop","dfs","dijkstra-algorithm","dynamic-programming","graph-algorithms","greedy-algorithms","heap","knapsack-problem","linked-list","queue","sorting-algorithms","stack","warshall-algorithm"],"latest_commit_sha":null,"homepage":"https://www.linkedin.com/in/mdalamin5/","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/MDalamin5.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":"2024-12-23T17:07:44.000Z","updated_at":"2025-02-10T14:27:53.000Z","dependencies_parsed_at":"2025-01-08T17:48:29.482Z","dependency_job_id":"50bfa1a4-8a96-4dca-bd37-639da6200291","html_url":"https://github.com/MDalamin5/SecondStepTo-DSA","commit_stats":null,"previous_names":["mdalamin5/secondstepto-dsa"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MDalamin5%2FSecondStepTo-DSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MDalamin5%2FSecondStepTo-DSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MDalamin5%2FSecondStepTo-DSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MDalamin5%2FSecondStepTo-DSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MDalamin5","download_url":"https://codeload.github.com/MDalamin5/SecondStepTo-DSA/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239958308,"owners_count":19724926,"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":["bellman-ford-algorithm","bfs","binary-search-tree","cpp-oop","dfs","dijkstra-algorithm","dynamic-programming","graph-algorithms","greedy-algorithms","heap","knapsack-problem","linked-list","queue","sorting-algorithms","stack","warshall-algorithm"],"created_at":"2025-01-01T05:21:48.593Z","updated_at":"2026-04-02T08:30:16.958Z","avatar_url":"https://github.com/MDalamin5.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SecondStepTo-DSA  \n\nWelcome to **SecondStepTo-DSA**! This repository documents my journey as I revisit and practice fundamental concepts in Data Structures and Algorithms (DSA). Through this, I aim to sharpen my problem-solving skills and deepen my understanding of these core topics.  \n\n## Contents  \n\n1. **Data Structures**  \n    - Arrays  \n    - Linked Lists  \n    - Stacks  \n    - Queues  \n    - Trees  \n    - Graphs  \n    - Hash Maps and Hash Tables  \n\n2. **Algorithms**  \n    - Searching and Sorting  \n    - Recursion and Backtracking  \n    - Dynamic Programming  \n    - Greedy Algorithms  \n    - Graph Algorithms  \n    - Divide and Conquer  \n\n3. **Problem-Solving Practice**  \n    - Problems from platforms like [LeetCode](https://leetcode.com), [Codeforces](https://codeforces.com), [HackerRank](https://hackerrank.com), and more.  \n\n## Getting Started  \n\nFeel free to explore the repository. Each topic is organized in its respective folder with explanations and implementations in Python (or other languages as required).  \n\n### Prerequisites  \n\n- Basic knowledge of programming.  \n- A working installation of Python (or preferred programming language).  \n\n## How to Use  \n\n1. Clone this repository:  \n   ```bash\n   git clone https://github.com/your-username/SecondStepTo-DSA.git\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmdalamin5%2Fsecondstepto-dsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmdalamin5%2Fsecondstepto-dsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmdalamin5%2Fsecondstepto-dsa/lists"}