Priority Queue | Data Structure | Python Tutorials

[@saraswatimondal5136]

One of the most underrated yt coding channel

[@AmulsAcademy]

Thank you 😊❤️

[@carefree_ladka]

She's just great at explaining this stuff. Thank you :)

[@TheMako101]

Nice and simple explanation, thank you 🙂

[@ytg6663]

I am Looking to implement Dijkstras Algo using PQ.. thanks for this.

[@AmulsAcademy]

😊😊

[@meghanathreddy875]

hi Sis,these are really worth videos thanks a lot for sharing the content .
Guys who are reading the comment and really want to learn Data Strucures in Python,here is the Amulya Sis who always explained in a laymen terminology so that everyone understands.
And one small request guys, since this sister is doing this much for us,pls donot skip the adds,just watch fully ,pls donot skip, so that our sister will get the income. This is the least way we can help her.
Thanks SIS

[@AmulsAcademy]

Thank you so much :)

[@migy220]

Amulya's voice and voicing out her words are cute...its like a kid

[@AmulsAcademy]

Thank you 😊

[@sanketsuryawanshi]

Thanks your voice is so nice 👍🏻 gifted by god with sharp mind

[@AmulsAcademy]

Thanks a lot :)

[@syedowaisaliraza]

Kindly answer this question
We have an array of 5 elements: [4, 8, 1, 7, 3] and we have to insert all the elements in the max-priority queue. First as the priority queue is empty, so 4 will be inserted initially.
Now when 8 will be inserted it will move to front as 8 is greater than 4. While inserting 1, as it is the current minimum element in the priority queue, it will remain in the back of priority queue. Now 7 will be inserted between 8 and 4 as 7 is smaller than 8.
Now 3 will be inserted before 1 as it is the 2nd minimum element in the priority queue.

[@lakshyamongacompany]

You can create your own class, suppose "myQueue" and inherit "list" class in it (to use all methods an attributes that "list" class provides")
In the "append" def function. Take the argument for "what to add" and after it mention the function to automatically sort the queue (self.queue = self.queue.sort(), where self.queue stores the list/queue you are using)

[@SaidalliBasha]

​DUTHFS0E3R4 8 ustaad 1:51 @@lakshyamongacompanyrfffggghtyyyhhhhhhyhgvghhtt67iomm. Moon moon ,takuvdi moon jisez

[@anonymoushindustanti]

Ma'am if any more topics is left to make for DSA in python, please make it and complete the series. I am following this series for my python dsa. Ma'am sorting, bubbling are not in this series please look into it.

[@pravasinipati5128]

Your video’s are so easy to understand. Could please make one for heap sort with explaining code.

[@AmulsAcademy]

I will try :)

[@beatboss9275]

7:04 So Priority class will give high priority to small value, then what about bigger values. We can use list but as you said its slower and not the first choice. Is there any other option beside list and deque function for bigger values.
BTW the Playlist is amazing so far, Thanks.

[@AmulsAcademy]

Thank you so much :)
You can use binary heap :)

[@MrUmesh49]

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?

[@bitsbytes1780]

Why there is no option to have notification bell for this playlist? Btw Thanks a lot for this series

[@AmulsAcademy]

Hit the bell icon after subscribing the channel to get notifications.
Pleasure :)

[@pranki2254]

that was quite helpful, thank you

[@AmulsAcademy]

Pleasure :)

[@the_mellobean]

What if we have a priority queue with strings, is there a way we can set the priority without alphabetic order?

[@ayushmathur154]

Is priority queue module and heap queue model is same

[@vishalv3031]

You explained about the lowest num first priority for highest number

[@shreehari2589]

When are linked list and hash maps etc are coming? Eagerly waiting for them please upload them soon

[@AmulsAcademy]

Soon :)

[@riyakhandelwal3409]

this is very helpful :")

[@AmulsAcademy]

Thank you 😊

[@saipavan77]

Nice explanation

[@AmulsAcademy]

Thank you :)

[@makeyoulaugh5616]

Mam what bout circular queue?

[@sanketsuryawanshi]

Do you have video on pandas and numpy ?

[@AmulsAcademy]

NumPy : yes we have few videos on that
Pandas: NO

[@YouMeverse]

thank you mam.

[@_India2047]

Madam, can you please let me know by which application you recording the screen.

[@kironpaul7581]

Please do videos on Graph,tree doubly linked😪😪🙏🙏

[@AmulsAcademy]

Soon :)

[@adityasingh-w5m9q]

how to get lenth of a prioroity queue

[@katchoroweb4616]

Nice your cors

[@niteshanthony2324]

Hey everyone ik its pretty late but i just wanna tell u all to take it easy, relax, pray to GOD and have and trust in GOD as well as believe in his one and only son Jesus and to repent of your sins. hope u have an amazing day

[@hometvfirestick]

thanks

[@ravishankarpal5358]

ma'am pls make the video on linked list

[@AmulsAcademy]

Sure :)

[@iliyashusain3058]

Mam can u give this data str pdf??

[@selvanm2872]

👍

[@the.rajkumar.sawant]

Why you changed name??

[@gobinathgunasekaran8731]

Madam, pls post how to run pandas

[@universal4334]

Tip for subs :- Never use pop with index it results O(n^2).Try to avoid using it
Never use insert gives same result as like pop with index 😉 O(n^2)

[@riyakhandelwal7850]

So then which other way ?

[@universal4334]

@@riyakhandelwal7850 if you have more work on deleting and inserting then go for linkedlist it makes your job for O(1)

[@sirus5691]

How to write a python program for
A
B C
C D E
D E F G
E F G H I

[@AmulsAcademy]

n = int(input("rows:"))
k = ord("A")
for i in range(n):
k = ord("A")+i
for j in range(i+1):
print(chr(k),end=" ")
k=k+1
print()
:)

[@sirus5691]

How to write a program for
A
B A
C B A
D C B A
E D C B A

[@AmulsAcademy]

You can use ascii value of alphabets for that :)

[@sirus5691]

Okay mam

[@imtiyazhossain110]

see you not for mind