For complete content on Computer Science, check out the course link: tiny.cc/allcomputersciencecourse

🎯 Key Takeaways for quick navigation: 04:14 *Efficient Programming Essential* 04:54 *Solid Understanding Needed* 05:22 *Efficient Coding Crucial* 06:16 *Proper Data Arrangement* 06:41 *Organization is Key* 07:47 *Importance of Arrangement* 08:16 *Proper Item Placement* 11:42 *Modify Data Structures* 13:29 *Define new structures* 13:59 *Choose right algorithm* 14:13 *Data structure depends* 14:26 *Suitable data structure* 16:17 *Modularize structures* 16:32 *Basic structures available* 18:04 *Primitive Data Structures* 18:19 *Predefined Operations* 18:32 *Integers Operations* 18:45 *Inefficient Structures* 19:16 *Linear vs. Non-Linear* 19:44 *Non-Linear Data Structure* 20:24 *Implementation Complexity* 20:39 *Traversal Orders* 21:21 *Homogeneous and Heterogeneous* 23:09 *Quantity matters.* 24:57 *Accessing elements.* 25:11 *Array declaration basics.* 27:30 *Array Indexing Basics* 28:14 *Efficient Storage Use* 28:28 *Fast Access Methods* 29:22 *Easy to Modify* 29:37 *Specify Space Needs* 29:51 *Understand Space Allocation* 30:18 *Manage Dynamic Space* 33:05 *Serious Computer Time* 33:34 *Priority in Life* 37:14 *Upper bound* 37:27 *Formula explained* 37:41 *Perfect answer* 37:53 *Array size calculation* 38:20 *Multi-dimensional array size* 38:46 *Base address calculation* 39:42 *Random indexing* 40:11 *Base address calculation* 43:40 *1D vs 2D understanding* 48:22 *Understandable for psychology* 58:31 *Indexing Comprehension* 59:10 *Dimension Length Logic* 01:01:31 *Sparse Matrix Concept* 01:02:52 *Smart Sparse Matrix Storage* 01:04:40 *Sparse Matrix Handling* 01:08:25 *Runtime data manipulation.* 01:09:06 *Understanding linked lists.* 01:11:36 *Link and pointer part explanation.* 01:11:50 *Disadvantages of linked lists.* 01:12:18 *Simple node structure.* 01:12:57 *Dynamic size and memory efficient.* 01:13:37 *Easy insert/delete.* 01:14:47 *Consider space & time.* 01:20:00 *Creating nodes.* 01:21:49 *Basic operations.* 01:25:26 *Iterative vs. Recursive* 01:29:31 *Insert Node at Start* 01:36:55 *Implementing recursion.* 01:38:45 *Using Temp Variables* 01:39:54 *Iterative Process* 01:40:35 *Try Different Cases* 01:41:44 *Linking Nodes* 01:42:14 *Pointer Movement* 01:42:54 *Order of Operations* 01:43:17 *Head and Tail Movement* 01:44:11 *List traversal* 01:44:37 *Header list simplification* 01:44:52 *Header node usage* 01:45:06 *Special nodes in the list* 01:45:49 *Header list implementation* 01:46:04 *Understanding changes* 01:47:05 *Circular list benefits* 01:48:53 *Circular queue advantages* 01:51:03 *Techniques for managing pointers* 01:53:46 *Location Previous Next* 01:53:59 *Circular Double Linked* 01:55:06 *Link List Different* 01:55:34 *Power Multiplication Zero* 01:56:18 *Understandable Structure Understandable* 01:56:46 *Clear Simple Idea* 01:57:43 *Pointers Addition* 02:00:23 *Real-life Examples* 02:01:02 *Clothes as Stack* 02:02:42 *Understanding Stack* 02:03:35 *Push Pop Understanding* 02:03:50 *Top Bottom Basic* 02:04:04 *Stack Operations Example* 02:03:35 *Push Pop Basics* 02:03:50 *Top Bottom Concept* 02:04:17 *Value Sequence* 02:08:11 *Insertion Overflows Check* 02:08:26 *Stack Implementation Insights* 02:08:40 *Handling Default Case* 02:09:35 *Handling Full Stack* 02:10:17 *Deletion (Pop) Strategy* 02:10:31 *Indexing and Implementation* 02:10:42 *Handling Pop Operations* 02:10:54 *Starting Index Consideration* 02:12:42 *Considerations for Deletion* 02:12:56 *Stack structure basics* 02:17:34 *Stack Implementation* 02:22:24 *Stack Applications Basics* 02:24:06 *Three Notations: Infix, Prefix, Postfix* 02:25:21 *Polish Notation Introduced* 02:28:09 *Prefix evaluation* 02:28:21 *Operator priority* 02:28:49 *Expression conversion* 02:29:18 *Operator associativity* 02:30:28 *Expression conversion steps* 02:33:22 *Postfix expression.* 02:35:52 *Power precedence.* 02:38:17 *Convert expressions* 02:38:30 *Tree traversal method* 02:38:45 *Preorder traversal* 02:38:57 *Solve expressions* 02:39:51 *Solve expressions with priority* 02:40:32 *Traverse the tree* 02:41:09 *Solve expressions by traversal* 02:41:48 *Benefits of tree method* 02:43:33 *Convert expressions* 02:43:48 *Using stack help* 02:45:28 *Postfix notation* 02:45:43 *Closing bracket* 02:47:23 *Evaluate expressions* 02:49:13 *Result Calculation Process* 02:51:32 *Value Pop Process* 02:53:22 *Importance of recursion.* 02:54:19 *Handling base case.* 02:56:01 *Recursive factorial function.* 02:59:12 *Loop within loop* Tail Recursion Example 03:07:29 *Print command understanding* 03:08:13 *Recursion understanding clear* 03:09:19 *Recursive function observation* 03:13:00 *Recursive function understanding* 03:22:24 *Sequential Number Analysis* 03:26:51 *Understanding tower patterns* 03:28:00 *Flexibility in problem-solving* 03:28:42 *Recursive thinking importance* 03:30:43 *Puzzle solving approach* 03:31:38 *Tower of Noi function call* 03:34:48 *Swap algorithm explained.* 03:36:06 *Total moves calculation.* 03:40:02 *Recursion Simple Idea* 03:40:29 *Tail Recursion Explanation* 03:41:38 *Understanding Recursion Process* 03:45:22 *Condition Applicable* 03:46:45 *Understanding Recursion* 03:47:12 *Call and Print* 03:50:39 *Preorder traversal* 03:51:05 *Understanding tree structure* 03:56:25 *Understand Recursion Better* 03:57:44 *Recursive Function Call Analysis* 04:01:08 *Direct approach analysis.* 04:01:20 *Transition from cash.* 04:02:06 *Understanding pointers.* 04:06:12 *Efficient processing.* 04:06:32 *Sequential processing.* 04:06:58 *Resource management.* 04:07:39 *Index manipulation.* 04:08:33 *Rearrangement process.* 04:09:00 *Element ordering.* 04:09:12 *Position management.* 04:09:27 *Position updating.* 04:09:39 *Queue operation flow.* 04:11:40 *Special case* 04:16:04 *Define structure* 04:20:07 *Circular Queue Basics* 04:20:21 *Implementing Queue* 04:21:03 *Insert/Delete Observations (continued)* 04:21:30 *Node Structure Continued* 04:21:44 *Handling Overflow* 04:21:58 *Inserting Elements* 04:22:21 *Checking for Empty Queue* 04:22:49 *Updating Rear Pointer* 04:23:18 *Updating Rear Pointer (continued)* 04:23:31 *Handling Deletion* 04:23:44 *Handling Deletion (continued)* 04:24:40 *Bypass q's front* 04:25:47 *Implement logic* 04:26:13 *Observe how it works* 04:27:33 *Get final result* 04:27:46 *Ensure clarity* 04:28:40 *Handle overflow* 04:29:08 *Think logically* 04:29:35 *Circular Queue Implementation* Understand the change. Rearrange items. Check overflow condition. 04:40:58 *Implementation Options* 04:41:51 *Input & Output Restrictions* 04:47:02 *Tree Terminology Clarity* 04:47:44 *Tree Node Connectivity* 04:50:16 *Degree Calculation* 04:50:30 *Total Tree Concept* 04:50:59 *Node Maximum Children* 04:54:36 *Binary Tree Structure* 04:59:39 *Understanding Structure Basics* 05:00:44 *Storing Data Method* 05:01:28 *Critique of Storing Method* 05:05:45 *Preorder, inorder, and postorder traversal* 05:10:07 *Creating unique trees.* 05:10:34 *Question tree traversal.* 05:10:48 *Types of binary tree traversal.* 05:11:15 *Post-order traversal: right to left.* 05:11:29 *Explaining traversal positions.* 05:12:08 *Traversal continuation.* 05:12:35 *Final traversal positions.* 05:15:29 *Left smaller, right larger.* 05:16:13 *Inorder traversal.* 05:16:41 *Binary search.* 05:17:36 *Observing tree cases.* 05:18:47 *Handling deletions.* 05:19:00 *Deletion process.* 05:20:12 *Delete easy nodes* 05:25:16 *Sorted sequences explained.* 05:26:12 *Search algorithm example.* 05:26:52 *Confirming search steps.* 05:27:17 *Validating search sequence.* 05:30:43 *Subtree value comparison* 05:30:57 *AVL tree node values* 05:31:11 *AVL tree insertion* 05:32:33 *Identifying node problems* 05:32:49 *Handling node problems* 05:33:01 *AVL tree rotation* 05:33:16 *Identifying node issues* 05:33:58 *AVL tree balancing* 05:34:57 *AVL tree balancing* 05:36:12 *Perfect Macanism Method* 05:36:50 *Balancing explanation* 05:37:19 *Tree structure analysis* 05:37:47 *No need for recheck* 05:38:16 *Mandatory balancing* 05:38:44 *Handling imbalances* 05:39:12 *Tree status evaluation* 05:39:40 *Perfect balance achieved* 05:39:54 *Continuous practice* 05:42:07 *Copying is difficult* 05:45:28 *Check balancing factors* 05:47:51 *Left type delete* 05:48:44 *Rotate for balance* 05:49:09 *Eliminate cases* 05:49:38 *Delete left node* 05:49:51 *Balance factor -1* 05:50:45 *Direct deletion* 05:51:48 *Replacement selection* 05:52:20 *Successor determination* 05:52:32 *Last node problem* 05:53:42 *Complete Binary Tree* 05:53:55 *Left to Right* 05:55:58 *Node Properties* 05:56:13 *Heap Variants* 05:57:24 *Parent-Child Relationship* 05:58:03 *Max Heap Analysis* 05:58:31 *Understanding Heap* 06:03:42 *Minimum exchanges needed* 06:03:51 *Examining numbers pattern* 06:04:58 *Reversing indices order* 06:05:13 *Deleting elements in heap* 06:06:05 *Understanding heap deletion* 06:06:18 *Handling root deletion in heap* 06:07:36 *Various types of questions* 06:08:05 *Different types of structures* 06:08:54 *Factorial Division Result* 06:09:57 *Labeling Binary Trees* Made with HARPA AI

