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.3 KiB
1.3 KiB
TODO 0001. Two Sum easy
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 = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]Constraints:
2 <= nums.length <= 10^{4}-10^{9} <= nums[i] <= 10^{9}-10^{9} <= target <= 10^{9}- Only one valid answer exists.
*Follow-up: *Can you come up with an algorithm that is less than O(n^{2}) time complexity?
TODO Approach
Write your approach here.
TODO Python
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:TODO C++
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
}
};