수쿵의 IT월드

문제Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1:Input: nums = [100,4,200,1,3,2]Output: 4Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4. Example 2:Input: nums = [0,3,7,2,5,8,4,6,0,1]Output: 9 Example 3:Input: nums = [1,0,1,2]O..

문제You are a professional robber planning to rob houses along a street. Each houst has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houst have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.Given an integer array nums representing the amount of money..

문제Given an integer array nunmsand an integer k, return the kmost frequest elements. You may return the answer in any order. Example 1:Input: nums = [1,1,1,2,2,3], k = 2Output: [1,2] Example 2:Input: nums = [1], k = 1Output: [1] Constraints:1 -10^4 kis in the range [1, the number of unique elements in the array].It is guaranteed that the answer in unique.Follow up: Your algorithm's time complexit..

문제Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.You can return the answer in any order. Example 1:Input: nums = [2,7,11,15], target = 9Output: [0,1]Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]. Examp..

문제Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1:input: nums = [1,2,3,1]Output: trueExplanation: The element 1 occurs at the indices 0 and 3. Example 2:input: nums = [1,2,3,4]Output: falseExplanation: All elements are distinct. Example 3:input: nums = [1,1,1,3,3,4,3,2,4,2]Output: trueConstraints:..