https://github.com/connieya/java_algorithm

Java Algorithm Source Code Storage
https://github.com/connieya/java_algorithm
algorithm java ps
Last synced: 5 months ago
JSON representation
Java Algorithm Source Code Storage
Host: GitHub
URL: https://github.com/connieya/java_algorithm
Owner: connieya
Created: 2021-04-25T10:31:54.000Z (over 4 years ago)
Default Branch: master
Last Pushed: 2025-04-07T12:56:32.000Z (8 months ago)
Last Synced: 2025-04-07T13:40:55.872Z (8 months ago)
Topics: algorithm, java, ps
Language: Java
Homepage:
Size: 1.52 MB
Stars: 1
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: Readme.md
Awesome Lists containing this project

README

          # java algorithm

## 🎃 LeetCode

| #   |                                                      Title 
|:----|:------------------------------------------------------------------------------------------------- 
| 1   |                         [ Two Sum ](https://leetcode.com/problems/tow-sum/description/) 
| 15  |                            [ 3Sum ](https://leetcode.com/problems/3sum/description/) 
| 20  |               [ Valid Parentheses ](https://leetcode.com/problems/valid-parentheses/description/) 
| 23  |            [ Merge k Sorted Lists ](https://leetcode.com/problems/merge-k-sorted-lists/description/) 
| 42  |             [ Trapping Rain Water ](https://leetcode.com/problems/trapping-rain-water/description/) 
| 49  |                  [ Group Anagrams ](https://leetcode.com/problems/group-anagrams/description/) 
| 121 | [ Best Time to Buy and Sell Stock ](https://leetcode.com/problems/best-time-to-buy-and-sell-stock 
| 125 |                      [ Valid Palindrome ](https://leetcode.com/problems/valid-palindrome/) 
| 225 |                [ Implement Stack using Queues ](https://leetcode.com/problems/valid-palindrome/) 
| 232 |    [ Implement Queue using Stacks ](https://leetcode.com/problems/implement-queue-using-stacks/description/) 
| 238 |    [ Product of Array Except Self ](https://leetcode.com/problems/product-of-array-except-self/description/) 
| 316 |        [ Remove Duplicate Letters ](https://leetcode.com/problems/remove-duplicate-letters/description/) 
| 344 |                  [ Reverse String ](https://leetcode.com/problems/reverse-string/description/) 
| 541 |               [ Reverse String 2 ](https://leetcode.com/problems/reverse-string-ii/description/) 
| 561 |                 [Array Partition ](https://leetcode.com/problems/array-partition/description/) 
| 622 |           [Design Circular Queue ](https://leetcode.com/problems/design-circular-queue/description/) 
| 622 |           [Design Circular Deque ](https://leetcode.com/problems/design-circular-deque/description/) 
| 680 |              [Valid Palindrome 2 ](https://leetcode.com/problems/valid-palindrome-ii/description/) 
| 739 |              [Daily Temperatures ](https://leetcode.com/problems/daily-temperatures/description/) 
| 819 |                [Most Common Word ](https://leetcode.com/problems/most-common-word/description/) 
| 937 |       [Reorder Data in Log Files ](https://leetcode.com/problems/reorder-data-in-log-files/description/) 
| 937 |            [K Closest Points to Origin ](https://leetcode.com/problems/k-closest-points-to-origin/)

| Difficulty | Solution                           | --------------:|:-----------|:-----------------------------------| | Easy       | [Solution](leetcode/easy/1.md) | Medium     | [Solution](leetcode/medium/15.md) | Easy       | [Solution](leetcode/easy/20.md) | Hard       | [Solution](leetcode/hard/23.md) | Hard       | [Solution](leetcode/hard/42.md) | Medium     | [Solution](leetcode/medium/49.md) /description/) | Easy       | [Solution](leetcode/easy/121.md) | Easy       | [Solution](leetcode/easy/125.md) | Easy       | [Solution](leetcode/easy/225.md) | Easy       | [Solution](leetcode/easy/232.md) | Medium     | [Solution](leetcode/medium/238.md) | Medium     | [Solution](leetcode/medium/316.md) | Easy       | [Solution](leetcode/easy/344.md) | Easy       | [Solution](leetcode/easy/541.md) | Easy       | [Solution](leetcode/easy/561.md) | Medium     | [Solution](leetcode/medium/622.md) | Medium     | [Solution](leetcode/medium/641.md) | Easy       | [Solution](leetcode/easy/680.md) | Medium     | [Solution](leetcode/medium/739.md) | Easy       | [Solution](leetcode/easy/819.md) | Medium     | [Solution](leetcode/medium/937.md) | Medium     | [Solution](leetcode/medium/973.md)

- 2266

- 2273

## ✨ 백준

| 번호    | 문제                                                 | 닌이도                   | 코드                                          |

|:------|:---------------------------------------------------|:----------------------|:--------------------------------------------

| 1717  | [집합의 표현](https://www.acmicpc.net/problem/1717)     | Union & Find , 서로소 집합 | [코드](src/com/company/boj/gold05/1717.md)    |

| 1753  | 최단경로                                               | 골드 4                  | [코드](boj/gold4/1753.md)                     |

| 2606  | 바이러스                                               | 실버 3                  | [코드](src/com/company/boj/silver03/2606.md)  |

| 5567  | 결혼식                                                | 실버 2                  | [코드](boj/silver2/5567.md)                   |

| 11724 | 연결 요소의 개수                                          | 실버2                   | [코드](src/com/company/boj/silver02/11724.md) |

| 11725 | [트리의 부모 찾기](https://www.acmicpc.net/problem/11725) | 그래프 탐색 , DFS          | [코드](src/com/company/boj/silver02/11725.md) |

| 15649 | N 과 M (1)                                          | 실버 3                  | [코드](boj/silver3/15649.md)                  |

| 15650 | N 과 M (2)                                          | 실버 3                  | [코드](boj/silver3/15650.md)                  |

| 15651 | N 과 M (3)                                          | 실버 3                  | [코드](boj/silver3/15651.md)                  |

| 15652 | N 과 M (4)                                          | 실버 3                  | [코드](boj/silver3/15652.md)                  |

| 15654 | N 과 M (5)                                          | 실버 3                  | [코드](boj/silver3/15654.md)                  |

| 15655 | N 과 M (6)                                          | 실버 3                  | [코드](boj/silver3/15655.md)                  |

| 15656 | N 과 M (7)                                          | 실버 3                  | [코드](boj/silver3/15656.md)                  |

| 15657 | N 과 M (8)                                          | 실버 3                  | [코드](boj/silver3/15656.md)                  |

| 17835 | 면접보는 승범이네                                          | 골드 2                  | [코드](boj/gold2/17835.md)                    |

## 👻 프로그래머스

| #      | 문제                                                                          | 레벨   | 코드                                                    |

|:-------|:----------------------------------------------------------------------------|------|:------------------------------------------------------

| 1844   | [게임 맵 최단 거리](https://programmers.co.kr/learn/courses/30/lessons/)           | Lv.2 | [코드](src/com/company/programmers/level2/게임맵최단거리.md)   |

| 12903  | 가운데 글자 가져오기                                                                 | Lv.1 | [코드](programmers/level01/가운데글자가져오기.md)                |

| 12906  | 같은 숫자는 싫어                                                                   | Lv.1 | [코드](programmers/level01/같은숫자는싫어.md)                  |

| 12915  | 문자열 내 마음대로 정렬하기                                                             | Lv.1 | [코드](src/com/company/programmers/level1/문자열마음대로정렬.md) |

| 12921  | 소수 찾기                                                                       | Lv.1 | [코드](src/com/company/programmers/level1/소수찾기.md)      |

| 12930  | 이상한 문자 만들기                                                                  | Lv.1 | [코드](programmers/level01/이상한문자만들기.md)                 |

| 12939  | 최댓값과 최솟값                                                                    | Lv.2 | [코드](programmers/level02/최댓값과최솟값.md)                  |

| 12941  | 최솟값 만들기                                                                     | Lv.2 | [코드](programmers/level02/최솟값만들기.md)                   |

| 12948  | 핸드폰 번호 가리기                                                                  | Lv.1 | [코드](programmers/level01/핸드폰번호가리기.md)                 |

| 12954  | x만큼 간격이 있는 n개의 숫자                                                           | Lv.1 | [코드](programmers/level01/x만큼간격.md)                    |

| 42584  | 주식가격                                                                        | Lv.2 | [코드](src/com/company/programmers/level2/주식가격.md)      |

| 42746  | 가장 큰 수                                                                      | Lv.2 | [코드](src/com/company/programmers/level2/가장큰수.md)      |

| 42839  | 소수 찾기                                                                       | Lv.2 | [코드](src/com/company/programmers/level2/소수찾기.md)      |

| 67257  | 수식 최대화                                                                      | Lv.2 | [코드](src/com/company/programmers/level2/수식최대화.md)     |

| 68644  | 두 개 뽑아서 더하기                                                                 | Lv.1 | [코드](src/com/company/programmers/level1/두개뽑아서더하기.md)  |

| 70128  | 내적                                                                          | Lv.1 | [코드](src/com/company/programmers/level1/내적.md)        |

| 72412  | 순위 검색                                                                       | Lv.2 | [코드](src/com/company/programmers/level2/순위검색.md)      |

| 76501  | 음양 더하기                                                                      | Lv.1 | [코드](programmers/level01/음양더하기.md)                    |

| 76502  | 괄호 회전하기                                                                     | Lv.2 | [코드](src/com/company/programmers/level2/괄호회전하기.md)    |

| 87389  | 나머지가 1이 되는 수 찾기                                                             | Lv.1 | [코드](programmers/level01/나머지가1이되는.md)                 |

| 87946  | 피로도                                                                         | Lv.2 | [코드](programmers/level02/피로도.md)                      |

| 92341  | 주차 요금 계산                                                                    | Lv.2 | [코드](src/com/company/programmers/level2/주차요금계산.md)    |

| 120583 | 중복된 숫자 개수                                                                   | Lv.0 | [코드](programmers/level00/중복된숫자.md)                    

| 120803 | 두수의 차                                                                       | Lv.0 | [코드](programmers/level00/두수의차.md)                     |

| 120806 | 두수의 나눗셈                                                                     | Lv.0 | [코드](programmers/level00/두수의나눗셈.md)                   |

| 120811 | 중앙값 구하기                                                                     | Lv.0 | [코드](programmers/level00/중앙값구하기.md)                   |

| 120815 | 피자 나눠먹기 (2)                                                                 | Lv.0 | [코드](programmers/level00/피자나눠먹기2.md)                  |

| 120816 | 피자 나눠먹기 (3)                                                                 | Lv.0 | [코드](programmers/level00/피자나눠먹기3.md)                  |

| 120818 | 옷가게 할인 받기                                                                   | Lv.0 | [코드](src/com/company/programmers/level0/옷가게할인.md)     |

| 120823 | 직각 삼각형 출력하기                                                                 | Lv.0 | [코드](src/com/company/programmers/level0/직각삼각형.md)     |

| 120825 | 문자 반복 출력하기                                                                  | Lv.0 | [코드](src/com/company/programmers/level0/문자반복출력하기.md)  |

| 120833 | 배열 자르기                                                                      | Lv.0 | [코드](src/com/company/programmers/level0/배열자르기.md)     |

| 120834 | 외계행성의 나이                                                                    | Lv.0 | [코드](src/com/company/programmers/level0/외계행성의나이.md)   |

| 120835 | 진료순서 정하기                                                                    | Lv.0 | [코드](src/com/company/programmers/level0/진료순서정하기.md)   |

| 120852 | 소인수분해                                                                       | Lv.0 | [코드](programmers/level00/소인수분해.md)                    |

| 120854 | 배열 원소의 길이                                                                   | Lv.0 | [코드](src/com/company/programmers/level0/배열원소의길이.md)   |

| 120869 | 외계어 사전                                                                      | Lv.0 | [코드](src/com/company/programmers/level0/외계어사전.md)     |

| 120888 | 중복된 문자 제거                                                                   | Lv.0 | [코드](programmers/level00/중복된문자제거.md)                  |

| 120904 | 숫자 찾기                                                                       | Lv.0 | [코드](src/com/company/programmers/level0/숫자찾기.md)      |

| 120905 | n의 배수 구하기                                                                   | Lv.0 | [코드](src/com/company/programmers/level0/배수고르기.md)     |

| 120910 | 세균 증식                                                                       | Lv.0 | [코드](src/com/company/programmers/level0/세균증식.md)      |

| 120911 | 문자열 정렬하기(2)                                                                 | Lv.0 | [코드](src/com/company/programmers/level0/문자열정렬하기.md)   |

| Lv.1   | [신고 결과 받기 ](https://programmers.co.kr/learn/courses/30/lessons/92334)       |      | [코드](src/com/company/programmers/level1/신고결과받기.md)    |

| Lv.1   | [성격 유형 검사하기 ](https://programmers.co.kr/learn/courses/30/lessons/118666)    |      | [코드](src/com/company/programmers/level1/성격유형검사.md)    |

| 120956 | 옹알이 (1)                                                                     | Lv.0 | [코드](programmers/level00/옹알이1.md)                     |

| 131127 | 할인 행사                                                                       | Lv.2 | [코드](src/com/company/programmers/level2/할인행사.md)      |

| 131128 | 숫자 짝꿍                                                                       | Lv.1 | [코드](src/com/company/programmers/level1/숫자짝꿍.md)      |

| 131705 | 삼총사                                                                         | Lv.1 | [코드](programmers/level01/삼총사.md)                      |

| 133502 | 햄버거 만들기                                                                     | Lv.1 | [코드](src/com/company/programmers/level1/햄버거만들기.md)    |

| 134240 | 푸드 파이트 대회                                                                   | Lv.1 | [코드](src/com/company/programmers/level1/푸드파이트대회.md)   |

| Lv.1   | [옹알이(2) ](https://programmers.co.kr/learn/courses/30/lessons/133499)        |      | [코드](src/com/company/programmers/level1/옹알이(2).md)    |

| 135808 | 과일 장수                                                                       | Lv.1 | [코드](src/com/company/programmers/level1/과일장수.md)      |

| 136798 | 기사단원의 무기                                                                    | Lv.1 | [코드](src/com/company/programmers/level1/기사단원의무기.md)   |

| 138477 | 명예의 전당 (1)                                                                  | Lv.1 | [코드](programmers/level01/명예의전당1.md)                   |

| 140108 | 문자열 나누기                                                                     | Lv.1 | [코드](src/com/company/programmers/level1/문자열나누기.md)    |

| 142086 | 가장 가까운 같은 글자                                                                | Lv.1 | [코드](programmers/level01/가장가까운글자.md)                  |

| 147355 | 크기가 작은 부분 문자열                                                               | Lv.1 | [코드](programmers/level01/크기가작은문자열.md)                 |

| 150370 | 개인정보 수집 유효기간                                                                | Lv.1 | [코드](src/com/company/programmers/level1/개인정보수집.md)    |

| 154538 | 숫자 변환하기                                                                     | Lv.2 | [코드](src/com/company/programmers/level2/숫자변환하기.md)    |

| 154539 | 뒤에 있는 큰 수 찾기                                                                | Lv.2 | [코드](src/com/company/programmers/level2/뒤에있는큰수.md)    |

| 155652 | 둘만의 암호                                                                      | Lv.1 | [코드](src/com/company/programmers/level1/둘만의암호.md)     |

| 159994 | 카드 뭉치                                                                       | Lv.1 | [코드](programmers/level01/카드뭉치.md)                     |

| 160586 | 대충 만든 자판                                                                    | Lv.1 | [코드](src/com/company/programmers/level1/대충만든자판.md)    |

| 161989 | 덧칠하기                                                                        | Lv.1 | [코드](src/com/company/programmers/level1/덧칠하기.md)      |

| 161990 | 바탕화면 정리                                                                     | Lv.1 | [코드](src/com/company/programmers/level1/바탕화면정리.md)    |

| 172928 | 공원 산책                                                                       | Lv.1 | [코드](src/com/company/programmers/level1/공원산책.md)      |

| 176963 | 추억 점수                                                                       | Lv.1 | [코드](src/com/company/programmers/level1/추억점수.md)      |

| 178871 | 달리기 경주                                                                      | Lv.1 | [코드](src/com/company/programmers/level1/달리기경주.md)     |

| 181830 | 정사각형으로 만들기                                                                  | Lv.0 | [코드](src/com/company/programmers/level0/정사각형으로만들기.md) |

| 181849 | 문자열 정수의 합                                                                   | Lv.0 | [코드](programmers/level00/문자열정수의합.md)                  |

| 181851 | 전국 대회 선발 고사                                                                 | Lv.0 | [코드](src/com/company/programmers/level0/전국대회선발고사.md)  |

| 181852 | 뒤에서 5등 위로                                                                   | Lv.0 | [코드](src/com/company/programmers/level0/뒤에서5등위로.md)   |

| 181855 | 문자열 묶기                                                                      | Lv.0 | [코드](src/com/company/programmers/level0/문자열묶기.md)     |

| 181857 | 배열의 길이를 2의 거듭제곱으로 만들기                                                       | Lv.0 | [코드](src/com/company/programmers/level0/배열길이2의거듭.md)  |

| 181862 | 세 개의 구분자                                                                    | Lv.0 | [코드](programmers/level00/세개의구분자.md)                   |

| 181867 | x 사이의 개수                                                                    | Lv.0 | [코드](programmers/level00/x사이의개수.md)                   |

| 181871 | 문자열이 몇 번 등장하는지 세기                                                           | Lv.0 | [코드](programmers/level00/문자열몇번.md)                    |

| 181872 | 특정 문자열로 끝나는 가장 긴 부분 문자열 찾기                                                  | Lv.0 | [코드](programmers/level00/특정문자열.md)                    |

| 181906 | 접두사인지 확인하기                                                                  | Lv.0 | [코드](programmers/level00/접두사인지확인하기.md)                |

| 181908 | 접미사인지 확인하기                                                                  | Lv.0 | [코드](programmers/level00/접미사인지확인하기.md)                |

| 181909 | 접미사 배열                                                                      | Lv.0 | [코드](programmers/level00/접미사배열.md)                    |

| 181940 | 문자열 곱하기                                                                     | Lv.0 | [코드](src/com/company/programmers/level0/문자열곱하기.md)    |

| Lv.1   | [데이터 분석](https://programmers.co.kr/learn/courses/30/lessons/250121)         |      | [코드](src/com/company/programmers/level1/데이터분석.md)     |

| 250126 | PCCE 기출문제 / 창고 정리                                                           | Lv.0 | [코드](programmers/level00/창고정리.md)                     |

| 258712 | 가장 많이 받은 선물                                                                 | Lv.1 | [코드](programmers/level01/가장많이받은선물.md)                 |

| 340198 | [PCCE 기출문제 10번 ] 공원                                                         | Lv.1 | [코드](programmers/level01/공원.md)                       |

| 340199 | [PCCE 기출문제 9번 ]지폐 접기                                                        | Lv.1 | [코드](programmers/level01/지폐접기.md)                     |

| 340213 | [PCCP 기출문제 1번 ] / 동영상 재생기                                                   | Lv.1 | [코드](programmers/level01/동영상재생기.md)                   |

| 388351 | 유연 근무제                                                                      | Lv.1 | [코드](programmers/level01/유연근무제.md)                    |

| Lv.2   | [기능 개발](https://programmers.co.kr/learn/courses/30/lessons/42586)           |      | [코드](src/com/company/programmers/level2/기능개발.md)      |

| Lv.2   | [큰 수 만들기](https://programmers.co.kr/learn/courses/30/lessons/42883)         |      | [코드](src/com/company/programmers/level2/큰수만들기.md)     |

| Lv.2   | [타겟 넘버](https://programmers.co.kr/learn/courses/30/lessons/43165)           |      | [코드](src/com/company/programmers/level2/타겟넘버.md)      |

| Lv.2   | [쿼드압축 후 개수 세기](https://programmers.co.kr/learn/courses/30/lessons/68936)    |      | [코드](src/com/company/programmers/level2/쿼드압축후개수세기.md) |

| Lv.2   | [전력망을 둘로 나누기  ](https://programmers.co.kr/learn/courses/30/lessons/86971)   |      | [코드](src/com/company/programmers/level2/전력망둘로나누기.md)  |

| Lv.2   | [숫자 카드 나누기](https://programmers.co.kr/learn/courses/30/lessons/135807)      |      | [코드](src/com/company/programmers/level2/숫자카드나누기.md)   |

| Lv.2   | [연속 부분 수열 합의 개수](https://programmers.co.kr/learn/courses/30/lessons/131701) |      | [코드](src/com/company/programmers/level2/연속부분수열.md)    |

| Lv.2   | [귤 고르기](https://programmers.co.kr/learn/courses/30/lessons/138476)          |      | [코드](programmers/level02/귤고르기.md)                     |

| Lv.2   | [디펜스 게임](https://programmers.co.kr/learn/courses/30/lessons/142085)         |      | [코드](src/com/company/programmers/level2/디펜스게임.md)     |

| Lv.2   | [이모티콘 할인행사](https://programmers.co.kr/learn/courses/30/lessons/150368)      |      | [코드](programmers/level02/이모티콘할인행사.md)                 |

| Lv.2   | [무인도 여행](https://programmers.co.kr/learn/courses/30/lessons/154540)         |      | [코드](src/com/company/programmers/level2/무인도여행.md)     |

| Lv.2   | [호텔 대실](https://programmers.co.kr/learn/courses/30/lessons/155651)          |      | [코드](src/com/company/programmers/level2/호텔대실.md)      |

| Lv.2   | [리코챗 로봇](https://programmers.co.kr/learn/courses/30/lessons/169199)         |      | [코드](src/com/company/programmers/level2/리코챗로봇.md)     |

| Lv.2   | [광물 캐기](https://programmers.co.kr/learn/courses/30/lessons/172927)          |      | [코드](src/com/company/programmers/level2/광물캐기.md)      |

| Lv.2   | [과제 진행 하기](https://programmers.co.kr/learn/courses/30/lessons/176962)       |      | [코드](src/com/company/programmers/level2/과제진행하기.md)    |

| Lv.3   | [보행자 천국](https://programmers.co.kr/learn/courses/30/lessons/1832)           |      | [코드](src/com/company/programmers/level3/보행자천국.md)     |

- [동빈북](src/com/company/dongbinbook/동빈북.md)

- [참고](src/com/company/good/read.md)
ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

https://github.com/connieya/java_algorithm

Awesome Lists containing this project

README
