Recent posts in Jaehee.devhttps://jaehee.dev/https://jaehee.dev/posts/leetcode---24-swap-nodes-in-pairs/https://jaehee.dev/posts/leetcode---24-swap-nodes-in-pairs/주어진 연결 리스트의 근접 노드와 짝을 지어 swap 합니다.Thu, 09 Dec 2021 13:26:34 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---23-merge-k-sorted-lists/https://jaehee.dev/posts/leetcode---23-merge-k-sorted-lists/정렬된 K개의 연결 리스트를 모두 하나의 연결 리스트로 합쳐야합니다.Wed, 08 Dec 2021 02:09:23 GMTLeetCodehardC++Jaehee Leehttps://jaehee.dev/posts/leetcode---22-generate-parentheses/https://jaehee.dev/posts/leetcode---22-generate-parentheses/정수 N이 주어질 때 N개의 소괄호로 이뤄지는 모든 조합을 생성합니다.Tue, 07 Dec 2021 07:25:05 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---21-merge-two-sorted-lists/https://jaehee.dev/posts/leetcode---21-merge-two-sorted-lists/정렬되어있는 두 연결 리스트를 하나로 합쳐야합니다.Mon, 06 Dec 2021 12:08:37 GMTLeetCodeeasyC++Jaehee Leehttps://jaehee.dev/posts/leetcode---20-valid-parentheses/https://jaehee.dev/posts/leetcode---20-valid-parentheses/주어진 문자열에서 열린 괄호과 닫힌 괄호가 올바르게 존재하는지 확인합니다.Fri, 03 Dec 2021 08:29:13 GMTLeetCodeeasyC++Jaehee Leehttps://jaehee.dev/posts/leetcode---19-remove-nth-node-from-end-of-list/https://jaehee.dev/posts/leetcode---19-remove-nth-node-from-end-of-list/단방향 연결 리스트의 끝에서 N번째 노드를 제거합니다.Wed, 01 Dec 2021 11:57:17 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---18-4sum/https://jaehee.dev/posts/leetcode---18-4sum/정수 배열 내 숫자 네 개를 더해 target 숫자를 구할 수 있는 모든 가짓수를 찾습니다.Mon, 29 Nov 2021 12:06:36 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---17-letter-combinations-of-a-phone-number/https://jaehee.dev/posts/leetcode---17-letter-combinations-of-a-phone-number/2에서 9사이의 숫자로 구성된 문자열 입력 시 핸드폰 키보드에 매핑되는 문자열 조합을 생성합니다.Fri, 26 Nov 2021 12:15:30 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---16-3sum-closest/https://jaehee.dev/posts/leetcode---16-3sum-closest/정수형 배열과 세 정수를 더했을 때 target 숫자와 가장 가까운 세 숫자의 덧셈을 반환합니다.Wed, 24 Nov 2021 04:27:00 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/vuejs---%EB%8F%99%EC%A0%81-import%EC%99%80-code-split/https://jaehee.dev/posts/vuejs---%EB%8F%99%EC%A0%81-import%EC%99%80-code-split/vue.js에서 json/js 파일을 동적으로 불러와 Lazy Loading을 수행하여 초기 로딩 속도 높이기Tue, 23 Nov 2021 09:15:44 GMTvuewebpackJaehee Leehttps://jaehee.dev/posts/leetcode---15-3sum/https://jaehee.dev/posts/leetcode---15-3sum/정수형 배열이 주어질 때 세 정수의 합이 0이 되는 모든 가짓수를 찾습니다.Mon, 22 Nov 2021 15:10:29 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---14-longest-common-prefix/https://jaehee.dev/posts/leetcode---14-longest-common-prefix/문자열 배열이 주어질때 문자열들 중 가장 긴 접두사를 찾습니다.Fri, 19 Nov 2021 11:33:21 GMTLeetCodeeasyC++Jaehee Leehttps://jaehee.dev/posts/leetcode---13-roman-to-integer/https://jaehee.dev/posts/leetcode---13-roman-to-integer/주어진 로마 숫자를 정수형 숫자로 변환합니다.Wed, 17 Nov 2021 11:30:00 GMTLeetCodeeasyC++Jaehee Leehttps://jaehee.dev/posts/leetcode---12-integer-to-roman/https://jaehee.dev/posts/leetcode---12-integer-to-roman/정수형 숫자가 주어질 때 로마 숫자로 변환합니다.Mon, 15 Nov 2021 14:01:00 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---11-container-with-most-water/https://jaehee.dev/posts/leetcode---11-container-with-most-water/다양한 길이를 가진 막대들을 이용해 가장 많은 액체를 담을 수 있는 양을 구합니다.Sat, 13 Nov 2021 14:26:00 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---10-regular-expression-matching/https://jaehee.dev/posts/leetcode---10-regular-expression-matching/정규 표현식 "."과 "*"을 구현하여 문자열에서 패턴을 탐색합니다.Wed, 10 Nov 2021 13:23:11 GMTLeetCodehardC++Jaehee Leehttps://jaehee.dev/posts/leetcode---9-palindrome-number/https://jaehee.dev/posts/leetcode---9-palindrome-number/입력된 정수가 회문인지 검사합니다.Mon, 08 Nov 2021 06:21:00 GMTLeetCodeeasyC++Jaehee Leehttps://jaehee.dev/posts/leetcode---8-string-to-integer-atoi/https://jaehee.dev/posts/leetcode---8-string-to-integer-atoi/입력된 문자열에서 정수를 Parsing하는 atoi 함수를 구현합니다.Mon, 08 Nov 2021 06:00:00 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---7-reverse-integer/https://jaehee.dev/posts/leetcode---7-reverse-integer/주어진 정수를 뒤집어(Reverse) 변환합니다.Mon, 08 Nov 2021 05:07:30 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---6-zigzag-conversion/https://jaehee.dev/posts/leetcode---6-zigzag-conversion/문자열을 지그재그로 변환합니다.Sun, 07 Nov 2021 10:29:40 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---5-longest-palindromic-substring/https://jaehee.dev/posts/leetcode---5-longest-palindromic-substring/주어진 문자열 중 가장 긴 회문(Palindrome)을 구합니다.Sat, 06 Nov 2021 14:49:00 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---4-median-of-two-sorted-arrays/https://jaehee.dev/posts/leetcode---4-median-of-two-sorted-arrays/정수 값이 담긴 두 정렬된 배열의 중앙값을 계산합니다.Fri, 29 Oct 2021 08:36:45 GMTLeetCodehardC++Jaehee Leehttps://jaehee.dev/posts/leetcode---3-longest-substring-without-repeating-characters/https://jaehee.dev/posts/leetcode---3-longest-substring-without-repeating-characters/문자열에서 똑같은 문자가 반복되지 않는, 가장 긴 부분 문자열을 찾아 반환해야 합니다. Sliding Window 기법과 C++ std::string_view를 이용해 가장 최적의 알고리즘을 작성해봅시다.Wed, 27 Oct 2021 12:47:50 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---2-add-two-numbers/https://jaehee.dev/posts/leetcode---2-add-two-numbers/연결 리스트로 표현되는 두 숫자를 더해 새로운 연결 리스트를 생성하여 반환해야 합니다.Tue, 26 Oct 2021 13:21:00 GMTLeetCodemediumC++Jaehee Leehttps://jaehee.dev/posts/leetcode---1-two-sum/https://jaehee.dev/posts/leetcode---1-two-sum/배열 내 두 숫자를 더하여 답을 만들 수 있는 배열의 원소를 찾아 인덱스를 반환해야 합니다.Sun, 24 Oct 2021 13:10:27 GMTLeetCodeeasyC++Jaehee Lee