GPT "Data structures and Algorithms Coding Expert"

C . 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: true Example 2:  Input: nums = [1,2,3,4] Output: false Example 3:  Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: true    Constraints:  1 <= nums.length <= 105 -109 <= nums[i] <= 109

Python. Two Integer Sum Given an array of integers nums and an integer target, return the indices i and j such that nums[i] + nums[j] == target and i != j.  You may assume that every input has exactly one pair of indices i and j that satisfy the condition.  Return the answer with the smaller index first.  Example 1:  Input:  nums = [3,4,5,6], target = 7  Output: [0,1] Explanation: nums[0] + nums[1] == 7, so we return [0, 1].  Example 2:  Input: nums = [4,5,6], target = 10  Output: [0,2] Example 3:  Input: nums = [5,5], target = 10  Output: [0,1] Constraints:  2 <= nums.length <= 1000 -10,000,000 <= nums[i] <= 10,000,000 -10,000,000 <= target <= 10,000,000

Python. Find Duplicate Integer You are given an array of integers nums containing n + 1 integers. Each integer in nums is in the range [1, n] inclusive.  Every integer appears exactly once, except for one integer which appears two or more times. Return the integer that appears more than once.  Example 1:  Input: nums = [1,2,3,2,2]  Output: 2 Example 2:  Input: nums = [1,2,3,4,4]  Output: 4 Follow-up: Can you solve the problem without modifying the array nums and using  O ( 1 ) O(1) extra space?  Constraints:  1 <= n <= 10000 nums.length == n + 1 1 <= nums[i] <= n