{"id":23016114,"url":"https://github.com/himanshurajora/leetcode_solutions","last_synced_at":"2025-10-13T15:36:54.305Z","repository":{"id":115947786,"uuid":"445189194","full_name":"himanshurajora/LeetCode_Solutions","owner":"himanshurajora","description":"Solving some array questions","archived":false,"fork":false,"pushed_at":"2022-04-15T16:09:45.000Z","size":20,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-04T06:59:46.846Z","etag":null,"topics":["array","competetive-programming","leet-code"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/himanshurajora.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":"2022-01-06T14:00:45.000Z","updated_at":"2022-06-14T17:50:16.000Z","dependencies_parsed_at":"2023-05-14T12:00:17.845Z","dependency_job_id":null,"html_url":"https://github.com/himanshurajora/LeetCode_Solutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/himanshurajora/LeetCode_Solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himanshurajora%2FLeetCode_Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himanshurajora%2FLeetCode_Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himanshurajora%2FLeetCode_Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himanshurajora%2FLeetCode_Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/himanshurajora","download_url":"https://codeload.github.com/himanshurajora/LeetCode_Solutions/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himanshurajora%2FLeetCode_Solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279015931,"owners_count":26085777,"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","status":"online","status_checked_at":"2025-10-13T02:00:06.723Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["array","competetive-programming","leet-code"],"created_at":"2024-12-15T11:14:33.117Z","updated_at":"2025-10-13T15:36:54.298Z","avatar_url":"https://github.com/himanshurajora.png","language":"TypeScript","readme":"## Solutions of LeetCode Problems by Vedik Devs\n\n### File Notations\n- hm_[filename] for hashmap solution\n- bf_[filename] for brute force solution\n- it_[filename] for iterative solution\n- dp_[filename] for dynamic programming solution\n- rec_[filename] for recursive solution\n\n### Easy\n- Array Problems\n    1. [Two Sum](./Easy/Array/TwoSum)\n    2. [Remove Duplicates from Sorted Array](./Easy/Array/RemoveDuplicatesFromSortedArray)\n    3. [Remove Element](./Easy/Array/RemoveElement)\n    4. [Search Insert Position](./Easy/Array/SearchInsertPosition)\n    5. [Maximum Subarray](./Easy/Array/MaximumSubarray)\n    6. [Plus One](./Easy/Array/PlusOne)\n    7. [Merge Sorted Arrays](./Easy/Array/MergeSortedArrays)\n    8. [Convert Sorted Array to Binary Search Tree](./Easy/Array/ConvertSortedToBST)\n    9. [Pascal's Triangle](./Easy/Array/PascalsTriangle)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhimanshurajora%2Fleetcode_solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhimanshurajora%2Fleetcode_solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhimanshurajora%2Fleetcode_solutions/lists"}