Complete Data Analyst Roadmap 2023 in Hindi:kzbin.info/www/bejne/Y5vCeaGPnK6dh9k Do you want to learn python from me with a lot of interactive quizzes, and exercises? Here is my project-based python learning course: codebasics.io/courses/python-for-beginner-and-intermediate-learners?
@techbee96233 жыл бұрын
First time in life I found best explanation of Data Structure we really need this type of Explanation that is very helpful to us. Thankyou Sir🙏
@codebasicsHindi3 жыл бұрын
Glad it was helpful!
@rohitgupta65913 жыл бұрын
Your explanation is better than Udemy Paid Courses. It was really very helpful.
@utkarshgupta73713 жыл бұрын
Nice explanation sir please continue this series and complete it
@AshutoshRYadav Жыл бұрын
class Node: def __init__(self,data,next_obj): self.data=data self.next_obj=next_obj class Linkedlist: def __init__(self): self.head=None def insert_at_begining(self,data): node=Node(data,self.head) self.head=node def display_data(self): itr=self.head linked_list='' while itr: suffix='' nxt=None if itr.next_obj: suffix +='-->' nxt='Next' #linked_list +=f'[{str(itr.data)}|{str(itr.next_obj)}]'+suffix linked_list +=f'[{str(itr.data)}|{nxt}]'+suffix itr=itr.next_obj print(linked_list) def get_length(self): itr=self.head count=0 while itr.next_obj: count+=1 itr=itr.next_obj return count def insert_at_last(self,data): itr=self.head if itr is None: self.head=Node(data,None) return while itr.next_obj: itr=itr.next_obj itr.next_obj=Node(data,None) def insert_at_n(self,data,index): itr=self.head if index self.get_length(): raise Exception('Invalid index provided') elif index==0: self.insert_at_begining(data) return else: count=0 while itr: if count==index-1: node=Node(data,itr.next_obj) itr.next_obj=node itr=itr.next_obj count+=1 add_data=Linkedlist() add_data.insert_at_begining(5) add_data.insert_at_begining(6) add_data.insert_at_begining(1) add_data.insert_at_begining(4) add_data.insert_at_begining(8) add_data.display_data() add_data.insert_at_last(7) add_data.insert_at_last(10) add_data.insert_at_last(12) add_data.insert_at_last(15) add_data.display_data() add_data.insert_at_n(70,2) add_data.insert_at_n(80,3) add_data.insert_at_n(90,4) add_data.insert_at_n(1000,0) add_data.display_data()
@ayushsharma48422 жыл бұрын
sir will you please extend the course as you are the only one o yt who is teaching dsa course in python please add more videos
@ayushpal7902 жыл бұрын
great work easy explanation, that's what I was looking for. please make more such videos in hindi. TY
@spred9ledge2723 жыл бұрын
Thank you so much sir great explanation !!
@codebasicsHindi3 жыл бұрын
Glad it was helpful!
@digvijaysingh3252 жыл бұрын
great video sir
@yashpawar76404 ай бұрын
Thank you Sir
@akashpawar90582 жыл бұрын
Very nice sir
@PGhai2 жыл бұрын
Bhai at 7:55 you mentioned about zen mode, what is it and why to use?
@digvijaysingh3252 жыл бұрын
try finding answers on Google first you will probably find answers so Zen mode in PyCharm combines the Full Screen and Distraction-free modes, so the main window expands leaving only the editor with the source code for you to focus on programming
@astrotiles9728Ай бұрын
27:51 bro wanted to give some villian laugh
@12-fret823 жыл бұрын
Love From Nepal Sir G ❤
@tejasvasoni9393 жыл бұрын
Great work
@srsofts78852 жыл бұрын
Thank You So Much Sir
@amiteshparihar27082 жыл бұрын
sir ye video unhi k liye h na jinhe python ata h new developer ko to kch smjh nh ayega
@shubhamudsaria52754 ай бұрын
why aren't we using tail to remove last element? @codebasicsHindi
@digvijaysingh3252 жыл бұрын
please upload videos on algorithms as well
@UserLuckProfile Жыл бұрын
Itna Ganda explanation nahi karna hota hai operations ko to explain kiya hi nahi theory to koi bhi samajh lega
@anujkondhalkar97763 жыл бұрын
Great videos sir very helpful. But here your corner face screen hide data behind it.
@vibhors3 жыл бұрын
Thank you❤️👍
@codebasicsHindi3 жыл бұрын
You’re welcome 😊
@xyz-pc3tl3 жыл бұрын
Thanks for your effort , sir Hats off...sir🙏🙏
@indiannationalist072 жыл бұрын
Sir you took very complex oop example and why you didn't take simple example apart from OOP
@abdulrafay42240 Жыл бұрын
where is exercise link
@mdsohailhussain84202 жыл бұрын
Anyone please tell me how insert/ delete elements at the end of linked list is O(n) ????, it should be O(1) na??
@kunaldev25902 жыл бұрын
U have to travers n times so its O(n)
@vent_down_3 жыл бұрын
Sir i have persistent interview in upcoming 4-5 days. ... N i dont have any DSA knowledge yet ! But im good in Python So, all these 20 videos are enough for interview ? Please reply please
@codebasicsHindi3 жыл бұрын
I have covered data structures but not the algorithms. I have a complete series on my english channel, watch that please for now. In the future I will upload algo videos in hindi series too.
@vent_down_3 жыл бұрын
@@codebasicsHindi actually I already watched English channel complete playlist. Now i feel its enough. N thankyou Sir for such fabulous explanation n efforts. Happy Teachers day too!❣️
@sewp0323 жыл бұрын
@@vent_down_ best of luck for your interview dude
@vent_down_3 жыл бұрын
@@sewp032 lets see ..thanks btw
@chessfun9342 жыл бұрын
@@vent_down_ did u got the job?
@locu832 жыл бұрын
Should I go through algorithms first or python tutorials? Pls help
@Atowmic2 жыл бұрын
python tutorials
@sachinrathod33052 жыл бұрын
Update the playlist sir please All the sorts in detail
@prabhuthuletiya3257 Жыл бұрын
kitni bhi kosis krlo gujarati vala flow to nikal hi jata hai😄
@shaileshtalpada78092 жыл бұрын
Sir linked list is very deficult to understand, please give me easy solution ,i couldn't understand this program.
@loony428010 ай бұрын
it’s easy actually just think like a train and boxes which is connected with each other where connecting part is edge, boxes are node and the main engine carrying remaking boxes are root.
@loony428010 ай бұрын
and yes each node contains some data
@prateek_agrawal702 жыл бұрын
sir aapne hindi me poora cover nahi kiya DSA , compare to english, please kar dijiye sir
First it take an empty string. while there will be iteration it will convert the data into string and add it to llstr every time creating a single long string of values and when loop finishes it prints the llstr with all values concatenated.