Sir, one shot videos are extremely helpful, please keep continuing to make them..

00:02 Complete data structure for semester exam 02:01 Computer Science Deals With Solving A Problem Correctly in a Form of Algorithm 06:05 Data Structures and Algorithms are important for efficient program execution. 08:13 Data structure is the organization of data in computer memory 12:13 Understanding data structures and their organization 14:18 Choose suitable data structure based on the scenario 18:21 Operations on pre-defined non-primitive data structures 20:19 Data structures can be linear or non-linear. 24:14 Understanding Index and Array Declaration in Data Structures 26:08 Data structure in Java involves default values and declaration of arrays. 29:48 Data structure in one shot 31:35 Data Structure is important for storing and managing data efficiently. 35:15 Array indexing starts from zero. 37:21 The formula is upper bound minus lower bound + 1 41:29 Understanding One Dimensional Arrays in Data Structures 43:46 2D Array is divided into rows and columns 47:36 Column Major Order is suitable for human psychology and commonly used 49:37 Understanding the concept of base address and weight of elements 53:24 The address using the Row Major Order is 1972 55:39 Understanding 3D arrays and their dimensions. 59:31 Understanding the concept of multidimensional arrays 1:01:29 Sparse Matrix is a matrix with mostly zero values. 1:05:32 Link list is another approach to dealing with large data structure 1:07:24 Data structure. Major problem of size and fixed size. 1:11:04 Data Structure is a self-referencing data structure with two parts - the data part and the link part. 1:12:59 Linklist can dynamically allocate memory at runtime for efficient memory usage 1:16:54 Understanding memory allocation in array and its efficiency 1:19:16 Creating and traversing a linked list in data structures 1:23:09 Traversing a Linked List iteratively and recursively. 1:25:10 Search for a key in a linked list using the iterative approach 1:29:10 Inserting a node at the beginning of the linked list 1:31:10 Deleting a node in a linked list 1:35:11 Reversing a linked list 1:37:10 Reversal of a Simple Linear linked list in a recurring fashion 1:41:14 Moving and updating pointers in a linked list 1:43:24 Header list is a variation of a standard linked list that includes a special node called the header node at the beginning of the list. 1:47:22 Circular data structures like circular linked list and circular queue have advantages compared to non-circular ones 1:49:15 Linklist is unreliable and can result in data loss if a pointer becomes invalid. 1:53:25 The video discusses complete data structures in one shot in hindi 1:55:15 Representation of a function with multiple variables in DS Data Structure. 1:59:12 Stacks are a type of data structure that simulates a stack-like behavior 2:01:02 Stack is a non-primitive linear data structure that follows the LIFO principle. 2:04:55 Stack implementation is important for function calls and other applications. 2:06:50 Static implementation using arrays and logic behaving like a stack 2:10:37 Deleting elements from a data structure using the pop operation 2:12:34 Understanding the data structure of a stack 2:16:18 Stack implementation using linked list: Inserting a new node 2:18:09 Understanding stack implementation using linked list 2:22:07 The input sequence '1 2 3 4 5' is possible to achieve. 2:24:01 Different notations for expressing mathematical expressions 2:28:08 Converting an expression into prefix and postfix using stack 2:30:06 Understanding the process of solving power expressions in data structures 2:34:11 Understanding postfix and prefix expressions in Data Structures 2:36:16 Step-by-step fashion example for conversion of infix expression to postfix and prefix 2:40:35 Tree traversal is important for understanding and manipulating data structures. 2:42:50 Prefix and postfix notation can be helpful in solving expressions. 2:46:49 Conversion and evaluation of arithmetic expressions using stack 2:48:39 Converting infix expression to postfix 2:52:28 Rikers is a programming concept where a function calls itself to solve a problem by breaking it down into smaller, manageable subproblems. 2:54:21 Understanding the concept of recursion in computer science and mathematics 2:58:19 Iteration in programming is commonly implemented using loops. 3:00:09 Implementing recursion vs iteration 3:04:06 Understanding recurrence and problem-solving with step-by-step approach. 3:05:53 Understanding head recursion and its impact on sequence printing 3:09:44 Understanding the sequence printed in a tree 3:11:55 Understanding function calls and iterations 3:16:08 Understanding Fibonacci series and its base cases 3:18:30 The function f(n) is calculated by adding the preceding two terms in the sequence 3:22:38 Explanation of the Fibonacci sequence and its origins 3:24:49 The Tower of Noir is a special case of recursion in computer science. 3:28:26 Understanding the Tower of Annoying and its recursive solution. 3:30:21 The Tower of Brahma Puzzle 3:34:27 Solving the DS Data Structure problem by following a step-by-step process. 6:46:14 Complete DS Data Structure in one shot

