Видео

@AmulsAcademy it is good to learn data structures in python for top company placements

This really helped me a lot, thankyou for creating such great content :) It'd also be great if you explain multiple problems like the ones on leetcode, codeforces, etc

Did not understand 2nd forloop j

s=input("enter the string you want: ") for i in range (1,len(s)+1): print(s[0:i]) print()

Second value is assigned to first, but while adding u use temp+second???

want advanced ds concepts Amulya's Academy

I really appreciate your amazing way of teaching! 😊 Please, could you create videos on the following topics: django, python MySQL, kivyMd? Thank you! <3

Madam, can you please prepare a few videos on how to combine pythgon and excel. Or if you can suggest any book or a channel. thank you

Thank you for the video. The best part of this video is that it has explained how and what happens with the keyword 'return'.

How many are watching in 2024

!!!!!!!!!!!!!!6

You haven't incremented the while loop....Is it auto incremented..Can you explain in detail

nice explanation

in data structures you talked about data structures concepts where are the remaining algorithms topics..mam?

osm osm osm nice explanation thank you very much

At 5:40 sec u got confused ......tuples are immutable right ? But u said mutable once check it mam

osm osm osm osm osm

osm madam no words to express about your explanation

Thank you for a very informative and well explained lesson.

@amulya - your style of tracing the flow of program/control is EXCELLENT, feels like computer is tracing the instructions !! simply like your way of teaching Data Structures !!😊

Mam in add_before method can we use New_node.nref=n.pref.nref Instead of giving New_node=n But it gives attribute error,could you please tell me abt this..!

Osm explanation

Thank you so much mam❤its a crystal clear content

can you share the codes please?

Mam , We are linking a whole class with methods and functions whenever we used to create a new node sub tress will consist not only left , right and key but also insert function I think it will consume more memory.

Thank you very much! Everything is clear!

Pls post Python videos

mam, your voice quality is just wow 😌😌😌😌

n = int(input("enter a number :")) for i in range(2,n+1): for j in range(1,i): print(i-j,end="") print() out put is done. is this methode correct??

You pattern is wrong, this is the right pattern # Top half for i in range(num): print(" " * (num - i - 1) + "*" * (2 * i + 1)) # Bottom half for j in range(num - 2, -1, -1): print(" " * (num - j - 1) + "*" * (2 * j + 1))

def delete_end(self): if self.head is None: print("Linked list is empty") else: n=self.head while n.ref is not None: if n.ref.ref is None: break n=n.ref n.ref=None

Is this playlist enough for understanding complete dsa ?

Great Video maam really helpful glad i am learning good

Perfect explanation......❤

Thank you very much for all your videos mam.

Nice tutorial

Thank you mam for your excellent explanation

can you cover the advanced topics..??

After almost an hour of having multiple breakdowns trying to understand this shit by watching multiple vids across yt, I found this video and the programming part totally makes sense FINALLY. Thank you !

what should be the code if we want to replace 50 with 70?, cause i dont think it will be the same

What’s the complexity ?

is there any way to get notes of your lesctures ma'am?

Thanks

can you do it using recursion or conditional statement

You wrote print(num,"is not a prime number" ) in FOR loop why it is not printing for num number of times

Watching the series in 2024, please upload and continue the series ..........

osm explantion

after completion of this playlist .May I able to solve coding problems?? can anyone answer this.....

i am not able find out to scatter plot and pie plot