{"id":18289380,"url":"https://github.com/divyanshu-rawat/js-challenge","last_synced_at":"2025-04-09T07:17:03.392Z","repository":{"id":82676358,"uuid":"150111906","full_name":"divyanshu-rawat/js-challenge","owner":"divyanshu-rawat","description":"A Javscript programming Question having constraints of time and space.","archived":false,"fork":false,"pushed_at":"2018-09-25T06:58:37.000Z","size":2,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-15T01:32:45.911Z","etag":null,"topics":["data-structures","javscript","programming-challenges","space-complexity","time-complexity"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/divyanshu-rawat.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}},"created_at":"2018-09-24T14:04:25.000Z","updated_at":"2018-09-25T06:58:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"c9fd58ae-3a53-4565-847f-d165d79a5d43","html_url":"https://github.com/divyanshu-rawat/js-challenge","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/divyanshu-rawat%2Fjs-challenge","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/divyanshu-rawat%2Fjs-challenge/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/divyanshu-rawat%2Fjs-challenge/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/divyanshu-rawat%2Fjs-challenge/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/divyanshu-rawat","download_url":"https://codeload.github.com/divyanshu-rawat/js-challenge/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247994136,"owners_count":21030050,"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":["data-structures","javscript","programming-challenges","space-complexity","time-complexity"],"created_at":"2024-11-05T14:06:07.846Z","updated_at":"2025-04-09T07:17:03.358Z","avatar_url":"https://github.com/divyanshu-rawat.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# js-challenge\nA Javscript programming Question having constraints of time and space. i.e - doing in place sorting of an array of natural numbers from 1 to N-1 in time complexity of less than O(NlogN).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdivyanshu-rawat%2Fjs-challenge","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdivyanshu-rawat%2Fjs-challenge","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdivyanshu-rawat%2Fjs-challenge/lists"}