Sir you are such a gem 💎 thank you for this useful one short video and i hope you will be creating more videos like this ❤❤

Your One Shot Semester series is hands down my secret weapon for acing exams! 🌟 The depth and clarity you bring in such a short time is mind-blowing. As my software engineering exams approach, I'm counting on your magic. 🖥💡 Could you please drop a One Shot on software engineering? It's not just a request; it's a desperate student's plea for salvation! 😅 Your videos are a game-changer, and a software engineering edition would be a total knockout. Keep rocking the educational world! 🚀📚"

Wow...just fells proud after completing DSA give some positiveness..average students is now broken his line and just keep stepping with your videos ..thanks a lot sir ....I know ye sb likhte h but mai cmnt nhi krta but after completing this my soul my heart and my brain ...forced me to type this 😊🙏

Thank You So Much Sir, I have watched all the courses of CS/IT from your recorded lectures. This One shot video gives total overview of all topics, I would suggest every CS/IT student to watch this series for overall revision.

I want that you complete other subjects like AI, Statistics, DAA, so that this channel grows like a boom, Keep uploading like this, sir, It's our good luck to witness such a next level teacher teaching here, the concepts foundation is held so tight that we feel fully confidence because of you,

Sir , I like your Way of Talking , I always see You Calm . I really learn so much thing from u including my Study❤. Love u Sir❤

