Alternate using list - from math import gcd num1=int(input("Enter the no to check: ")) list1=[] for i in range(1,num1): list1=[j for j in range(1,i+1) if gcd(num1,j)==1] print(list1)
@gotnovibesman23 сағат бұрын
Bruh thank you so much
@SantoshKumar-gt9muКүн бұрын
Comeback op!❤
@bgmiyt3964Күн бұрын
The Best Teacher🧡💯
@chinmaythapliyal2 күн бұрын
for i in range(1,5): for s in range(4,i-1,-1): print(" ",end='') for j in range(1,i*2): if((i==2 and j==2)or (i==3 and j==2)or (i==3 and j==3)or (i==3 and j==4)): print(" ",end='') else: print("*",end='') print() what about this one?
@RKMeena-bh5wj2 күн бұрын
you can also click the new file option on idle it must be more easy
@nireesha54942 күн бұрын
Hey, i was looking for a perfect DSA in Python no one has made this instead of you.
@gaganawasthi013 күн бұрын
what a gauges voice
@MrUmesh493 күн бұрын
Can I get the source code for last one q.append((2,"a")) and for the pop() function. and what if the priority is same for both?
@bishtjohn384 күн бұрын
Mam logic is correct but code is wrong
@suyakisaneeshwar85065 күн бұрын
Madam ..pls upload scipy full tutorial pls🙏🙏
@Prajwal_KV5 күн бұрын
Hi Amulya, long time no seeing.how are u? Glad u r back.✨✨✨
@jithendra53226 күн бұрын
class BST: def __init__(self,key): self.key=key self.rchild=None self.lchild=None def insert(self,data): if self.key is None: self.key=data if self.key>data: if self.lchild: self.lchild.insert(data) else: self.lchild=BST(data) else: if self.rchild: self.rchild.insert(data) else: self.rchild=BST(data) def search(self,data): if self.key==data: print("Node is found") return if data<self.key: if self.lchild: self.lchild.search(data) else: print("Node is not present in the Tree") else: if self.rchild: self.rchild.search(data) else: print("node is not present in the tree") def preorder(self): print(self.key) if self.lchild: self.lchild.preorder() if self.rchild: self.rchild.preorder() root =BST(10) list1=[6,3,1,6,98,3,7] for i in list1: root.insert(i) root.preorder()
@mubasirmk89876 күн бұрын
n = 8 m = n+1 for i in range(n//2-1): for j in range(m): if i == n//2-2 and (j == 0 or j == m-1): print("*", end=" ") elif j <= m//2 and ((i+j == n//2-3 and j <= m//4) \ or (j-i == m//2-n//2+3 and j > m//4)): print("*", end=" ") elif j > m//2 and ((i+j == n//2-3+m//2 and j < 3*m//4) \ or (j-i == m//2-n//2+3+m//2 and j >= 3*m//4)): print("*", end=" ") else: print(" ", end=" ") print() for i in range(n//2-1, n): for j in range(m): if (i-j == n//2-1) or (i+j == n-1+m//2): print('*', end=" ") elif i == n//2-1: if j == m//2: print('A', end=" ") elif j == m//2+1: print('B', end=" ") elif j == m//2+2: print('C', end=" ") else: print(' ', end=" ") else: print(' ', end=" ") print() output is * * * * * * * * * * A B C * * * * * * * * this will print like this can you simplify this
@jithendra53226 күн бұрын
class BST: def __init__(self,key): self.key=key self.rchild=None self.lchild=None def insert(self,data): if self.key is None: self.key=data if self.key>data: if self.lchild: self.lchild.insert(data) else: self.lchild=BST(data) else: if self.rchild: self.rchild.insert(data) else: self.rchild=BST(data) def search(self,data): if self.key==data: print("Node is found") return if data<self.key: if self.lchild: self.lchild.search(data) else: print("Node is not present in the Tree") else: if self.rchild: self.rchild.search(data) else: print("node is not present in the tree")
@jaswanthjaswanth93667 күн бұрын
🎉❤
@jithendra53227 күн бұрын
class BST: def __init__(self,key): self.key=key self.rchild=None self.lchild=None def insert(self,data): if self.key is None: self.key=data return if self.key==data: return if self.key>data: if self.lchild: self.lchild.insert(data) else: self.lchild=BST(data) else: if self.rchild: self.rchild.insert(data) else: self.rchild=BST(data) root=BST(10) list1=[20,4,30,4] for i in list1: root.insert(i)
@mubasirmk89877 күн бұрын
num = int(input("enter any number:")) msg= (input("enter any message:")) l = len(msg) n = num//2 for i in range(n): print(" "*(n-i-1) + "* "*(i+1),end="") if num%2==0: for j in range(2*(n-i-1)): print(" ",end ="") else: for j in range(2*(n-i-1)+1): print(" ",end="") for j in range(i+1): print("* ",end ="") print() print("* "*((num-1)//2) + " ".join(msg) + "* "*((num-1)//2) ) for i in range(num,0,-1): print(" "*(num-i) + "* "*(i)) is there any mistake i am getting extra one star after in 5th row
@oplegend00738 күн бұрын
thankyou.....(gulabi dil)
@user-yt8st8sw3d8 күн бұрын
Super explanation sister thank you so much 😁☺️
@aravindhan918310 күн бұрын
this program wont work when the tree is like preorder--20 15 10 7 17 16 when we delete 15 from the tree
@farmme662310 күн бұрын
welcome back mam ❤❤ sorry if it is sudden but I have a request, please also upload tutorial for python request module 😊😊 Thank you, this is the only channel that help me to understand DSA especially linked list which is the first data structure that I learned except array/list. ❤❤❤
@Novelsvibes-hub10 күн бұрын
Wah wah Meri bhn .....
@AlokDhoke11 күн бұрын
Promotion regarding baat karne thi aapse reply
@Sandip_Vegad_78912 күн бұрын
list = [ ] number = int(input("enter the element of number = ")) for i in range(number): element = int(input("enter the number of list = ")) list.append(element) print(list) for i in range(len(list)): min_value = min(list[i:]) min_ind = list.index(min_value,i) list[i],list[min_ind] = list[min_ind],list[i] print(list)
@bgmiyt396413 күн бұрын
super Explanation
@user-om3yn4zo1m13 күн бұрын
simple and easy explaination I watched so many videos to understand this concept but this was the best
@pravyn35013 күн бұрын
🎉
@user-ts1rf7ck6h14 күн бұрын
Thank you mam for your explanation.....It is really helpful💌
@dhaneshmohun623914 күн бұрын
you sound cute...like my little brother
@pgkgaming422915 күн бұрын
Osm ,nice explanation ❤❤❤
@pgkgaming422915 күн бұрын
Nice explanation osm ❤❤❤
@prionto614815 күн бұрын
I cannot imagine I am getting this amazing explainations for free, thanks a lot. Please keep up the good work.
@Hello_darkworld15 күн бұрын
Thanks mam:))
@Manishamkapse15 күн бұрын
Madam dictionary also ordered aftet python version 3.7
@Manishamkapse15 күн бұрын
Explanation good but tuple is immutable
@abhinayi15 күн бұрын
Hello sister, can you make videos on explaining HackerRank python questions, that will give us more real-time based experience for interviews.
@Anasalkhteeb-dr2hv15 күн бұрын
شكراً لك يا اخي❤❤
@Clickz.of.karthik16 күн бұрын
HENCE, FINALLY RETURN BACK
@aarthim384216 күн бұрын
Super explanation 🤩
@vigneshk519317 күн бұрын
Thank you mam. I felt easy learning data structure by watching your videos
@anilkumarpaidi3117 күн бұрын
Thank u madam😊
@Dattu-yv4tj18 күн бұрын
Good to see you back...!
@TheaccountIuseformystudies18 күн бұрын
If you want to take input for this shape use this: num = int(input()) for row in range(num): for col in range(num): if row+col==(num-1)/2 or col-row==(num-1)/2 or row-col==(num-1)/2 or row+col == 3*(num-1)/2: print("*", end="") else: print(" ", end="") print()
@paulprasadbabu18 күн бұрын
thank you madam, good explanation
@HarshPatel-it7ig18 күн бұрын
Hindi bolo please
@rajachoudhary5118 күн бұрын
ur voice and teaching style are ultimate.
@gangstar-ny4oz18 күн бұрын
Your voice so nice
@prionto614818 күн бұрын
It is the best channel out there for explaining python data structures, thanks a lot for making these videos.
@korthiwadasathwika318618 күн бұрын
mam iam getting this type of error how can i resolve it, AttributeError: partially initialized module 'turtle' has no attribute 'Turtle' (most likely due to a circular import). Did you mean: 'turtle'?