{"id":22897611,"url":"https://github.com/sahilm8/dsa_solutions","last_synced_at":"2025-04-01T00:45:20.843Z","repository":{"id":266471130,"uuid":"898440065","full_name":"sahilmemon7/dsa_solutions","owner":"sahilmemon7","description":"Solutions for data structures and algorithms from LeetCode and HackerRank.","archived":false,"fork":false,"pushed_at":"2025-01-15T08:41:38.000Z","size":47,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-27T01:52:22.706Z","etag":null,"topics":["hackerrank","java","leetcode"],"latest_commit_sha":null,"homepage":"https://github.com/sahilm8/dsa_solutions","language":"Java","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/sahilmemon7.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-04T11:56:26.000Z","updated_at":"2025-01-15T08:41:39.000Z","dependencies_parsed_at":"2025-01-15T09:56:19.235Z","dependency_job_id":"a0b3ff73-eb36-448f-8013-1e8bffb62319","html_url":"https://github.com/sahilmemon7/dsa_solutions","commit_stats":null,"previous_names":["sahilm8/dsa_solutions","sahilmemon7/dsa_solutions"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilmemon7%2Fdsa_solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilmemon7%2Fdsa_solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilmemon7%2Fdsa_solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilmemon7%2Fdsa_solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sahilmemon7","download_url":"https://codeload.github.com/sahilmemon7/dsa_solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246563384,"owners_count":20797446,"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":["hackerrank","java","leetcode"],"created_at":"2024-12-14T00:18:22.744Z","updated_at":"2025-04-01T00:45:20.654Z","avatar_url":"https://github.com/sahilmemon7.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Solutions\n\n![Java](https://img.shields.io/badge/java-%23ED8B00.svg?style=for-the-badge\u0026logo=openjdk\u0026logoColor=white) ![LeetCode](https://img.shields.io/badge/LeetCode-000000?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=#d16c06) ![Hackerrank](https://img.shields.io/badge/-Hackerrank-2EC866?style=for-the-badge\u0026logo=HackerRank\u0026logoColor=white)\n\n![Maintenance](https://img.shields.io/badge/Maintained%3F-yes-green.svg)\n\n![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)\n\nSolutions for data structures and algorithms from LeetCode and HackerRank.\n\n## LeetCode\n\n### Easy\n\n- Two Sum\n- Valid Parenthesis\n- Merge Two Sorted Lists\n- Max Depth of a Binary Tree\n- Reverse Linked List\n- First Unique Character in a String\n- Best Time to Buy and Sell Stock\n- High Five\n- Backspace String Compare\n- Climb Stairs\n\n### Medium\n\n- Robot Bounded in Circle\n- Decode Ways\n- Fraction to Recurring Decimal\n- 3Sum\n- Find the Winner of the Circular Game\n- Better Compression of String\n- Longest Substring Without Repeating Characters\n- Group Anagrams\n- House Robber\n- Palindromic Substrings\n- Construct Smallest Number From DI String\n- Container With Most Water\n- Generate Parentheses\n- Jump Game\n- Best Time to Buy and Sell Stock II\n- Maximum Product Subarray\n- Minimum Size Subarray Sum\n- Ugly Number II\n- Maximum Size Subarray Sum Equals k\n- String Compression\n\n### Hard\n\n- Trapping Rain Water\n- Median of Two Sorted Arrays\n\n## HackerRank\n\n### Easy\n\n- FactoryPattern\n- IfElse\n- InputOutput\n- Welcome\n\n### Medium\n\n- ArrayPartTwo\n- BigDecimalNum\n- CanAccess\n- CharStack\n- Dequeue\n- LambdaExpression\n- PlayerComparator\n- PrimeChecker\n- Regex\n- StudentsPriorityQueue\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilm8%2Fdsa_solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsahilm8%2Fdsa_solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilm8%2Fdsa_solutions/lists"}