GitHub - dusunax/algorithm: 🗄️ 알고리즘 문제풀이

알고리즘 연습

2022년 11월 4일부터 백준 허브 적용 중입니다. https://github.com/BaekjoonHub/BaekjoonHub
2023년 9월 3일부터 LeetHub 적용 중입니다. https://github.com/QasimWani/LeetHub
2023년 9월 13일 LeetHub 업로드 관련 이슈 (크롬 익스텐션과 개발자 모드)
- feat: leetcode 업로드 개선 필요

문제출처

프로그래머스 https://programmers.co.kr/
leetcode https://leetcode.com/dusunax/

사용언어

JavaScript, Python, Java(기초)

목표

잔디 심기
꾸준히 학습하기

to study

알고리즘	설명	English Name
구현🌱	문제에서 주어진 요구사항을 코드로 구현하는 것	Implementation
완전 탐색🌱	가능한 모든 경우를 다 해보는 방법	Brute Force
그리디🌱	각 단계에서 가장 최적의 선택을 하는 방법	Greedy
BFS🌱	그래프나 트리에서 너비우선으로 탐색하는 방법	Breadth First Search
DFS🌱	그래프나 트리에서 깊이우선으로 탐색하는 방법	Depth First Search
등적 계획법(DP)🌱🌱	작은 부분 문제의 해를 조합하여 전체 문제의 해를 구하는 방법	Dynamic Programming
분할 정복🌱	큰 문제를 작은 문제로 나누어 해결하는 방법	Divide and Conquer
최단 거리 알고리즘	그래프나 트리에서 최단 경로를 찾는 방법	Shortest Path Algorithms
백트래킹🌱	모든 가능한 경우를 탐색하면서 불필요한 경우를 배제하는 방법	Backtracking
이분 탐색🌱	정렬된 배열에서 특정 값을 찾는 방법	Binary Search
LIS, 최대 증가 부분 수열	배열에서 증가하는 부분 수열 중 가장 긴 수열을 찾는 방법	Longest Increasing Subsequence
비트 마스킹	이진수 연산을 활용한 알고리즘	Bitmasking
투 포인터🌱	두 개의 포인터를 활용한 알고리즘	Two Pointers
펜윅 트리	누적 합을 구하는 알고리즘	Fenwick Tree
세그먼트 트리	구간 합을 빠르게 구하는 알고리즘	Segment Tree
최소 스패닝 트리	가중치 그래프에서 모든 정점을 연결하는 최소 비용을 구하는 방법	Minimum Spanning Tree

