How do I implement the two-sum problem in Swift?

The Two-Sum problem is a classic algorithm problem that involves finding two numbers in an array that add up to a specific target. Here's how you can implement the Two-Sum problem in Swift.

func twoSum(_ nums: [Int], _ target: Int) -> [Int]? { var numDict = [Int: Int]() for (index, num) in nums.enumerated() { let complement = target - num if let complementIndex = numDict[complement] { return [complementIndex, index] } numDict[num] = index } return nil } // Example usage: let nums = [2, 7, 11, 15] let target = 9 if let result = twoSum(nums, target) { print("Indices of the two numbers are: \(result)") } else { print("No two sum solution exists.") }

Two-Sum Swift Algorithm Problem Solving Programming

Related Questions

How do I avoid rehashing overhead with std::set in multithreaded code?

How do I find elements with custom comparators with std::set for embedded targets?

How do I erase elements while iterating with std::set for embedded targets?

How do I provide stable iteration order with std::unordered_map for large datasets?

How do I reserve capacity ahead of time with std::unordered_map for large datasets?

How do I erase elements while iterating with std::unordered_map in multithreaded code?

How do I provide stable iteration order with std::map for embedded targets?

How do I provide stable iteration order with std::map in multithreaded code?

How do I avoid rehashing overhead with std::map in performance-sensitive code?

How do I merge two containers efficiently with std::map for embedded targets?