{"id":21968026,"url":"https://github.com/anasmak04/leetcode-solutions","last_synced_at":"2026-04-09T11:01:24.729Z","repository":{"id":109176767,"uuid":"586236589","full_name":"anasmak04/Leetcode-solutions","owner":"anasmak04","description":"Collections of my leetcode solutions implemented by java and typescript and javascript","archived":false,"fork":false,"pushed_at":"2023-03-07T21:43:09.000Z","size":28,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-28T01:47:18.640Z","etag":null,"topics":["algorithms-and-data-structures","arrays","data-structures","java","javascript","leetcode-solutions","linked-list","problem-solving","search","sorting-algorithms","typescript"],"latest_commit_sha":null,"homepage":"https://anasmak04.github.io/MyLeetcode-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/anasmak04.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":"2023-01-07T12:33:11.000Z","updated_at":"2023-03-07T14:27:19.000Z","dependencies_parsed_at":"2023-04-13T12:17:25.581Z","dependency_job_id":null,"html_url":"https://github.com/anasmak04/Leetcode-solutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anasmak04%2FLeetcode-solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anasmak04%2FLeetcode-solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anasmak04%2FLeetcode-solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anasmak04%2FLeetcode-solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anasmak04","download_url":"https://codeload.github.com/anasmak04/Leetcode-solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245026043,"owners_count":20549073,"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":["algorithms-and-data-structures","arrays","data-structures","java","javascript","leetcode-solutions","linked-list","problem-solving","search","sorting-algorithms","typescript"],"created_at":"2024-11-29T13:40:25.593Z","updated_at":"2025-10-08T04:29:13.858Z","avatar_url":"https://github.com/anasmak04.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🚀 Leetcode-solutions\n\n\n\n| # | Title | Solutions | Difficulty |\n|---|-------|----------|------------|\n| 1 | [Two sum ](https://leetcode.com/problems/two-sum/)| [Java](./codes/Java/Leetcodes/src/main/TwoSum.java)  [Javascript](./codes/Javascript/Leetcodes/src/TwoSum.js)    [Typescript](./codes/Typescript/Leetcodes/src/TwoSum.ts)| Easy |\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Java](./codes/Java/Leetcodes/src/main/Search%20in%20Rotated%20Sorted%20Array.java)  [Javascript](./codes/Javascript/Leetcodes/src/Search%20in%20Rotated%20Sorted%20Array.js)  [Typescript](./codes/Typescript/Leetcodes/src/Search%20in%20Rotated%20Sorted%20Array.ts) | Medium |\n| 3 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Java](./codes/Java/Leetcodes/src/main/Search%20Insert%20Position.java)  [Javascript](./codes/Javascript/Leetcodes/src/Search%20Insert%20Position.js)  [Typescript](./codes/Typescript/Leetcodes/src/Search%20Insert%20Position.ts)| Easy |\n| 4 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/description/) | [Javascript](./codes/Javascript/Leetcodes/src/Palindrome%20Number.js)| Easy | \n| 1 | [Min stack ](https://leetcode.com/problems/min-stack/)| [Java](./codes/Java/Leetcodes/src/main/Min%20Stack.java)  [Javascript](./codes/Javascript/Leetcodes/src/Min%20Stack.js)  [Typescript](./codes/Typescript/Leetcodes/src/Min%20stack.ts)| Medium | \n| 2 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/description/)| [Java](./codes/Java/Leetcodes/src/main/Remove%20All%20Adjacent%20Duplicates%20In%20String.java) | Easy |\n| 3 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/description/)| [Java](./codes/Java/Leetcodes/src/main/Valid%20Parentheses.java) | Easy | \n| 4 | [remove vowels from a string](https://leetcode.com/problems/remove-vowels-from-a-string/)| [Java](./codes/Java/Leetcodes/src/main/Remove%20All%20Adjacent%20Duplicates%20In%20String.java) | Easy | \n| 5 | [Single Number](https://leetcode.com/problems/single-number/submissions/879923589/)| [Java](./codes/Java/Leetcodes/src/main/Single%20Number.java) | Easy |\n| 6 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [Java](./codes/Java/Leetcodes/src/main/Length%20of%20Last%20Word.java) | Easy |\n| 7 | [Sort Colors](https://leetcode.com/problems/sort-colors/)| [Java](./codes/Java/Leetcodes/src/main/sort%20colors.java) | Easy |\n| 8 | [ Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Java](./codes/Java/Leetcodes/src/main/Contains%20Duplicate.java) | Easy |\n| 9 | [ Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Java](./codes/Java/Leetcodes/src/main/Contains%20Duplicate.java) | Easy |\n| 9 | [ Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Java](./codes/Java/Leetcodes/src/main/valid-anagram.java) | Easy |\n| 10 | [ Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)| [Java](./codes/Java/Leetcodes/src/main/Remove%20All%20Adjacent%20Duplicates%20In%20String.java) | Easy |\n| 11 | [ To Lower Case ](https://leetcode.com/problems/to-lower-case/)| [Java](./codes/Java/Leetcodes/src/main/To%20Lower%20Case.java) | Easy |\n| 12 | [ implement queue using stacks ](https://leetcode.com/problems/implement-queue-using-stacks/)| [Java](./codes/Java/Leetcodes/src/main/Implement%20Queue%20using%20Stacks.java) | Easy |\n| 13 | [ power of two  ](https://leetcode.com/problems/power-of-two/)| [Java](./codes/Java/Leetcodes/src/main/Power%20of%20Two.java) | Easy |\n\n\n\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanasmak04%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanasmak04%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanasmak04%2Fleetcode-solutions/lists"}