Contains Duplicate (LeetCode 217) | Neetcode 1/ 150 | Bharath Chandra (తెలుగు)

No video

Contains Duplicate (LeetCode 217) | Neetcode 1/ 150 | Bharath Chandra (తెలుగు)

Рет қаралды 2,991

Bharath Chandra (తెలుగు)

Күн бұрын

Пікірлер: 62

@mr.rishikesava2881 2 ай бұрын

Bro which approach is efficient either 2nd or 3rd approach 🥲

@bharathh_chandraa 2 ай бұрын

Oka daantlo takkuva space use avtundi, oka daantlo takkuva time lo solve avtundi HashMap vaadithe Time Complexity = O(n), Space Complexity = O(n) Sorting chesthe Time Complexity = O(n*log(n)), Space Complexity = O(1) Interviews lo general ga HashMap expect chestharu but konni saarlu sorting kooda aduguthaaru

@ShivaNaroju-lz9sz Ай бұрын

@@bharathh_chandraa hashmap or hashset? a

@niharrdg 2 ай бұрын

this is what exactly telugu community wants right now!🔥

@lokesh0000 2 ай бұрын

What a vision. Pichollaypotharu mana telugu vallu. Once video start chesthe, impress aypoyi subscribe cheseskuntaru. Idhi kadha manaki kavalsindhi. 📴

@kotahithosh3836 Ай бұрын

Way of explaning is awesome .

@bharathh_chandraa Ай бұрын

So planning to finish 150 problems??

@kotahithosh3836 Ай бұрын

@@bharathh_chandraayes

@syamalah5847 Ай бұрын

Ekkadunnav broo inni rojulu eroje dorikav♥️👌

@jahnavikanubaddi8418 22 күн бұрын

My doubt In for loop, syntax is * for i in range (start, end, step): -In this end = 10 then it gives 9 is end th element . -In this problem y we use len(nums) instead of len(nums)+1

@vaneetha_here_navaneetha Ай бұрын

class Solution(object): def containsDuplicate(self, nums): myset = set(nums) if len(nums)==len(myset): return False else: return True

@surenderm7294 29 күн бұрын

return len(set(nums)) != len(nums)

@shakoddinnoorbasha1961 Ай бұрын

Amazing...!!! You thought us very clear ..Can you also add JAVA code for reference material it will be easy for referring after going through your explanation

@pavan62001 Ай бұрын

Attendance✅ Day-1(26/07/24) java code : import java.util.HashSet; class Solution { public boolean containsDuplicate(int[] nums) { HashSet set = new HashSet(); for ( int num : nums ) { if( !set.add(num)) { return true ; } } return false ; } }

@ranjanreddy3296 Ай бұрын

Kudos to your efforts for explaining it simple and clear way.

@__as_ Ай бұрын

Don't stop this series. You will get more tremendous response than you think in long run.

@kushalmuddana3480 Ай бұрын

Great explanation bro...U have explained 3 types of scenarios with full of clarity🎉🎉Thanks u bro

@logshussain8555 2 ай бұрын

More and more leetcode problem solve chey and maku nerpinchu😊

@bharathh_chandraa 2 ай бұрын

Done

@VincentVamsi 2 ай бұрын

thankyou bro🤝

@vaneetha_here_navaneetha Ай бұрын

Today I am Lucky I got your videos on my screen Thank you Universe.

@praveen22224 2 ай бұрын

bro chala baga explain chesaru kani Time Complexity and Space complexity o(n), o(1) emi ardam kaledhu...Please do detailted video on Time Complexity and Space complexity please🙏🙏

@bharathh_chandraa Ай бұрын

Repe vidudhala (90%)😅

@SubhashiniReddy224 27 күн бұрын

Bro code is not visible

@anilkumarreddy3524 Ай бұрын

Bro direct ga manam len(nums)==len(set(nums)) return false Else True Eee logic manam try cheyavcha

@bharathh_chandraa Ай бұрын

Yes Anil cheyochu!

@electron-u8p Ай бұрын

1/150 ✅️

@jayyanth Ай бұрын

Nice explanation 👍 bro

@MaheshBabuMeruva Ай бұрын

Python lo explain chesaka Java code kuda ivvu bro, and explantion super, Telugu lo explain chestunanduku thanks

@sakethphaneendra5447 2 ай бұрын

Bro it takes 150 Days to complete those 150 problems. is there any possibility to cover 2 questions daily. .

@bharathh_chandraa 2 ай бұрын

Different approaches try chestunna Saketh. I want to take DSA, out of a closed room. But I'll make sure I post regularly, and give my best to complete this faster keeping the quality in mind

@bandigeetha9990 Ай бұрын

Super super super super super super super super anna ur explanation is awesome anna

@bharathh_chandraa Ай бұрын

Thank you thank you thank you keep coding geetha🙌

@ThriveniGuditi Ай бұрын

I want this in javaa also....😢😢😢can you please explain

@bharathh_chandraa Ай бұрын

