Missing Test Case - 1. Two Sum

[thejaswinikm]

LeetCode Username

Thejaswini_k_m

Problem Number, Title, and Link

1. Two Sum https://leetcode.com/problems/two-sum/

Bug Category

Problem description

Bug Description

The function returns the wrong indices for some inputs.
Steps:
Input: [3,2,4], target = 6 → Expected [1,2] but got [0,1].
Expected: Correct indices of the numbers that sum to the target.

Language Used for Code

Python/Python3

Code used for Submit/Run operation

class Solution:
    def twoSum(self, nums, target):
        hashmap = {}
        for i, num in enumerate(nums):
            diff = target - num
            if diff in hashmap:
                return [hashmap[diff], i]
            hashmap[num] = i

Expected behavior

Case 1
Case 2
Case 3
Input
nums =
[2,7,11,15]
target =
9
Output
[0,1]
Expected
[0,1]

Screenshots

No response

Additional context

No response

[oj-leetcode]

oj-leetcode commented: Hi Thejaswini_k_m,

Thank you for reaching out about your concerns with the "Two Sum" problem. Based on the code you provided, it appears to be correctly implementing the intended logic for finding two indices such that their corresponding numbers add up to the target value.

Please note that the problem allows for the indices to be returned in any order, so both [1,2] and [0,1] are valid outputs as long as they sum up to the target. Your code seems to deliver a correct result by returning [0,1], which satisfies the problem's requirement.

If you have additional questions about how the solution works, I recommend reviewing LeetCode's discussion forums or editorials for more examples and explanations. We appreciate your understanding!

Best regards,
LeetCode Support Team