https://github.com/connieya/java_algorithm

Java Algorithm Source Code Storage
https://github.com/connieya/java_algorithm

algorithm java ps

Last synced: 27 days 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 3 years ago)
• Default Branch: master
• Last Pushed: 2024-06-18T08:57:34.000Z (6 months ago)
• Last Synced: 2024-06-19T04:37:26.049Z (6 months ago)
• Topics: algorithm, java, ps
• Language: Java
• Homepage:
• Size: 1.34 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                                                      | Difficulty | Solution                           |

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

| 1   |                         [ Two Sum ](https://leetcode.com/problems/tow-sum/description/)                         | Easy       | [Solution](leetcode/easy/1.md)     

| 15  |                            [ 3Sum ](https://leetcode.com/problems/3sum/description/)                            | Medium     | [Solution](leetcode/medium/15.md)  

| 20  |               [ Valid Parentheses ](https://leetcode.com/problems/valid-parentheses/description/)               | Easy       | [Solution](leetcode/easy/20.md)    

| 23  |            [ Merge k Sorted Lists ](https://leetcode.com/problems/merge-k-sorted-lists/description/)            | Hard       | [Solution](leetcode/hard/23.md)    

| 42  |             [ Trapping Rain Water ](https://leetcode.com/problems/trapping-rain-water/description/)             | Hard       | [Solution](leetcode/hard/42.md)    

| 49  |                  [ Group Anagrams ](https://leetcode.com/problems/group-anagrams/description/)                  | Medium     | [Solution](leetcode/medium/49.md)  

| 121 | [ Best Time to Buy and Sell Stock ](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/) | Easy       | [Solution](leetcode/easy/121.md)   

| 125 |                      [ Valid Palindrome ](https://leetcode.com/problems/valid-palindrome/)                      | Easy       | [Solution](leetcode/easy/125.md)   

| 225 |                [ Implement Stack using Queues ](https://leetcode.com/problems/valid-palindrome/)                | Easy       | [Solution](leetcode/easy/225.md)   

| 232 |    [ Implement Queue using Stacks ](https://leetcode.com/problems/implement-queue-using-stacks/description/)    | Easy       | [Solution](leetcode/easy/232.md)   

| 238 |    [ Product of Array Except Self ](https://leetcode.com/problems/product-of-array-except-self/description/)    | Medium     | [Solution](leetcode/medium/238.md) 

| 316 |        [ Remove Duplicate Letters ](https://leetcode.com/problems/remove-duplicate-letters/description/)        | Medium     | [Solution](leetcode/medium/316.md) 

| 344 |                  [ Reverse String ](https://leetcode.com/problems/reverse-string/description/)                  | Easy       | [Solution](leetcode/easy/344.md)   

| 541 |               [ Reverse String 2 ](https://leetcode.com/problems/reverse-string-ii/description/)                | Easy       | [Solution](leetcode/easy/541.md)   

| 561 |                 [Array Partition ](https://leetcode.com/problems/array-partition/description/)                  | Easy       | [Solution](leetcode/easy/561.md)   

| 622 |           [Design Circular Queue ](https://leetcode.com/problems/design-circular-queue/description/)            | Medium     | [Solution](leetcode/medium/622.md) 

| 622 |           [Design Circular Deque ](https://leetcode.com/problems/design-circular-deque/description/)            | Medium     | [Solution](leetcode/medium/641.md) 

| 680 |              [Valid Palindrome 2 ](https://leetcode.com/problems/valid-palindrome-ii/description/)              | Easy       | [Solution](leetcode/easy/680.md)   

| 739 |              [Daily Temperatures ](https://leetcode.com/problems/daily-temperatures/description/)               | Medium     | [Solution](leetcode/medium/739.md) 

| 819 |                [Most Common Word ](https://leetcode.com/problems/most-common-word/description/)                 | Easy       | [Solution](leetcode/easy/819.md)   

| 937 |       [Reorder Data in Log Files ](https://leetcode.com/problems/reorder-data-in-log-files/description/)        | Medium     | [Solution](leetcode/medium/937.md) 

| 937 |            [K Closest Points to Origin ](https://leetcode.com/problems/k-closest-points-to-origin/)             | Medium     | [Solution](leetcode/medium/973.md) 

- 2266

- 2273

## ✨ 백준

| 번호    | 문제                                                 | 코멘트                   | 코드                                          |

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

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

| 2606  | [바이러스](https://www.acmicpc.net/problem/2606)       | Union & Find          | [코드](src/com/company/boj/silver03/2606.md)  |

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

| 15649 | [N 과 M (1)](https://www.acmicpc.net/problem/15649) | 백트래킹                  | [코드](boj/silver3/15649.md)                  |

| 15650 | [N 과 M (2)](https://www.acmicpc.net/problem/15650) | 백트래킹                  | [코드](boj/silver3/15650.md)                  |

## 👻 프로그래머스

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

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

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

| 68644  | 두 개 뽑아서 더하기                                                                      | Lv.1                                                        | [코드](src/com/company/programmers/level1/두개뽑아서더하기.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)                        |

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

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

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

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

| Lv.0   | [직각 삼각형 출력하기](https://programmers.co.kr/learn/courses/30/lessons/120823)         | for문 , 출력                                                   | [코드](src/com/company/programmers/level0/직각삼각형.md)     |

| Lv.0   | [문자 반복 출력하기](https://programmers.co.kr/learn/courses/30/lessons/120825)          | toCharArray()                                               | [코드](src/com/company/programmers/level0/문자반복출력하기.md)  |

| Lv.0   | [배열 자르기](https://programmers.co.kr/learn/courses/30/lessons/120833)              | 배열 , List                                                   | [코드](src/com/company/programmers/level0/배열자르기.md)     |

| Lv.0   | [외계행성의 나이](https://programmers.co.kr/learn/courses/30/lessons/120834)            | hashmap , 아스키코드                                             | [코드](src/com/company/programmers/level0/외계행성의나이.md)   |

| Lv.0   | [진료 순서 정하기](https://programmers.co.kr/learn/courses/30/lessons/120835)           | 이중 for 문                                                    | [코드](src/com/company/programmers/level0/진료순서정하기.md)   |

| Lv.0   | [배열 원소의 길이](https://programmers.co.kr/learn/courses/30/lessons/120854)           | 배열의 길이                                                      | [코드](src/com/company/programmers/level0/배열원소의길이.md)   |

| Lv.0   | [외계어 사전 ](https://programmers.co.kr/learn/courses/30/lessons/120869)             | HashMap , getOrDefault()                                    | [코드](src/com/company/programmers/level0/외계어사전.md)     |

| Lv.0   | [중복된 문자 제거 ](https://programmers.co.kr/learn/courses/30/lessons/120888)          | HashMap & containsKey , Set & LinkedHashSet , String & join | [코드](programmers/level0/중복된문자제거.md)                   |

| Lv.0   | [숫자 찾기](https://programmers.co.kr/learn/courses/30/lessons/120904)               | 자리수 계산, 문자열 , String.valueOf , indexOf                      | [코드](src/com/company/programmers/level0/숫자찾기.md)      |

| Lv.0   | [n의 배수 구하기](https://programmers.co.kr/learn/courses/30/lessons/120905)           | Arrays.stream , ArrayList                                   | [코드](src/com/company/programmers/level0/배수고르기.md)     |

| Lv.0   | [옹알이 (1)](https://programmers.co.kr/learn/courses/30/lessons/120956)             | replaceAll                                                  | [코드](programmers/level00/옹알이1.md)                     |

| Lv.0   | [세균 증식](https://programmers.co.kr/learn/courses/30/lessons/120910)               | 비트 연산자                                                      | [코드](src/com/company/programmers/level0/세균증식.md)      |

| Lv.0   | [문자열 정렬하기(2)](https://programmers.co.kr/learn/courses/30/lessons/120911)         | Arrays.sort() , toLowerCase() ,toCharArray()                | [코드](src/com/company/programmers/level0/문자열정렬하기.md)   |

| Lv.0   | [정사각형으로 만들기](https://programmers.co.kr/learn/courses/30/lessons/181830)          | 배열   , Math max                                             | [코드](src/com/company/programmers/level0/정사각형으로만들기.md) |

| Lv.0   | [뒤에서 5등 위로 ](https://programmers.co.kr/learn/courses/30/lessons/181852)          | Arrays.sort() , Arrays.copyOfRange                          | [코드](src/com/company/programmers/level0/뒤에서5등위로.md)   |

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

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

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

| Lv.0   | [문자열 곱하기](https://programmers.co.kr/learn/courses/30/lessons/181940)             | Lv.0                                                        | [코드](src/com/company/programmers/level0/문자열곱하기.md)    |

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

| Lv.1   | [문자열 내 마음대로 정렬하기 ](https://programmers.co.kr/learn/courses/30/lessons/12915)     | 구현 센스 , Comparator 람다                                       | [코드](src/com/company/programmers/level1/문자열마음대로정렬.md) |

| Lv.1   | [소수 찾기 ](https://programmers.co.kr/learn/courses/30/lessons/12921)               | 에라토스테네스의 체                                                  | [코드](src/com/company/programmers/level1/소수찾기.md)      |

| Lv.1   | [내적 ](https://programmers.co.kr/learn/courses/30/lessons/70128)                  | IntStream , range , sum                                     | [코드](src/com/company/programmers/level1/내적.md)        |

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

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

| Lv.1   | [숫자 짝꿍 ](https://programmers.co.kr/learn/courses/30/lessons/131128)              | 배열 LookUp 테이블 , 문자열 -> 숫자 , 숫자 -> 문자열 변환 , repeat           | [코드](src/com/company/programmers/level1/숫자짝꿍.md)      |

| Lv.1   | [옹알이(2) ](https://programmers.co.kr/learn/courses/30/lessons/133499)             | List Contains , 문자열 구현  ,replace                            | [코드](src/com/company/programmers/level1/옹알이(2).md)    |

| Lv.1   | [햄버거 만들기 ](https://programmers.co.kr/learn/courses/30/lessons/133502)            | ArrayList , remove   , 배열 ,구현                               | [코드](src/com/company/programmers/level1/햄버거만들기.md)    |

| Lv.1   | [푸드 파이트 대회 ](https://programmers.co.kr/learn/courses/30/lessons/134240)          | StringBuilder reverse , repeat                              | [코드](src/com/company/programmers/level1/푸드파이트대회.md)   |

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

| Lv.1   | [기사단원의 무기 ](https://programmers.co.kr/learn/courses/30/lessons/136798)           | 약수 구하기, 구현                                                  | [코드](src/com/company/programmers/level1/기사단원의무기.md)   |

| Lv.1   | [문자열 나누기 ](https://programmers.co.kr/learn/courses/30/lessons/140108)            | 문자열 구현                                                      | [코드](src/com/company/programmers/level1/문자열나누기.md)    |

| Lv.1   | [개인정보 수집 유효기간 ](https://programmers.co.kr/learn/courses/30/lessons/150370)       | 구현 , 날짜 계산                                                  | [코드](src/com/company/programmers/level1/문자열나누기.md)    |

| Lv.1   | [둘만의 암호](https://programmers.co.kr/learn/courses/30/lessons/155652)              | 구현 ,아스키 코드                                                  | [코드](src/com/company/programmers/level1/둘만의암호.md)     |

| Lv.1   | [대충 만든 자판](https://programmers.co.kr/learn/courses/30/lessons/160586)            | Map, 구현                                                     | [코드](src/com/company/programmers/level1/대충만든자판.md)    |

| Lv.1   | [덧칠하기 ](https://programmers.co.kr/learn/courses/30/lessons/161989)               | 그리드,   구현                                                   | [코드](src/com/company/programmers/level1/덧칠하기.md)      |

| Lv.1   | [바탕화면 정리](https://programmers.co.kr/learn/courses/30/lessons/161990)             | 구현                                                          | [코드](src/com/company/programmers/level1/바탕화면정리.md)    |

| Lv.1   | [공원 산책](https://programmers.co.kr/learn/courses/30/lessons/172928)               | HashMap , 구현                                                | [코드](src/com/company/programmers/level1/공원산책.md)      |

| Lv.1   | [추억 점수](https://programmers.co.kr/learn/courses/30/lessons/176963)               | HashMap , getOrDefault()                                    | [코드](src/com/company/programmers/level1/추억점수.md)      |

| Lv.1   | [달리기 경주](https://programmers.co.kr/learn/courses/30/lessons/178871)              | HashMap 자료구조                                                | [코드](src/com/company/programmers/level1/달리기경주.md)     |

| Lv.1   | [데이터 분석](https://programmers.co.kr/learn/courses/30/lessons/250121)              | HashMap , 2차원 배열 정렬 , Stream, Arrays.sort                   | [코드](src/com/company/programmers/level1/데이터분석.md)     |

| Lv.1   | [가장 많이 받은 선물](https://programmers.co.kr/learn/courses/30/lessons/258712)         | 구현                                                          | [코드](programmers/level01/가장많이받은선물.md)                 |

| 340199 | 지폐 접기                                                                            | Lv.1                                                        | [코드](programmers/level01/지폐접기.md)                  |

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

| Lv.2   | [주식가격](https://programmers.co.kr/learn/courses/30/lessons/42584)                 | 스택, 구현                                                      | [코드](src/com/company/programmers/level2/주식가격.md)      |

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

| Lv.2   | [소수 찾기](https://programmers.co.kr/learn/courses/30/lessons/42839)                | next_permutaition , dfs  ,완전 탐색                             | [코드](src/com/company/programmers/level2/소수찾기.md)      |

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

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

| Lv.2   | [수식 최대화](https://programmers.co.kr/learn/courses/30/lessons/67257)               | isDigit , next_permutation , dfs , 백트래킹 ,List remove        | [코드](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/72412)              | Map, 비트 연산 (부분 집합) , lower bound ,구현                        | [코드](src/com/company/programmers/level2/순위검색.md)      |

| Lv.2   | [괄호 회전하기  ](https://programmers.co.kr/learn/courses/30/lessons/76502)            | substring  ,  Stack , list  remove                          | [코드](src/com/company/programmers/level2/괄호회전하기.md)    |

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

| Lv.2   | [주차 요금 계산 ](https://programmers.co.kr/learn/courses/30/lessons/92341)            | Math.ceil() , Comparable                                    | [코드](src/com/company/programmers/level2/주차요금계산.md)    |

| Lv.2   | [할인 행사](https://programmers.co.kr/learn/courses/30/lessons/131127)               | Map 비교                                                      | [코드](src/com/company/programmers/level2/할인행사.md)      |

| Lv.2   | [숫자 카드 나누기](https://programmers.co.kr/learn/courses/30/lessons/135807)           | GCD, 최대 공약수 구하기                                             | [코드](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)               | HashMap ,정렬                                                 | [코드](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/154538)             | 큐 , BFS                                                     | [코드](src/com/company/programmers/level2/숫자변환하기.md)    |

| Lv.2   | [뒤에 있는 큰 수 찾기](https://programmers.co.kr/learn/courses/30/lessons/154539)        | Stack , 구현                                                  | [코드](src/com/company/programmers/level2/뒤에있는큰수.md)    |

| Lv.2   | [무인도 여행](https://programmers.co.kr/learn/courses/30/lessons/154540)              | 큐 , BFS  ,  Character.getNumericValue , List 정렬             | [코드](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)              | BFS , 구현, 큐                                                 | [코드](src/com/company/programmers/level2/리코챗로봇.md)     |

| Lv.2   | [광물 캐기](https://programmers.co.kr/learn/courses/30/lessons/172927)               | 구현 , List sort 정렬 람다  or  브루트 포스 , 백트래킹                     | [코드](src/com/company/programmers/level2/광물캐기.md)      |

| Lv.2   | [과제 진행 하기](https://programmers.co.kr/learn/courses/30/lessons/176962)            | 구현, Stack, 2차원 배열 정렬                                        | [코드](src/com/company/programmers/level2/과제진행하기.md)    |

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

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

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