Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Bubble Sort
Bubble sort has an adaptive sort with the same time complexity as selection sort. This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various sorting and...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Find The Shortest Path In A Weighted Graphs - Fewer Edges Better
Find the shortest path in a weighted graph where the number of edges also determine which path is shorter. This clip is from the chapter "Graph Problems" of the series "From 0 to 1: Data Structures & Algorithms in Java".null
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Use Cases And Implementation Of Prim's Algorithm
Let's see how we implement Prim's algorithm in Java. This clip is from the chapter "Spanning Tree Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Prim's algorithm is very similar to Dijkstra's shortest path...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Implementation Of The Bellman Ford Algorithm
Learn to implement the Bellman Ford Algorithm. This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted graph. We...
Curated Video
Complete Modern C++ - introduces the components of the STL
This video introduces the components of the STL. This clip is from the chapter "Standard Template Library" of the series "Complete Modern C++".This section is the description of the standard template library.
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - The Circular Queue - Tricky But Fast
Let's see how to implement the circular queue. This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we build stack function in Java, meet problems using...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Design A Course Schedule Considering Pre-reqs For Courses
Given a course list and pre-reqs for every course design a course schedule so pre-reqs are done before the courses. This clip is from the chapter "Graph Problems" of the series "From 0 to 1: Data Structures & Algorithms in Java".null
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Implementation Of Dijkstra's Algorithm
The implementation of Dijkstra's algorithm in Java. This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted graph. We...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Introduction To The Weighted Graph
Graphs whose edges have a weight associated are widely used to model real world problems (traffic, length of path etc). This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Implementation Of The Shortest Path In An Unweighted Graph
Shortest path implementation in Java. This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted graph. We implement...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Implementation Of Topological Sort
Here is the code in Java to implement topological sort. This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Topological sort is an ordering of vertices in a graph where a...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Graph Using An Adjacency List And Adjacency Set
Learn about adjacency list and the adjacency set which are alternate ways to represent a graph. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces you to various...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Graph Using An Adjacency Matrix
The graph vertices are rows and columns of the matrix and the cell value shows the relationship between the vertices of a graph. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Heap Sort Phase II - The Actual Sort
Phase II actually outputs the final sorted array. It involves removing the elements from the heap and placing it in a sorted array. This clip is from the chapter "Revisiting Sorting - The Heap Sort" of the series "From 0 to 1: Data...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Insert And Remove From A Heap
Learn to add and remove elements from a heap. This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we learn about Heap data structure, build a real heap in Java and...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Meet The Binary Heap - It's A Tree At Heart
The Binary Heap is logically a Binary Tree with specific constraints. The heap property and the shape property determine whether a Binary Tree is really a Heap. This clip is from the chapter "Heaps" of the series "From 0 to 1: Data...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - The Heap Is Just The Best Way to Implement a Priority Queue
Learn more about common operations on a Priority Queue are insertion, accessing the highest priority element and removing the highest priority element. This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures &...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Topological Sort In A Graph
This video will make things easy to follow. Topological sort is widely used in real world problems. This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Topological sort is an...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Depth First - In-Order and Post-Order Traversal
Depth first traversal can be of 3 types based on the order in which the node is processed relative to it's left and right sub-trees. This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures & Algorithms in...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Meet The Queue - A Familiar Sight In Everyday Life
Learn more about queues which are much more intuitive as there are plenty of real world examples where a queue is the fair and correct way of processing. This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Graph Traversal - Depth First And Breadth First
Common traversal methods of trees apply to graphs as well. There is an additional wrinkle with graphs, dealing with cycles and with unconnected graphs. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures &...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Breadth First Traversal
Let's visualize breadth first traversal and see how it's implemented. This clip is from the chapter "Binary Trees" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we study more about binary trees using...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Quick Sort
Let's see what makes quick sort so attractive. This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various sorting and searching functions from this section.
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Linked Lists vs Arrays
Learn how you can make an informed choice between Linked lists and arrays which solve the same kind of problems, holding a list or a collection. This clip is from the chapter "Linked Lists" of the series "From 0 to 1: Data Structures &...