Love your Content. Dont know why you‘re still not viral

osm nice explanation

🙏🙏🙏

👍👍👍

nice explanation Thankyou

I like u r explanation ❤❤... I got one doubt in pillars U written1. (c*thickness).--> this is to print H 5 times 2 .center(thickness*2) this is for space 3.+(C*thickness). center (thickness*6) --- > why we took center in the last i didn't understand... *In the middle u took it for space *But at last why ?

nice explantion anna thank you very much

nice explantion anna

but you didn't the validation of max value that numbers can have.

Beware of Anuj Modi from Publicis Sapients.. He is a senior manager.. Cant even speak one liner in english but do so much politics.. He will demean you .. lack the basic manners .. talk like 'Bolo Yar'

Super

very good explanation

if root is not None: why not use? if root:

Awesome explanation....🎉🎉

If the value is 10 20 30 it is not working for 1st approach

Thank you soo muchhh sir😊

great logic!

If you didn't get it in first time, watch it again I got to know this information after wasting my 1 week 😢

Hi buddy, any way you can upload photo now with automation? I can go until the create post but i cant upload to the text box. It keep uploading to the cover picture instead. Any way i can connect you or any platform we can discuss?

Why get n,m values??

Good and super explanation bro , all the best

Use set to remove duplicate values

Thank you for this. I just wanted to point out a few things which might make it easier for everyone: 1. Using a list to store the lowercase alphabet is not required; you can just use a string. 2. Related to #1, rather than use list(map(chr, range(97, 123))), you can just import string and use the built-in string.ascii_lowercase. alphabet = string.ascii_lowercase alphabet_subset = alphabet[size-1::-1] + alphabet[1:size] width = len("-".join(alphabet_subset)) for i in range(1, size): print("-".join(alphabet[size-1:size-i:-1] + alphabet[size-i:size]).center(width, "-")) for i in reversed(range(1, size + 1)): print("-".join(alphabet[size-1:size-i:-1] + alphabet[size-i:size]).center(width, "-"))

good bro keep posting more videos

code is not working properly in python3. used pypy3 for this code if __name__ == '__main__': n = int(input()) integer_list =tuple( map(int, input().split())) print(hash(integer_list))

thanks

I think we can also use hashmap

very well explained! for people looking for a reference, here is the law at play: if p = (A mod k) and q = (B mod k) and (A+B) mod k = 0, then p+q is either 0 or k.

Tq it clear

Excellent video thanku

nice explanation👍

Hello

thank you so much please solve insertion sort 1 problem available in hackerrank

probably you should use S1=S1+S.count(s[i:])

happiness=0 n,m=map(int,input().split()) array=list(map(int,input().split())) A=set(map(int,input().split())) B=set(map(int,input().split())) for i in array: if i in A: happiness+=1 elif i in B: happiness-=1 print(happiness)

i need the code to connect to the real device please

Tree playlist: completed✅ Graph playlist: completed✅ Thank you sir hope you will upload more DSA playlist using python

very good explination

Sir plz start uploading this valuable videos.your videos is really helpful for me

Very well taught , visualisation is very important . Thanks a lot bro

Sir itni jaldi khatam ho gi pata ni chala

Clear explanation ever. Keep making more such solutions

Great explanation ever even begineers understands easily👏