{"id":27417802,"url":"https://github.com/lah1203/my_algorithm","last_synced_at":"2026-02-13T19:31:52.424Z","repository":{"id":133842445,"uuid":"328570502","full_name":"LAH1203/My_Algorithm","owner":"LAH1203","description":"Data structure \u0026 Algorithm Record","archived":false,"fork":false,"pushed_at":"2021-05-14T02:46:49.000Z","size":71,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-22T23:28:05.331Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":null,"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/LAH1203.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}},"created_at":"2021-01-11T06:34:34.000Z","updated_at":"2021-07-09T06:16:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"550c70ac-7dff-4d33-a9c2-24906cdd2702","html_url":"https://github.com/LAH1203/My_Algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/LAH1203/My_Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LAH1203%2FMy_Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LAH1203%2FMy_Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LAH1203%2FMy_Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LAH1203%2FMy_Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LAH1203","download_url":"https://codeload.github.com/LAH1203/My_Algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LAH1203%2FMy_Algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29415569,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-13T06:24:03.484Z","status":"ssl_error","status_checked_at":"2026-02-13T06:23:12.830Z","response_time":78,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":[],"created_at":"2025-04-14T09:56:42.908Z","updated_at":"2026-02-13T19:31:52.405Z","avatar_url":"https://github.com/LAH1203.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# My Algorithm\n\n## 자료구조(Data Structure)\n+ [2021-01-18](https://github.com/LAH1203/My_Algorithm/blob/main/list%2C%20array%2C%20insert%2C%20delete%2C%20search.md)\n  + 리스트(List)\n  + 배열(Array)\n  + 추가(insert)\n  + 제거(delete)\n  + 검색(search)\n+ [2021-01-20](https://github.com/LAH1203/My_Algorithm/blob/main/linkedList.md)\n  + 연결 리스트(Linked list)\n    + 단일 연결 리스트(Singly linked list)\n    + 이중 연결 리스트(Doubly linked list)\n+ [2021-01-25](https://github.com/LAH1203/My_Algorithm/blob/main/stack.md)\n  + 스택(Stack)\n    + 스택의 개념\n    + 스택의 연산\n+ [2021-01-28](https://github.com/LAH1203/My_Algorithm/blob/main/queue.md)\n  + 큐(Queue)\n    + 큐의 개념\n    + 큐의 연산\n  + 원형 큐(Circular Queue)\n  + DEQ(Doubly-Ended Queue)\n  + 우선 순위 큐(Priority Queue)\n+ [2021-01-29](https://github.com/LAH1203/My_Algorithm/blob/main/binary_search_tree.md)\n  + 이진 탐색 트리(Binary search tree)\n    + 이진 탐색 트리의 정의\n    + 이진 탐색 트리의 연산\n  + 균형 이진 탐색 트리(Balanced binary search tree)\n    + AVL tree\n    + Red-black tree\n    + 2-3 tree\n    + B+ tree\n+ [2021-02-01](https://github.com/LAH1203/My_Algorithm/blob/main/tree%26binary%20tree.md)\n  + 트리(Tree)\n    + 트리의 정의 및 개념\n    + 트리의 용어\n    + 트리의 자료구조 및 구조\n  + 이진 트리(Binary tree)\n    + 이진 트리의 정의\n    + 이진 트리의 성질\n    + 특별한 이진 트리\n      + 포화 이진 트리\n      + 완전 이진 트리\n  + 트리 탐색(Tree search)\n    + 탐색이란?\n    + 중위 우선 탐색(Inorder traversal)\n    + 전위 우선 탐색(Preorder traversal)\n    + 후위 우선 탐색(Postorder traversal)\n+ [2021-02-08](https://github.com/LAH1203/My_Algorithm/blob/main/heap.md)\n  + 힙(Heap)\n    + 힙의 정의\n    + 힙의 구현\n    + 힙의 연산\n      + 추가(push)\n      + 제거(pop)\n  + 힙 정렬(Heap sort)\n+ [2021-02-15](https://github.com/LAH1203/My_Algorithm/blob/main/hash.md)\n  + 해시(Hash)\n    + 해시의 정의\n    + 해시 함수(Hash function)\n    + 해시의 연산\n      + 검색, 삽입, 삭제 연산\n    + 충돌 및 충돌 해소\n      + 열린 어드레싱(open addressing)\n        + 선형 탐사(linear probing)\n        + 제곱 탐사(quadratic probing)\n        + 이중 해시(double hash)\n      + 닫힌 어드레싱(closed addressing)\n        + 버켓(bucket)\n        + 별도 체인(separate chain)\n+ [2021-02-24~25](https://github.com/LAH1203/My_Algorithm/blob/main/graph.md)\n  + 그래프의 기본 개념\n  + 그래프의 기본 용어\n  + 그래프의 기본 연산\n\n## 알고리즘(Algorithm)\n\n## 문제풀이\n[알고리즘 문제 및 코드 notion 정리](https://www.notion.so/1-b28df6eeb1454228bb9b621c2caedc28)\n\u003cbr\u003e\n\n| 분야 | 날짜 | 문제 |\n|:---:|:---:|---|\n| **무식하게 풀기**\u003cbr\u003e*브루트포스, 완전 탐색* | 2021.03.29 ~ 2021.04.01 | [치킨 배달(백준 15686)](https://www.acmicpc.net/problem/15686)\u003cbr\u003e[소수 찾기(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/42839)\u003cbr\u003e[연산자 끼워넣기(백준 14888)](https://www.acmicpc.net/problem/14888)\u003cbr\u003e[카펫(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/42842) |\n| **분할 정복**\u003cbr\u003e*분할 정복, 이분(이진) 탐색 등* | 2021.04.02 ~ 2021.04.08 | [입국심사(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/43238)\u003cbr\u003e[트리(백준 4256)](https://www.acmicpc.net/problem/4256)\u003cbr\u003e[가장 긴 증가하는 부분 수열 3(백준 12738)](https://www.acmicpc.net/problem/12738)\u003cbr\u003e[Z(백준 1074)](https://www.acmicpc.net/problem/1074)\u003cbr\u003e[박스 채우기(백준 1493)](https://www.acmicpc.net/problem/1493)\u003cbr\u003e[행렬 제곱(백준 10830)](https://www.acmicpc.net/problem/10830) |\n| **동적 계획법**\u003cbr\u003e*Dynamic Programming* | 2021.04.30 ~ 2021.05.13 | [N으로 표현(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/42895)\u003cbr\u003e[등굣길(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/42898)\u003cbr\u003e[LCS(백준 9251)](https://www.acmicpc.net/problem/9251)\u003cbr\u003e[정수 삼각형(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/43105)\u003cbr\u003e[합 분해(백준 2225)](https://www.acmicpc.net/problem/2225)\u003cbr\u003e[가장 긴 증가하는 부분 수열 4(백준 14002)](https://www.acmicpc.net/problem/14002)\u003cbr\u003e[도둑질(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/42897)\u003cbr\u003e[거스름돈(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/12907)\u003cbr\u003e[출근 경로(백준 5569)](https://www.acmicpc.net/problem/5569)\u003cbr\u003e[줄세우기(백준 2631)](https://www.acmicpc.net/problem/2631) |\n| **탐욕법**\u003cbr\u003e*Greedy* | 2021.05.14 ~ 2021.05.20 | [큰 수 만들기(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/42883)\u003cbr\u003e[섬 연결하기(프로그래머스)](https://programmers.co.kr/learn/courses/30/lessons/42861)\u003cbr\u003e[단어 수학(백준 1339)](https://www.acmicpc.net/problem/1339) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flah1203%2Fmy_algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flah1203%2Fmy_algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flah1203%2Fmy_algorithm/lists"}