부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/intersection-of-two-arrays-ii/description/ Intersection of Two Arrays II - LeetCode Can you solve this real interview question? Intersection of Two Arrays II - Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return leetcode.com 2. 문제 ..

1. 문제 링크 https://leetcode.com/problems/single-number-ii/description/ Single Number II - LeetCode Can you solve this real interview question? Single Number II - Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a lin leetcode.com 2. 문제 설명 정수로 구성된 array nums가 주어졌을..

1. 문제 링크 https://leetcode.com/problems/longest-consecutive-sequence/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 unsorted 된 정수로 구성된 nums가 주어졌을 때, 가장 긴 연속된 elements 순서의 길이를 반환 시간복잡도는 O(n)으로 작성할 것 예시1) nums = [10..

1. 문제 링크 https://leetcode.com/problems/move-zeroes/description/ Move Zeroes - LeetCode Can you solve this real interview question? Move Zeroes - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 정수로 구성된 array nums가 있을 때, 값이 0인 elements를 뒤로 옮기기. (그 외의 elements들은 상대적 순서를 유지해야 한다.) 여기서 ..

1. 문제 링크 https://leetcode.com/problems/missing-number/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 range[0,n] 사이의 숫자를 중복없이 포함하고 있는 nums라는 array가 주어졌을 때, range[0,n] 범위 해당 array에 빠진 숫자가 1개 있다고 할 때, 그 ..

1. 문제 링크 https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 preorder, inorder에 대한 array가 주어졌을 때, 여기서 preorder는 이진트리의 preorder tr..

1. 문제 링크 Summary Ranges - LeetCode LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 정렬된 정수 배열이 주어졌을 때, 연속된 범위를 요약하여 문자열의 리스트로 반환하는 것 예시) [0,1,2,4,5,7]이 주어지면, 이 배열을 연속된 범위로 요약하면 ["0->2","4->5","7"] 3. 처음 풀이 two point..

1. 문제 링크 https://leetcode.com/problems/contains-duplicate-ii/description/ Contains Duplicate II - LeetCode Can you solve this real interview question? Contains Duplicate II - Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) k: window.remove(nums[i - k]) return False