{"id":25089780,"url":"https://github.com/sarimmalik01/leetcode_reports","last_synced_at":"2026-02-11T03:02:38.576Z","repository":{"id":226716727,"uuid":"769138307","full_name":"SarimMalik01/Leetcode_reports","owner":"SarimMalik01","description":"This repository serves as a collection of my solved LeetCode questions along with the approaches I've employed to solve them.  Within this repository, you'll find a structured organization of my approches ,intutions,overview, complexity and pattern  each corresponding to a specific LeetCode problem.","archived":false,"fork":false,"pushed_at":"2024-07-09T04:42:28.000Z","size":414,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-23T11:04:54.611Z","etag":null,"topics":["bit-manipulation","coding-challenge","competitive-programming","dsa","leetcode-solutions","pattern-recognition","streaks"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/Sarim_Malik01/","language":null,"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/SarimMalik01.png","metadata":{"files":{"readme":"Readme","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-03-08T12:26:08.000Z","updated_at":"2024-07-09T04:42:31.000Z","dependencies_parsed_at":"2024-03-13T17:53:24.750Z","dependency_job_id":"d73145f1-980f-4d24-8aaf-e7726b728b32","html_url":"https://github.com/SarimMalik01/Leetcode_reports","commit_stats":null,"previous_names":["quantumxerxes/leetcode_reports","sarimmalik01/leetcode_reports"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/SarimMalik01/Leetcode_reports","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SarimMalik01%2FLeetcode_reports","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SarimMalik01%2FLeetcode_reports/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SarimMalik01%2FLeetcode_reports/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SarimMalik01%2FLeetcode_reports/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SarimMalik01","download_url":"https://codeload.github.com/SarimMalik01/Leetcode_reports/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SarimMalik01%2FLeetcode_reports/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29326078,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-11T02:08:56.257Z","status":"ssl_error","status_checked_at":"2026-02-11T02:08:51.338Z","response_time":97,"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":["bit-manipulation","coding-challenge","competitive-programming","dsa","leetcode-solutions","pattern-recognition","streaks"],"created_at":"2025-02-07T11:19:11.135Z","updated_at":"2026-02-11T03:02:38.560Z","avatar_url":"https://github.com/SarimMalik01.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"\nWelcome to my LeetCode solutions repository! Here, I document my approach to solving various algorithmic problems from LeetCode. Each problem includes a detailed breakdown of the approach used, reasoning behind it, and the implementation in Java and occasionally in C++.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsarimmalik01%2Fleetcode_reports","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsarimmalik01%2Fleetcode_reports","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsarimmalik01%2Fleetcode_reports/lists"}