tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.2 KiB
1.2 KiB
TODO 0260. Single Number III medium
Given an integer array nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in any order.
You must write an algorithm that runs in linear runtime complexity and uses only constant extra space.
Example 1:
Input: nums = [1,2,1,3,2,5]
Output: [3,5]
Explanation: [5, 3] is also a valid answer.Example 2:
Input: nums = [-1,0]
Output: [-1,0]Example 3:
Input: nums = [0,1]
Output: [1,0]Constraints:
2 <= nums.length <= 3 * 10^{4}-2^{31} <= nums[i] <= 2^{31} - 1- Each integer in
numswill appear twice, only two integers will appear once.
TODO Approach
Write your approach here.
TODO Python
class Solution:
def singleNumber(self, nums: List[int]) -> List[int]:TODO C++
class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
}
};