This Algorithms and Data Structures course will teach you everything you need to prepare for placements, interviews and logic building.
This playlist will teach you how to create optimal solutions to your real world problems. We will cover a wide variety of data structures and algorithms in this course. Make sure to access the notes I have provided along with the course.
Videos in this playlist 80
Introduction to Data Structures & Algorithms
Time Complexity and Big O Notation (with notes)
Asymptotic Notations: Big O, Big Omega and Big Theta Explained (With Notes)
Best Case, Worst Case and Average Case Analysis of an Algorithm (With Notes)
How to Calculate Time Complexity of an Algorithm + Solved Questions (With Notes)
Arrays and Abstract Data Type in Data Structure (With Notes)
Array as An Abstract Data Type in Data Structures(With Notes)
Implementing Array as an Abstract Data Type in C Language
Operations on Arrays in Data Structures: Traversal, Insertion, Deletion and Searching
Coding Insertion Operation in Array in Data Structures in C language
Coding Deletion Operation in Array Using C Language (With Notes)
Linear Vs Binary Search + Code in C Language (With Notes)
Introduction to Linked List in Data Structures (With Notes)
Linked List Data Structure: Creation and Traversal in C Language
Insertion of a Node in a Linked List Data Structure
Insertion in a Linked List in C Language
Deletion in a Linked List | Deleting a node from Linked List Data Structure
Delete a Node from Linked List (C Code For Deletion From Beginning, End, Specified Position & Key)
Circular Linked List and Operations in Data Structures (With Notes)
Circular Linked Lists: Operations in C Language
Doubly Linked Lists Explained With Code in C Language
Introduction to Stack in Data Structures
Implementing Stack Using Array in Data Structures
C Code For Implementing Stack Using Array in Data Structures
Push, Pop and Other Operations in Stack Implemented Using an Array
Coding Push(), Pop(), isEmpty() and isFull() Operations in Stack Using an Array| C Code For Stack
Peek Operation in Stack Using Arrays (With C Code & Explanation)
stackTop, stackBottom & Time Complexity of Operations in Stack Using Arrays
How to Implement Stack Using Linked List?
Implementing all the Stack Operations using Linked List (With Code in C)
peek(), stackTop() and Other Operations on Stack Using Linked List (with C Code)
Parenthesis Matching Problem Using Stack Data Structure (Applications of Stack)
Parenthesis Checking Using Stack in C Language
Multiple Parenthesis Matching Using Stack with C Code
Infix, Prefix and Postfix Expressions
Infix To Postfix Using Stack
Coding Infix to Postfix in C using Stack
Queue Data Structure in Hindi
Queue Implementation: Array Implementation of Queue in Data Structure
Array implementation of Queue and its Operations in Data Structure
C Code For Queue and its Operations Using Arrays in Data Structure
Introduction to Circular Queue in Data Structures
enqueue(), dequeue() & other Operations on Circular Queue
C Code For Circular Queue & Operations on Circular Queue in Hindi
Queue Using Linked Lists
Implementing Queue Using Linked List in C Language (With Code)
Double-Ended Queue in Data Structure (DE-Queue Explained)🔥
Introduction to Sorting Algorithms
Criteria For Analysis of Sorting Algorithms
Bubble Sort Algorithm in Hindi
Bubble Sort Program in C
Insertion Sort Algorithm in Hindi
Insertion Sort in C Language (With Explanation)
Selection Sort Algorithm
Selection Sort Program in C
QuickSort Algorithm in Hindi (With Code in C)
Analysis of QuickSort Sorting Algorithm
MergeSort Sorting Algorithm in Hindi
MergeSort Source Code in C (Helpful Explanation)
Count Sort Algorithm
Introduction to Trees
What is a Binary Tree?
Types of Binary Trees
Representation of a Binary Tree
Linked Representation Of Binary Tree in C
Traversal in Binary Tree (InOrder, PostOrder and PreOrder Traversals)
Preorder Traversal in a Binary Tree (With C Code)
PostOrder Traversal in a Binary Tree (With C Code)
InOrder Traversal in a Binary Tree (With C Code)
*Best* Trick To Find PreOrder, InOrder & PostOrder Traversal
Binary Search Trees: Introduction & Properties
Checking if a binary tree is a binary search tree or not!
Searching in a Binary Search Trees (Search Operation)
C Code For Searching in a BST
Iterative Search in a Binary Search Tree
Insertion in a Binary Search Tree
Deletion in a Binary Search Tree
C Code For Deletion in a Binary Search Tree
AVL Trees - Introduction
Insertion and Rotation in AVL Tree
Advantages and disadvantages
Advantages
Free and complete: every lecture is in the playlist, in order.
Watch at 1.5x, skip what you know, rewatch what you don't.
Taught in Hindi (or Hinglish), which many students find easier to follow.
Made for Indian students, with placement and exam context.
8,085,494 views, so help and notes are easy to find.
Completely free.
Self-paced: start any time.
A clear syllabus (80 videos) you can see before you start.
Disadvantages
No certificate, deadlines or graded work.
Quality and depth vary: check that the playlist is finished before you start.
Less depth than a university course on some topics.
No certificate.
No graded assignments or feedback.
Recorded in 2020: tools may have changed since.
Some points apply to every course of this kind; see how we rank.
Free
Free: Watch on YouTube, no account needed.
Certificate: None. Code or take notes along to make it stick.
Instructor: Prof. Gary Gensler View the complete course: https://ocw.mit.edu/15-S12F18 This course is for students wishing to explore blockchain technology’s potential use - by entrepreneurs & incumbents - to change the world of money and finance. License: Creative Commons BY-NC-SA More information…
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performa…
This is CS50P, CS50's Introduction to Programming with Python. Register for free at https://cs50.edx.org/python. Slides and source code at https://cs50.harvard.edu/python. Playlist at https://www.youtube.com/playlist?list=PLhQjrBD2T3817j24-GogXmWqO5Q5vYy0V. An introduction to programming using a la…
This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming, for concentrators and non-concentrators alike, with or without prior programming experience. (Two thirds of CS50 students have never taken CS before.) This course teaches…
Instructor: Ana Bell View the complete course: https://ocw.mit.edu/courses/6-100l-introduction-to-cs-and-programming-using-python-fall-2022/ *Note: Lectures 6, 10 have been updated! This subject is aimed at students with little to no programming experience. It aims to provide students with an under…
