TWO SUM (leetcode) solution in 6 mins in PYTHON in TELUGU

No video

TWO SUM (leetcode) solution in 6 mins in PYTHON in TELUGU

Рет қаралды 5,949

Күн бұрын

solve this question in below links and increase your coding profiles
.
.
.
two sum solution in telugu
coding python
python
two sum
sum two
two sum python
two sum telugu
telugu coding solutions
telugu coding
leetcode geeksforgeeks solutions telugu
leetcode telugu solutions
geeksforgeeks solutions telugu
leetcode solutions telugu
geeksforgeeks telug solutions
two sum telugu solution
two telugu sum solution
google facebook amazon apple netflix
data structures in telugu
data structures in python telugu
hashmap telugu
telugu coding
programming telugu
two sum program telugu
two sum program leetcode
leetcode telugu two sum program
two program sum leetcode

Пікірлер: 15

@nagarajutammavarapu Ай бұрын

nums=[2,7,11,15] target=26 for i in range(len(nums)-1): a=i b=i+1 sum=nums[a]+nums[b] if target==sum: print(a,b)

@manisha4130 Ай бұрын

Great Explanation! Thanks for this Video

@rebekahjames 11 ай бұрын

thank you :) life saver. nak aa english lo vintunte burra ku ekkaledhu. thanks for this. over complicate cheyakokunda explain chesav. Na first leet code problem nuvve explain chesnav anna thanks:)

@javaharreddysunkireddy 11 ай бұрын

welcome, please consider like,share and subscribe so that it gives me motivation to do such videos

@bhargav5321 2 ай бұрын

nums=list(map(int, input().split())) target=int(input()) o=[] for i in range(len(nums)): for j in range(len(nums)): if(nums[i]+nums[j]==target): o.append([i,j]) break print(o) this also works perfect but it is not taking as correct

@javaharreddysunkireddy 2 ай бұрын

Bro nums=[2, 3,1] and target =4 now try this using your code it dosent work your for loops are not handling repetetions say for first iteration the sum would be 2+2 which is four but it is not the answer that is why it dosent work handle those and your code will work fine

@CodingMakesMeHappy Ай бұрын

Bro j should starting from i+1 then it works fine still it takes O(n^2) time complexity. Use map for O(n). If u don't want space then sort array it will run in O(nlogn) time complexity