{"id":20924504,"url":"https://github.com/md-imtiaz-hossain/50-days_dsa_java_leetcode_practice_part-01","last_synced_at":"2026-05-25T18:03:02.321Z","repository":{"id":212985432,"uuid":"729459842","full_name":"Md-Imtiaz-Hossain/50-Days_DSA_Java_LeetCode_Practice_Part-01","owner":"Md-Imtiaz-Hossain","description":"50 Days DSA Challeng with Java and practice with LeetCode","archived":false,"fork":false,"pushed_at":"2024-01-11T16:35:00.000Z","size":14653,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-26T07:47:36.730Z","etag":null,"topics":["50daysofcode","algorithm","data-structures","dsa","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/Md-Imtiaz-Hossain.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2023-12-09T09:52:45.000Z","updated_at":"2023-12-21T03:03:48.000Z","dependencies_parsed_at":"2024-01-11T19:56:39.306Z","dependency_job_id":"f620e357-27a0-481d-a763-896160f4a29d","html_url":"https://github.com/Md-Imtiaz-Hossain/50-Days_DSA_Java_LeetCode_Practice_Part-01","commit_stats":null,"previous_names":["md-imtiaz-hossain/50-days_dsa_java_leetcode_practice_part-01"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Md-Imtiaz-Hossain/50-Days_DSA_Java_LeetCode_Practice_Part-01","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Md-Imtiaz-Hossain%2F50-Days_DSA_Java_LeetCode_Practice_Part-01","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Md-Imtiaz-Hossain%2F50-Days_DSA_Java_LeetCode_Practice_Part-01/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Md-Imtiaz-Hossain%2F50-Days_DSA_Java_LeetCode_Practice_Part-01/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Md-Imtiaz-Hossain%2F50-Days_DSA_Java_LeetCode_Practice_Part-01/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Md-Imtiaz-Hossain","download_url":"https://codeload.github.com/Md-Imtiaz-Hossain/50-Days_DSA_Java_LeetCode_Practice_Part-01/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Md-Imtiaz-Hossain%2F50-Days_DSA_Java_LeetCode_Practice_Part-01/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33486787,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-25T14:31:05.219Z","status":"ssl_error","status_checked_at":"2026-05-25T14:31:02.878Z","response_time":57,"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":["50daysofcode","algorithm","data-structures","dsa","java"],"created_at":"2024-11-18T20:22:47.492Z","updated_at":"2026-05-25T18:03:02.295Z","avatar_url":"https://github.com/Md-Imtiaz-Hossain.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"**Here's a comprehensive explanation of data structures and algorithms:**\n\n## **Data Structures:**\n\n* **Definition:** A data structure is a way of organizing and storing data in a computer so that it can be accessed and modified efficiently. It's like a blueprint for how data is arranged in memory.\n* **Purpose:** They provide efficient ways to manage and manipulate data, enabling a wide range of operations like searching, sorting, inserting, deleting, and more.\n* **Examples:**\n    - **Arrays:** Ordered collections of elements of the same data type, accessed using an index.\n    - **Linked Lists:** Sequences of elements linked together with pointers, allowing flexible insertion and deletion.\n    - **Stacks:** Last-in, first-out (LIFO) structures, like a stack of plates.\n    - **Queues:** First-in, first-out (FIFO) structures, like a line at a store.\n    - **Trees:** Hierarchical structures with a root node and child nodes, useful for representing relationships and searching.\n    - **Graphs:** Networks of nodes and edges, used to model connections and relationships.\n    - **Hash Tables:** Dictionaries that store key-value pairs, providing fast lookups based on keys.\n\n## **Algorithms:**\n\n* **Definition:** An algorithm is a set of instructions or steps to solve a specific problem or perform a task. It's like a recipe or a detailed plan.\n* **Purpose:** Algorithms provide the logic for how to manipulate and process data within data structures to achieve desired outcomes.\n* **Examples:**\n    - **Searching Algorithms:** Finding a specific element in a data set (e.g., linear search, binary search)\n    - **Sorting Algorithms:** Arranging elements in a specific order (e.g., bubble sort, insertion sort, merge sort, quick sort)\n    - **Graph Algorithms:** Finding shortest paths, detecting cycles, or solving network flow problems.\n    - **String Algorithms:** Pattern matching, text compression, or text editing.\n    - **Mathematical Algorithms:** Performing numerical computations or solving mathematical problems.\n\n## **Key Points:**\n\n* Data structures and algorithms are fundamental building blocks of computer science.\n* The choice of appropriate data structures and algorithms is crucial for efficient and scalable software development.\n* Understanding data structures and algorithms is essential for solving complex programming problems and designing efficient solutions.\n\n![Big O.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2FDSA_theory%2FBig%20O.png)\n![Big O 1.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2FDSA_theory%2FBig%20O%201.png)\n\n## Day 01\n![Day 01.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_01%2FDay%2001.png)\n\n## Day 02\n![Day 02.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_02%2FDay%2002.png)\n\n## Day 03\n![Day 03.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_03%2FDay%2003.png)\n\n## Day 04\n![Day 04.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_04%2FDay%2004.png)\n\n## Day 05\n![Day 05.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_05%2FDay%2005.png)\n\n## Day 06\n![Day 06.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_06%2FDay%2006.png)\n\n## Day 07\n![Day 07.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_07%2FDay%2007.png)\n\n## Day 08\n![Day 08.png](..%2FDay%2008.png)\n\n## Day 09\n![Day 09.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_09%2FDay%2009.png)\n\n## Day 10\n![Day 10.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_10%2FDay%2010.png)\n\n## Day 11\n![Day 11.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_11%2FDay%2011.png)\n\n## Day 12\n![Day 12.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_12%2FDay%2012.png)\n\n## Day 13\n![Day 13.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_13%2FDay%2013.png)\n\n## Day 14\n![Day 14.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_14%2FDay%2014.png)\n\n## Day 15\n![Day 15.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_15%2FDay%2015.png)\n\n## Day 16\n![Day 16.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_16%2FDay%2016.png)\n\n## Day 17\n![Day 17.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_17%2FDay%2017.png)\n\n## Day 18\n![Day 18.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_18%2FDay%2018.png)\n\n## Day 19\n![](src/main/java/com/iimtiaz/day_19/Day 19.png)\n\n## Day 20\n![](src/main/java/com/iimtiaz/day_20/Day 20.png)\n\n## Day 21\n![day 21.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_21%2Fday%2021.png)\n\n## Day 22\n![Day 22.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_22%2FDay%2022.png)\n\n## Day 23\n![day 23.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_23%2Fday%2023.png)\n\n## Day 24\n![Day 24.png](src%2Fmain%2Fjava%2Fcom%2Fiimtiaz%2Fday_24%2FDay%2024.png)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmd-imtiaz-hossain%2F50-days_dsa_java_leetcode_practice_part-01","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmd-imtiaz-hossain%2F50-days_dsa_java_leetcode_practice_part-01","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmd-imtiaz-hossain%2F50-days_dsa_java_leetcode_practice_part-01/lists"}