Migitha videos lo pseudocode raasanu. So continue tge series

@anudeepkanna4533 2 ай бұрын

Anna nuvvu views ochina rakapoina ee 150 ques videos upload chey anna konthamandiki maa lantollaki aina help avuthundhi

@bharathh_chandraa 2 ай бұрын

Done Anudeep. Nuvvu kooda nee friends chesina cheyakunna DSA pakka practice chey, All the best!

@anudeepkanna4533 2 ай бұрын

@@bharathh_chandraa Thank you anna thappakunda chesta anna

@yamunaangadi538 Ай бұрын

n=int(input()) list1=[] for i in range(n): ele=int(input()) list1.append(ele) print(list1) list1.sort() for i in range(0,len(list1)-1): if list1[i+1]==list1[i]: print("True") break print("False") break anna ee code thesukopoyi i just pasted in that neetcode platform but it is showing error but when I did in goggle collab it is giving output ela neetcode platform lo code anedhi ela exact ga rayalli ani kocham oka video lo chepandi anna

@bharathh_chandraa Ай бұрын

Motham code raayodhu Yamuna, input already teeskuntaru ee problems lo and output kooda valle chestaru. Manam just akkada ichina function undi kadha hasDuplicate ani - Andulo input teeskoni process chesi output return cheyaali!

@yamunaangadi538 Ай бұрын

@@bharathh_chandraa ok anna thank u

@dasarisubramanyam227 Ай бұрын

Anna super cheptunav anna kncham funny Koda add chai students ki ba ardam avudi but ni explanation chinna pilladikikoda ardam avudi

@rajurj537 Ай бұрын

anna o(n login) ante enti

@bharathh_chandraa Ай бұрын

Time Complexity video lo explain chesa Raju!

@narinarendra7087 2 ай бұрын

Thank you bro

@user-se3vu8qk9m 2 ай бұрын

list_a=input().split(",") set_a=set(list_a) list_b=list(set_a) a=len(list_a) b=len(list_b) if a==b: print("False") else: print("True") I think this is also a correct program 😊

@bharathh_chandraa 2 ай бұрын

🙌

@beulahkondaveeti Ай бұрын

Super

@maheswara_pradeep8235 2 ай бұрын

Bro aa time complexity aa problem ki ela chepthunnavo kuda cheppu please

@bharathh_chandraa 2 ай бұрын

Time complexity oke video lo neat ga cover chesestga Pradeep

@sushmitha_muddala 2 ай бұрын

Active ga undatle everything is okay na anna, if possible week ki oka video ayina upload cheyandii

@bharathh_chandraa 2 ай бұрын

Everything is okay!! Thanks for asking Sushmitha. Ee playlist aipogotte varaku weekly 1-2 uploads pakka vasthay🙌

@sushmitha_muddala 2 ай бұрын

@@bharathh_chandraa chala informative nd use ayyi videos tisukosthav anna❤️ Thank you soo much nd keep going🙌🏻

@maheswara_pradeep8235 2 ай бұрын

Bro nuv cheppina last code lo set badhulu ge array vadi push chesina same avudhi ga?

@sakethphaneendra5447 2 ай бұрын

no bro array dont have function called contains(), you need to run the new array every time to check if the element is there or not it takes another O(N2) because of nexted loops.

@maheswara_pradeep8235 2 ай бұрын

Bro akkada contains ani ledhu ga. Ante x in myarr ani raasi lekapothe .push vadalema ani doubt?@@sakethphaneendra5447

@bharathh_chandraa 2 ай бұрын

Saketh cheppinatte oka array lo oka element ni search cheyali ante anni elements vethakaali Pradeep. Ante O(n) complexity Adhe hash set ante direct ga cheppestadi vethakanavasaram ledu. O(1) complexity Array lo elements anni order lekunda ela padithe ala undochu - bachelors room lo padeskunna keys vethikanttu illu (array) motham vethakaali Hahset lo elements ordered ga untay so just keys section ki pothe akkade untay keys, illu antha vethakam.

@maheswara_pradeep8235 2 ай бұрын

@@bharathh_chandraa oh thnx anna.❤️

@seshasaisai7189 Ай бұрын

Bro oka pani cheyyi logic ivvu like psedocode istey verey language use chei vallaki kuda use ayidi other than pythob

@bharathh_chandraa Ай бұрын

Sai, pseudocode ki python code ki assalu difference undadu. Anduke specific ga python lo cheptunna. Ekkadaina meeku telini syntax vaadutunna anipisthe explain chestha

@46mounikakunchala89 Ай бұрын

Idi sort Ani enduku rasav chpu asalu basics nunchi chpu bro like I , brackets epudu vadali enti and all

@bharathh_chandraa Ай бұрын

Coding syntax basics ee playlist lo later on cover chestaanu Mounika. Ippatiki naa main focus logic building and algorithms ni easy ga explain cheyadame. Logic vini code raatadaaniki try cheyandi. Basics kosam appativaraku Jenny lectures KZfaq Channel ni follow avvachu