Name	Name	Last commit message	Last commit date
Latest commit History 819 Commits 819 Commits
0001-two-sum	0001-two-sum
0003-longest-substring-without-repeating-characters	0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring	0005-longest-palindromic-substring
0007-reverse-integer	0007-reverse-integer
0008-string-to-integer-atoi	0008-string-to-integer-atoi
0011-container-with-most-water	0011-container-with-most-water
0014-longest-common-prefix	0014-longest-common-prefix
0015-3sum	0015-3sum
0017-letter-combinations-of-a-phone-number	0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-list	0019-remove-nth-node-from-end-of-list
0020-valid-parentheses	0020-valid-parentheses
0021-merge-two-sorted-lists	0021-merge-two-sorted-lists
0026-remove-duplicates-from-sorted-array	0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string	0028-find-the-index-of-the-first-occurrence-in-a-string
0030-substring-with-concatenation-of-all-words	0030-substring-with-concatenation-of-all-words
0033-search-in-rotated-sorted-array	0033-search-in-rotated-sorted-array
0036-valid-sudoku	0036-valid-sudoku
0039-combination-sum	0039-combination-sum
0048-rotate-image	0048-rotate-image
0049-group-anagrams	0049-group-anagrams
0053-maximum-subarray	0053-maximum-subarray
0054-spiral-matrix	0054-spiral-matrix
0055-jump-game	0055-jump-game
0056-merge-intervals	0056-merge-intervals
0057-insert-interval	0057-insert-interval
0062-unique-paths	0062-unique-paths
0066-plus-one	0066-plus-one
0070-climbing-stairs	0070-climbing-stairs
0073-set-matrix-zeroes	0073-set-matrix-zeroes
0076-minimum-window-substring	0076-minimum-window-substring
0079-word-search	0079-word-search
0088-merge-sorted-array	0088-merge-sorted-array
0091-decode-ways	0091-decode-ways
0092-reverse-linked-list-ii	0092-reverse-linked-list-ii
0098-validate-binary-search-tree	0098-validate-binary-search-tree
0100-same-tree	0100-same-tree
0101-symmetric-tree	0101-symmetric-tree
0102-binary-tree-level-order-traversal	0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree	0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal	0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree	0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle	0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock	0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii	0122-best-time-to-buy-and-sell-stock-ii
0125-valid-palindrome	0125-valid-palindrome
0128-longest-consecutive-sequence	0128-longest-consecutive-sequence
0133-clone-graph	0133-clone-graph
0136-single-number	0136-single-number
0138-copy-list-with-random-pointer	0138-copy-list-with-random-pointer
0139-word-break	0139-word-break
0141-linked-list-cycle	0141-linked-list-cycle
0143-reorder-list	0143-reorder-list
0151-reverse-words-in-a-string	0151-reverse-words-in-a-string
0153-find-minimum-in-rotated-sorted-array	0153-find-minimum-in-rotated-sorted-array
0189-rotate-array	0189-rotate-array
0190-reverse-bits	0190-reverse-bits
0191-number-of-1-bits	0191-number-of-1-bits
0198-house-robber	0198-house-robber
0200-number-of-islands	0200-number-of-islands
0206-reverse-linked-list	0206-reverse-linked-list
0207-course-schedule	0207-course-schedule
0211-design-add-and-search-words-data-structure	0211-design-add-and-search-words-data-structure
0213-house-robber-ii	0213-house-robber-ii
0217-contains-duplicate	0217-contains-duplicate
0226-invert-binary-tree	0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst	0230-kth-smallest-element-in-a-bst
0234-palindrome-linked-list	0234-palindrome-linked-list
0235-lowest-common-ancestor-of-a-binary-search-tree	0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree	0236-lowest-common-ancestor-of-a-binary-tree
0237-delete-node-in-a-linked-list	0237-delete-node-in-a-linked-list
0238-product-of-array-except-self	0238-product-of-array-except-self
0242-valid-anagram	0242-valid-anagram
0268-missing-number	0268-missing-number
0278-first-bad-version	0278-first-bad-version
0283-move-zeroes	0283-move-zeroes
0300-longest-increasing-subsequence	0300-longest-increasing-subsequence
0322-coin-change	0322-coin-change
0328-odd-even-linked-list	0328-odd-even-linked-list
0338-counting-bits	0338-counting-bits
0344-reverse-string	0344-reverse-string
0345-reverse-vowels-of-a-string	0345-reverse-vowels-of-a-string
0347-top-k-frequent-elements	0347-top-k-frequent-elements
0350-intersection-of-two-arrays-ii	0350-intersection-of-two-arrays-ii
0371-sum-of-two-integers	0371-sum-of-two-integers
0374-guess-number-higher-or-lower	0374-guess-number-higher-or-lower
0383-ransom-note	0383-ransom-note
0384-shuffle-an-array	0384-shuffle-an-array
0387-first-unique-character-in-a-string	0387-first-unique-character-in-a-string
0392-is-subsequence	0392-is-subsequence
0417-pacific-atlantic-water-flow	0417-pacific-atlantic-water-flow
0424-longest-repeating-character-replacement	0424-longest-repeating-character-replacement
0435-non-overlapping-intervals	0435-non-overlapping-intervals
0485-max-consecutive-ones	0485-max-consecutive-ones
0509-fibonacci-number	0509-fibonacci-number
0572-subtree-of-another-tree	0572-subtree-of-another-tree
0605-can-place-flowers	0605-can-place-flowers
0643-maximum-average-subarray-i	0643-maximum-average-subarray-i
0647-palindromic-substrings	0647-palindromic-substrings
0700-search-in-a-binary-search-tree	0700-search-in-a-binary-search-tree
0724-find-pivot-index	0724-find-pivot-index

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

알고리즘 연습

문제출처

사용언어

목표

to study

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Search code, repositories, users, issues, pull requests...

Folders and files

Latest commit

History

Repository files navigation

알고리즘 연습

문제출처

사용언어

목표

to study

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages