class Solution : def twoSum ( self , nums : List [ int ], target : int ) -> List [ int ]: for i in range ( len ( nums )): for j in range ( len ( nums )): if i ! = j and nums [ i ] + nums [ j ] == target : return [ i , j ] PROBLEM so in the ques we have given an array nums and an integer target an...
Source: [Dev.to](https://dev.to/piyushnextgen/my-code-and-approach-to-solve-the-two-sum-problem-of-leetcode-40eb)