Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/dl0312/ps
π¨βπ» Problem Solving Everyday
https://github.com/dl0312/ps
javascript problem-solving python python3
Last synced: 18 days ago
JSON representation
π¨βπ» Problem Solving Everyday
- Host: GitHub
- URL: https://github.com/dl0312/ps
- Owner: dl0312
- Created: 2019-04-13T08:15:35.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2019-09-06T17:20:08.000Z (about 5 years ago)
- Last Synced: 2024-10-11T21:24:40.171Z (about 1 month ago)
- Topics: javascript, problem-solving, python, python3
- Language: Python
- Homepage:
- Size: 54.7 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# π¨βπ» Algorithm Problem Solving
This repository is for Algorithm Problem Solving study. It contains algorithm problem & solution from basic algorithm to corporate coding test problems.## π©βπ» Coding Test Website
* [Programmers](https://www.welcomekakao.com/learn/challenges): Programmers
* [Naver Hackday](https://github.com/NAVER-CAMPUS-HACKDAY/common): Naver Campus Hackday Coding Test
* [Kakao Blind Recruit](http://tech.kakao.com/2018/09/21/kakao-blind-recruitment-for2019-round-1/): Kakao Blind Recruit Coding Test
* [Baekjoon Online Judge](https://www.acmicpc.net/): BOJ
## π Directories / Python
* π [programmers](./programmers)
* π [dfs & bfs](./programmers/dfs%20&%20bfs)
* [λ¨μ΄ λ³ν](./programmers/dfs%20&%20bfs/word_convert.py)
* [μ¬ν κ²½λ‘](./programmers/dfs%20&%20bfs/travel_path.py)
* π [binary search](./programmers/binary%20search)
* [μμ°](./programmers/binary%20search/budget.py)
* [μ κ΅μ¬μ¬](./programmers/binary%20search/immigration.py)
* π [backtracking](/programmers/backtracking)
* [N-Queen](/programmers/backtracking/n-queen.py)
* π [dynamic programming](./programmers/dynamic%20programming)
* [κ°μ₯ κΈ΄ ν°λ¦°λλ‘](./programmers/dynamic%20programming/longest_palindrome.py)
* [λ±κ΅£κΈΈ](./programmers/dynamic%20programming/school_road.py)
* [λ©λ¦¬ λ°κΈ°](./programmers/dynamic%20programming/super_jump.py)
* [κ±°μ€λ¦λ](./programmers/dynamic%20programming/charge.py)
* [3 x n νμΌλ§](/programmers/dynamic%20programming/3xn_tiling.py)
* π [greedy](./programmers/greedy)
* [ν° μ λ§λ€κΈ°](./programmers/greedy/ν°_μ_λ§λ€κΈ°.py)
* [ꡬλͺ 보νΈ](./programmers/greedy/ꡬλͺ 보νΈ.py)
* [μ‘°μ΄μ€ν±](./programmers/greedy/joystick.py)
* [λ¨μμΉ΄λ©λΌ](/programmers/greedy/cctv.py)
* [μ μΈ](/programmers/greedy/scale.py)
* [μ¬ μ°κ²°νκΈ°](/programmers/greedy/connect_island.py)
* π [hash](./programmers/hash)
* [λ² μ€νΈμ¨λ²](./programmers/hash/λ² μ€νΈμ¨λ².py)
* π [heap](./programmers/heap)
* [λ 맡κ²](./programmers/heap/λ_맡κ².py)
* [λΌλ©΄ 곡μ₯](./programmers/heap/rameaum.py)
* [μ΄μ€μ°μ μμν](./programmers/heap/double_priority_queue.py)
* [λμ€ν¬ 컨νΈλ‘€λ¬](./programmers/heap/disk_controller.py)
* π [sort](./programmers/sort)
* [H-Index](./programmers/sort/H-Index.py)
* [κ°μ₯ ν° μ](./programmers/sort/κ°μ₯_ν°_μ.py)
* π [graph](./programmers/graph)
* [κ°μ₯ λ¨Ό λ Έλ](./programmers/graph/farthest_node.py)
* [λ°°λ¬](/programmers/graph/delivery.py)
* [μμ](/programmers/graph/ranking.py)
* [λ λ°λ¨ΉκΈ°](./programmers/λ λ°λ¨ΉκΈ°.py)
* [μ€ν¬νΈλ¦¬](./programmers/μ€ν¬νΈλ¦¬.py)
* [JadenCase λ¬Έμμ΄ λ§λ€κΈ°](./programmers/jadencase.py)
* [μμ΄ λλ§μκΈ°](./programmers/end_to_end.py)
* [ν°μΌλͺ¬](./programmers/phonekemon.py)
* [μμ λ§λ€κΈ°](./programmers/prime_maker.py)
* [μμ λμ§ν](./programmers/tournament.py)
* [μ νμ μκ° μ΄λ](./programmers/jump_teleport.py)
* [μ§μ§μ΄ μ κ±°νκΈ°](./programmers/pair_it.py)
* [μ΅κ³ μ μ§ν©](./programmers/best_set.py)
* [μΌκ·Ό μ§μ](./programmers/night_work_parameter.py)
* [μ€ μλ λ°©λ²](./programmers/line_method.py)
* [νλ Έμ΄μ ν](./programmers/tower_of_hanoi.py)
* [μ«μ κ²μ](./programmers/number_game.py)
* [λ°©λ¬Έ κΈΈμ΄](/programmers/walking_length.py)
* [κΈ°μ§κ΅ μ€μΉ](/programmers/base_stations.py)
* [λ μ μ μ¬μ΄μ ν©](/programmers/between_two_numbers.py)
* [μ¬λ°λ₯Έ κ΄νΈμ κ°―μ](/programmers/right_brackets.py)
* [μ μ μ μΆ μ€μΌμ€λ§](/programmers/FIFO_scheduling.py)
* [μ«μ λΈλ‘](/programmers/number_block.py)
* π [naver_hackday](./naver_campus_hackday): Naver Campus Hackday
* π [2019_naver_campus_hackday_summer](./naver_campus_hackday/2019_naver_campus_hackday_summer)
* [01](./naver_campus_hackday/2019_naver_campus_hackday_summer/01.py)
* [02](./naver_campus_hackday/2019_naver_campus_hackday_summer/02.py)
* [03](./naver_campus_hackday/2019_naver_campus_hackday_summer/03.py)
* π [kakao blind recruitment](./kakao%20blind%20recruitment)
* π [2017 kakao blind recruitment](./kakao%20blind%20recruitment/2017%20kakao%20blind%20recruitment)
* [μΊμ](./kakao%20blind%20recruitment/2017%20kakao%20blind%20recruitment/cache.py)
* [보물μ§λ](./kakao%20blind%20recruitment/2017%20kakao%20blind%20recruitment/treasure_map.py)
* π [2018 kakao blind recruitment](./kakao%20blind%20recruitment/2018%20kakao%20blind%20recruitment)
* [μ€ν μ±ν λ°©](./kakao%20blind%20recruitment/2018%20kakao%20blind%20recruitment/open_chat.py)
* [μ€ν¨μ¨](./kakao%20blind%20recruitment/2018%20kakao%20blind%20recruitment/fail_rate.py)
* [ν보ν€](./kakao%20blind%20recruitment/2018%20kakao%20blind%20recruitment/candidate_key.py)
* [무μ§μ λ¨Ήλ°© λΌμ΄λΈ](./kakao%20blind%20recruitment/2018%20kakao%20blind%20recruitment/muzi_mukbang.py)
* [κΈΈμ°ΎκΈ° κ²μ](./kakao%20blind%20recruitment/2018%20kakao%20blind%20recruitment/find_way_game.py)
* π [sp_pj4](./sp_pj4): Sogang Univ. System Programming Python HW
* [p1](./sp_pj4/p1.ipynb)
* [p2](./sp_pj4/p2.ipynb)
* [p3](./sp_pj4/p3.ipynb)
* [p4](./sp_pj4/p4.ipynb)
## π Directories / JavaScript
* π [programmers](./programmers)
* [λ μ μ μ¬μ΄μ ν©](/programmers/between_two_numbers.js)