Sir a very humble request from my side on the behalf of every student, please do a one shot on OOPM (Object oriented programming), as semester exams are very close.

As my upcoming exams in software engineering are fast approaching, I was wondering if you could consider creating a one-shot video dedicated to the key concepts and principles of software engineering. Your comprehensive and easy-to-understand approach has been immensely helpful for me in the past, and I believe a focused video on software engineering would greatly benefit not only me but also many other students preparing for similar exams.

Thank you Sir 🙏 Apne itne kam time me video provide kr diya Aap best teacher ho ...

Thank you very much Sir. Please also upload Design and Analysis of Algorithms (DAA) one shot video 🙏🏻. We students love your content 😁

Sir, in chapter 4 Stack the Practice problem of mixed traversal the solution you have written has only 2 As but shouldn't it contain 3 As ? . Answer should be abbbacdddcca? am i right or wrong?

Thank you so much sir , it is really helpful. You are the best teacher ever. I am able to grasp all the things because of you. Really Thanks a lot 😁

6:56:42 option a is right, clarify sir

Mitochondria is the power house of the cell❌ Array starts at 0✅

Matlab man ki baat padh lete ho sir aap 😅 really searching for this type of video, Ahmedabad, Gujarat

thanks a bunch sir for all the efforts and quality content~

