{"id":32711661,"url":"https://github.com/juniorthanhbq/largestnumbercpp","last_synced_at":"2026-07-03T15:01:36.661Z","repository":{"id":321883183,"uuid":"1087282696","full_name":"JuniorThanhBQ/LargestNumberCpp","owner":"JuniorThanhBQ","description":"LeetCode practice C++","archived":false,"fork":false,"pushed_at":"2025-11-01T04:47:13.000Z","size":20,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-11-01T06:12:44.899Z","etag":null,"topics":["cpp20","largestnumber","leetcode-solutions","quick-sort"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/JuniorThanhBQ.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-10-31T16:50:11.000Z","updated_at":"2025-11-01T04:48:23.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/JuniorThanhBQ/LargestNumberCpp","commit_stats":null,"previous_names":["juniorthanhbq/largestnumbercpp"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/JuniorThanhBQ/LargestNumberCpp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuniorThanhBQ%2FLargestNumberCpp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuniorThanhBQ%2FLargestNumberCpp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuniorThanhBQ%2FLargestNumberCpp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuniorThanhBQ%2FLargestNumberCpp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JuniorThanhBQ","download_url":"https://codeload.github.com/JuniorThanhBQ/LargestNumberCpp/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuniorThanhBQ%2FLargestNumberCpp/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35090444,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-03T02:00:05.635Z","response_time":110,"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":["cpp20","largestnumber","leetcode-solutions","quick-sort"],"created_at":"2025-11-02T07:02:35.309Z","updated_at":"2026-07-03T15:01:36.656Z","avatar_url":"https://github.com/JuniorThanhBQ.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LargestNumberCpp\nLeetCode practice C++\n\nSolution: Quick Sort + String parse\nTimes: 6ms (slowed)\nCache: 14.1 (high)\n\nGiven a list of non-negative integers nums, arrange them such that they form the largest number and return it.\n\nSince the result may be very large, so you need to return a string instead of an integer.\n\nExample 1:\n\nInput: nums = [10,2]\nOutput: \"210\"\nExample 2:\n\nInput: nums = [3,30,34,5,9]\nOutput: \"9534330\"\n \nConstraints:\n1 \u003c= nums.length \u003c= 100\n0 \u003c= nums[i] \u003c= 109\n\nSource: https://leetcode.com/problems/largest-number/\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuniorthanhbq%2Flargestnumbercpp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjuniorthanhbq%2Flargestnumbercpp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuniorthanhbq%2Flargestnumbercpp/lists"}