{"id":17461924,"url":"https://github.com/interesting-study/algorithm","last_synced_at":"2025-07-22T17:04:34.664Z","repository":{"id":49529609,"uuid":"327304338","full_name":"Interesting-study/Algorithm","owner":"Interesting-study","description":"코딩 테스트 연습","archived":false,"fork":false,"pushed_at":"2023-01-22T10:39:12.000Z","size":453,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-28T06:25:35.848Z","etag":null,"topics":["algorithm","python3"],"latest_commit_sha":null,"homepage":"","language":"Python","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/Interesting-study.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}},"created_at":"2021-01-06T12:26:15.000Z","updated_at":"2023-05-22T23:55:01.000Z","dependencies_parsed_at":"2023-02-12T15:31:46.079Z","dependency_job_id":null,"html_url":"https://github.com/Interesting-study/Algorithm","commit_stats":null,"previous_names":["interesting-study/algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Interesting-study/Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Interesting-study%2FAlgorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Interesting-study%2FAlgorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Interesting-study%2FAlgorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Interesting-study%2FAlgorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Interesting-study","download_url":"https://codeload.github.com/Interesting-study/Algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Interesting-study%2FAlgorithm/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266535695,"owners_count":23944275,"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-07-22T02:00:09.085Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"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":["algorithm","python3"],"created_at":"2024-10-18T07:23:46.707Z","updated_at":"2025-07-22T17:04:34.644Z","avatar_url":"https://github.com/Interesting-study.png","language":"Python","readme":"* 2차원 배열 뒤집기\n  * scores = list(map(list, zip(*scores)))\n\n\u003cbr\u003e\n\n* 리스트의 *\n  * \"원소 원소\" 식으로 출력됨\n  \n\n\u003cbr\u003e\n\n* 문제에 접근할 때\n  * 수식화 할 수 있는가?\n  * 단순화 할 수 없는가?\n  * 그림으로 그려볼 순 없는가?\n  * 수식으로 표현할 수 있는가?\n  * 문제를 분해랄 수 있는가?\n  * 뒤에서부터 생각할 수 있는가?\n  * 순서를 강제할 수 있는가?\n  * 특정 형태의 답만 고려할 수 있는가?\n\n\n\u003cbr\u003e\n\n* 시간복잡도\n  * n = 500, n^3\n  * n = 2000, n^2\n  * n = 100,000, nlogn\n  * n = 10,000,000, n\n\n\u003cbr\u003e\n\n\n* 약수 구하기(효율적)\n~~~ \ndef get_divisor(n):\n    divisors = []\n    divisore_reverse = []\n\n    for i in range(1, int(n**0.5) + 1):\n        if n % i == 0:\n            divisors.append(i)\n            if (i != (n // i)):\n                divisore_reverse.append(n // i)\n\n    return divisors + divisore_reverse[::-1]\n~~~\n\n\n\n\u003cbr\u003e\n\n* n진수 구하기(재귀함수)\n~~~\ndef convert(n, base):\n    base_str = '0123456789ABCDEF'\n    q, r = divmod(n, base)\n\n    if q == 0:\n        return base_str[r]\n    else:\n        return convert(q, base) + base_str[r]\n~~~\n\n\u003cbr\u003e\n\n* 소수 구하기 = 에라토스테네스의 체\n\n~~~\ndef prime_list(n):\n    # 에라토스테네스의 체 초기화: n개 요소에 True 설정(소수로 간주)\n    sieve = [True] * n\n\n    m = int(n ** 0.5)\n    for i in range(2, m + 1):\n        if sieve[i] == True:           # i가 소수인 경우\n            for j in range(i+i, n, i): # i이후 i의 배수들을 False 판정\n                sieve[j] = False\n\n    # 소수 목록 산출\n    return [i for i in range(2, n) if sieve[i] == True]\n~~~","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Finteresting-study%2Falgorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Finteresting-study%2Falgorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Finteresting-study%2Falgorithm/lists"}