Thank you so much sir for uploading this ,, eagerly waiting for this video.......please next upload DAA in one shot....Please sir...🙏respect and love for whole KG team....🙏🙏🙏❤❤❤

Thanks Sir, Exam से One Week पहले सही Time पर मिल गया ये LifeSaver Video 🙏🙏

Sir I have a program in writing code so what will I do now do?

totally helpful,, worth like a gold during by sessional exams

17:11 premertive non premitive 21:20 homogeneous vs hetro 2:34:00 prefix postfix 2:53:00 recursion 3:00:45 recursion vs itteriation 3:08:00 recursion problems tree 3:17:00 fibnocci no. 4:13:00 que delt 4:54:00 binary tree 5:04:00 traversal tree 5:15:00 binary search tree 5:54:00 complete binary tree

really.... that's what is called an one shot... perfectly described... awesome video... thanks sir.

Such a great one shot sir 😍, it was very helpful for our semester exam and also understanding DS so easily.

Thankyou so much sir 😊😊😊 for Cristal clear Explanation 😊

At 2:03:55 in prefix order after - (minus) + (plus ) will be there ? - + a*/*bc^d^efdc

Thank u so much sir for this content❤❤

Sir these one shot is extremely helpful for ourselves.Thank you sir for best one shot ❤❤❤

This is a evergreen video sir ... Even after 10 years students can study from this video...

Thank You so much sir!! University based + notes + complete thing!! Incredible Sir!! Please keep making more videos for our university exams :)) Thank you again

Sir ,please upload Software Engineering next ! My exams are approaching ,Computer Networking one shot helped me to connect every dots of all the concepts i have studied earlier . Same i want SE too ! Thank you Sir :)

Sir, Your one shot video is very helpful for my semester exam please upload C++, AI & ML , Mathematics (M-3) and ADS(Advance data structures using C or C++) all these subjects one shot video please upload my exam is started within 10 days so, sir please upload fast very helpful your channel for me and others student also... 👏

kya koi batayega ki 1:29:31 time stamp per function ki 2nd line nahi honi chaiye bcz waha 1st line me jab newNode create kiya hai tabhi usko value initialize ho gayi hogi to dobara kyu karna agar KIsi ko pata ho to Please batao.....

hlo sir , your teaching style is awesome the concepts are crystal clear now , theit is one request sir can you please discuss the previous year questions of data structure cs303 of rgpv it will help a lot

Sir, You are LORD!!! You Really saved me I got back to back Compartment in DS due to less marks in Internals, from 3 years. Finally I can say I will score 80+ this time in theory. THANKS ALOT SARKAR❤

thankyou so much sir for this! found the perfect one shot video for data structure.

thankyou so much sir for giving us your precious time. your explanation is clear like a glass.

sie mind blowing preparation for semester sir hatts of to u

sir can you please create video for OOP(object oriented programming) with C++ within 3-4 days🙏🙏 because my exams are really near🥲🤕😓

This one short Series is very helpful sir, thanks you so much sir.

Thnq vry much it is so helpful for me to.prepare for my exams a proper study material u gave....❤❤❤

I searched lot of videos and this video is super good. this is perfect for me ❤❤❤❤❤ thanks sir ❤

Sir, your one-shot videos are very helpful. I am a 2nd year student pursuing CSE in KIIT. I watched your playlist of 'TOC | AUTOMATA THEORY '. The explanations of those videos are awesome but this playlist was created based on the GATE syllabus. Please bring a new one-shot video for this 'Theory of Computation' subject according to our college syllabus. It will also be very helpful for our semester exam.

I really appreciate him including humor, memes beside really quality content which is compact, no fluff material. He is indeed a really good teacher!

sir mera study me bilkul bhi mn nhi lgta tha but jb apki playlist dekha tbse daily study kr raha hu,....thank u so much please continues the series

Delhi, had a great experience in the 7 hours . a master weapon for exam . Thank you sir and thanks to the team.

Completed full DS while preparing for NET JRF really helpful , best short term revision of concept is done.....THANKS A LOT

you are a legit god of this teaching field thank you so much tomorrow is my exam it really was helpful to me.

Sir aapne 72 se start krne ko kha indexing but ye to hmesa 0 se suru hoga means array ka indexing jab tkk hum programming language bnate time ya nai programming language bnani pdegi ??

Sir you are thinking about students and love them sir i have watch all your videoes you are best teacher on Fore me love you sir. Har Har madha dev.

how many wants Compiler Design One Shot

Amazing explanation and the way you teach is excellent .... thank you

How it is possible to start array indexing from -3

AKTU ka. hai koii???

Waheguru ji tuhanu lambi umar bakshan..🙏

Something is wrong in the program at 1:30:00 because we are already assigning data in createNode function so we won't reassign it in the insertAfter function again. Also In insertAfter method there's no variable data so it doesn't make sense to reassign it.

sir very nice video. I got every concept of DSA for my exam point of view, Thank you so much sir🙌🙌

Dear sir take a one shot oops with c++ I have bpsc tre exam I have adda 24*7 classes but I didn't watch kyuki usse achha to sir me pdha lunga apka pura class dekhta hu then self study

we are waiting OOPS thank you sacnit sir

Thank You Sanchit Sir, the tree method for solving arithmetic expressions was amazing. It brought so much clarity to the concept relating the traversals of the tree with the prefix, infix and postfix notation. Amazing!!!

The way you teach is fabulous.

Bahut Achha Sir, This content is 1000 times better than neso👍👍👍... But there is a problem to download notes Which is provided in the description of Operation System in one video... Please solve this issue Sir 🙏🙏🙏🙏🙏

sir please DAA (Design and Analysis of Algorithm) ka bhi one shot release kar do soon❤❤

i wish i had you 8 years back when i was struggling in college and backlogs and mental health 😞

Thank you so much sir for your hardwork ❤❤

sir algorithms ki vdo kab upload krenge???

THANKS SIR! YOU ARE THE BEST!

Sir in the question where we have to insert at beginning with the help of key why we print with (&head)

Ek hi dil hai kitni bar jitenge sir ❤❤

Any one form inverties university bareilly ❤

Loved this video sir we want more one shots ❤❤❤❤

4:12:35 those Queue[R]= ITEM is a write position (outside the else block , because of if r ==-1 then also this need to insert the value in queue, this assignment is work for both block (if or else) , sir you says , this is inside the else part , code is already correct.

Ptu wala hai koi ❤

aktu wala hai koi yaha pe

Sir your dbms one shot video helped me a lot and i m now very confident that i can do good in my exam . Thanks a lot sir again ☺️☺️

jai hind jai bharat ..very helpful content Sir . Thanks and Regards

Anyone from lpu?

Great video sir...eill definitely help me score good marks in my sessional

Sir @ 1:42:50 I think option A is correct because q is already pointing to the second last node and if we consider option D which is saying that q->next=null then p would be null because q->next is p. I might be wrong. Plz reply

Please upload a one shot video on Mathematics-III (Differential Calculus)

thank you sm sir for this efforts you making for us, can you please make one-shot on software engineering, my final exams are coming near and I'll be greatfull to you if you'll upload one shot on Software engineering.

Sir it's really helpful thanks for this....😊

Thank you sir 🙏for such a good video and the syllabus which could not be covered in the whole semester was covered in just 7 hours. I also recommend this video to everyone who want to study data structure for semesters. Once again Thanks a lot sir 🙏

Thank you sm it was helpful! Please make the same time of video for oop (object oriented programming)!

1:02:05 m aapne Row major order lgaya h agr m column major order m krna h toh kisko kis se replace krma hoga pls tell

We want a playlist on DP sir, I am very excited to learn this from you sir, 💓💓

Nice Explain Sir Thank You So much ...

Thanku sir..🙏 you are so great gentleman..🙏

Looking smart sir ❤..... your voice melts my heart ❤️.... wonderful voice ❤🎉

sir your teaching method is very good .and thanks for helping us

your explanation makes this topics too easy !! thanks

Such a very useful video.........I like it soo much and it's really very helpful for those students who want to prepare the whole subject in one place .............😊 Thanku so much sir 🙏🏻

Amazing Video Sir, Please make a video on PHP programming.

01:20:40 No hate from my side sir! But not even a single code is running properly on my laptop from this timestamp. I am using CodeBlocks...Having issue to understand Linked List also...Kindly HELP!!!

❤❤sir! Can I say that internal nodes and parent nodes are the same nodes or the same thing?....

Very nice video and very nice explaination sir you are genius sir 🎉🎉🎉❤❤

Your One Shot Semester series has been exceptional for my exam preparation, sir. The clarity and speed with which you explain concepts are truly remarkable. With my AI exams approaching, I would be immensely grateful if you could consider creating a One Shot on AI for semester. It would be of great help. Thank you.