Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Bisection/Binary search - Iterative implementation
Implement the get_val method and add search functionality for the class This clip is from the chapter "Algorithms - Search and abstract data structures" of the series "Python 3: Project-based Python, Algorithms, Data Structures".null
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Command line/Terminal basics
An introductory look at collections in Python This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about Python in-depth.
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Build A Queue With Two Stacks
Learn to write the most efficient code to mimic the behaviour of a queue using 2 stacks. 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...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Introduction To The Bellman Ford Algorithm
Dealing with negative weights have some quirks which are dealt with using 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...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Shortest Path In A Weighted Graph - A Greedy Algorithm
Find the shortest path in a weighted graph is a greedy 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...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Comparison Of Graph Representations
Compare the adjacency matrix, adjacency list and the adjacency set in terms of space and time complexity of common operations. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The...
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Build your own generators using yield
An in-depth look at building if elif and else blocks using conditional tests and boolean values This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is...
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Add some methods to the class
Create custom generators using yield This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about Python in-depth.
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - While loops, enumerate, zip
Explore some special methods like __init__ and __repr__ This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about Python in-depth.
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Iterators, for loops, generators, list comprehension
Add the add and remove_course methods to the class This clip is from the chapter "Python in-depth" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about Python in-depth.
Curated Video
C++ Standard Template Library in Practice - Course Review
The user would like to catch up on what was learned in this section. • Review the topics covered • Show excerpts of the previous slides • Thank the audience for watching This clip is from the chapter "C++ 20 Preview" of the series "C++...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Count Trees, Print Range and Is BST
Count the number of structurally unique binary trees that can be built with N nodes, print the nodes within a certain range in a binary search tree and check whether a certain binary tree is a binary *search* tree. This clip is from the...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Depth First - Pre-OrderTraversal
Depth first traversal can be of 3 types based on the order in which the node is processed relative to its left and right sub-trees. Pre-order traversal processes the node before processing the left and then the right sub trees. This clip...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Representing A Graph In Code
The graph interface allows building up a graph by adding edges and traversing a graph by giving access to all adjacent vertices of any vertex. This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures &...
Economics Explained
High Frequency Trading (Hfts): Reactionary Algorithm
The New York Stock Exchange is the world's largest and most liquid securities market. It's where many of world's largest companies list their shares to be traded amongst millions of investors worldwide; ranging from small individual...
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Thank you for taking the course and next steps
Start building the set_val method and introduce python's hash function This clip is from the chapter "Algorithms - Search and abstract data structures" of the series "Python 3: Project-based Python, Algorithms, Data Structures".null
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - BST - Deleting nodes with 1 child node
Replace the while loop built in the iterative solution in the prior video with recursive function calls to achieve the same goal This clip is from the chapter "Algorithms - Search and abstract data structures" of the series "Python 3:...
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Intro to search - Linear, Bisection/Binary search
Modify set_val method to include update functionality This clip is from the chapter "Algorithms - Search and abstract data structures" of the series "Python 3: Project-based Python, Algorithms, Data Structures".null
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Recursion mini-project 3 - Fibonacci series
Get the list size and range of ints for each list element from the user during program execution This clip is from the chapter "Algorithms - Sort, performance, complexity and big O notation" of the series "Python 3: Project-based Python,...
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - A look at the recursive divide function
Implement Quicksort algorithm step by step This clip is from the chapter "Algorithms - Sort, performance, complexity and big O notation" of the series "Python 3: Project-based Python, Algorithms, Data Structures".This section is about...
Curated Video
Python 3: Project-based Python, Algorithms, Data Structures - Performance measures - deep dive with a programmatic view
Analyze execution context and frames created by recursive divide function in-depth This clip is from the chapter "Algorithms - Sort, performance, complexity and big O notation" of the series "Python 3: Project-based Python, Algorithms,...
Curated Video
C++ Standard Template Library in Practice - Auxiliary Iterator Functions
We want to know what functions are available for making working with iterators simpler. • Learn what functions are available to make working with iterators more generic • Learn what these different functions can do • Show them in action...
Curated Video
From 0 to 1 Data Structures & Algorithms in Java - Binary Search - search quickly through a sorted list
Binary search is a pretty nifty way to search through a sorted list in O(Log N) time. 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 Minimum Element In A Stack In Constant Time
Learn to keep track of the minimum element of a stack as it changes. 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,...