끄적끄적 보니타

https://ko.reactjs.org/ React – 사용자 인터페이스를 만들기 위한 JavaScript 라이브러리 A JavaScript library for building user interfaces ko.reactjs.org https://javascript.plainenglish.io/5-advanced-react-patterns-a6b7624267a6 5 Advanced React Patterns An overview of 5 modern advanced React patterns, including integration codes, pros and cons, and concrete usage within public libraries. javascript.plainenglish.io ht..

https://developer.mozilla.org/ko/docs/Web/API/Selection selection - Web API | MDN A Selection object represents the range of text selected by the user or the current position of the caret. To obtain a Selection object for examination or manipulation, call window.getSelection(). developer.mozilla.org https://developer.mozilla.org/ko/docs/Web/API/Range range - Web API | MDN Range 객체는 주어진 document ..

VS Code 애플리케이션 내 extension이 제대로 동작하지 않는다. 프록시 문제인지 뭔지 extension을 제대로 받아오지 못해서 방법을 찾다가 유용한거 같아 쓴다. https://www.alphr.com/vs-code-how-to-install-extensions/ VS Code How to Install Extensions Visual Studio Code is a sophisticated piece of software that most people use to start their programming journey. Its robust features, cross-compatibility, the range of programming languages make it one of the ..

https://swexpertacademy.com/main/code/referenceCode/referenceCodeDetail.do?referenceId=test01&category=DataStructure SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com C언어 답안 #include int main(void) { int stack[100] = { 0, }; int tc_cnt, data_size; scanf("%d", &tc_cnt); for (int i=0; i

https://swexpertacademy.com/main/code/referenceCode/referenceCodeDetail.do?referenceId=AVuoqWnqAADw5fUK&category=DataStructure SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com C언어 답안 #include int main(void) { int stack[100] = { 0, }; int tc_cnt, data_size; scanf("%d", &tc_cnt); for (int i=0; i= 0; ds--) { printf("%d ", stack[ds]); } printf("\n"); } } 결과

알고리즘 BFS (너비 우선 탐색 알고리즘) https://gmlwjd9405.github.io/2018/08/15/algorithm-bfs.html [알고리즘] 너비 우선 탐색(BFS)이란 - Heee's Development Blog Step by step goes a long way. gmlwjd9405.github.io DFS (깊이 우선 탐색 알고리즘) https://gmlwjd9405.github.io/2018/08/14/algorithm-dfs.html [알고리즘] 깊이 우선 탐색(DFS)이란 - Heee's Development Blog Step by step goes a long way. gmlwjd9405.github.io 백트래킹 https://chanhuiseok.github.io/..

https://symless.com/synergy Synergy - Share one mouse & keyboard across computers | Keyboard mouse monitor switch Synergy software shares one mouse & one keyboard between multiple computers & monitors. Easy download, install & configuration. A Symless product. symless.com Synergy 무료 버전을 설치하려고 했더니 더이상 공급하지 않는다고 한다,. 구매 후 30일안까지 환불 정책만 있는듯 ,.,까비,. 그래서 찾은 대안이 barrier https://github.com/debauchee/ba..

문제) www.codewars.com/kata/52742f58faf5485cae000b9a/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def format_duration(seconds): if seconds == 0: return "now" time = { "sec": seconds, "min": 0, "hour": 0, "day": 0, "year": 0 } a_to_b(t..

문제) www.codewars.com/kata/552c028c030765286c00007d/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def iq_test(numbers): remain = [ int(num)%2 for num in numbers.split(' ')] for i in range(len(remain) - 2): if (remain[i] != remain[i+1]..

문제) www.codewars.com/kata/54da539698b8a2ad76000228/train/python Codewars: Achieve mastery through challenge Codewars is where developers achieve code mastery through challenge. Train on kata in the dojo and reach your highest potential. www.codewars.com 내가 푼 답) def is_valid_walk(walk): if (len(walk) != 10): return False ns = [1 for w in walk if w == 'n'] ss = [1 for w in walk if w == 's'] es = [..