Doing a Lot with Very Little
6 lectures 43:54
The Course Overview
This video will give you an overview about the course.
From Painfully Slow to Optimal: The Maximum Sum Subarray
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
Find the Factorial with a Given Number of Zeros
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
Find the Given-Length Subarray with the Maximum Minimum
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Array Problems Involving Modulos
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Useful Math: The Inclusion-Exclusion Principle
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
Doing a lot with very little - Quiz
Doing a Lot with Very Little
6 lectures 43:54
The Course Overview
This video will give you an overview about the course.
From Painfully Slow to Optimal: The Maximum Sum Subarray
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
Find the Factorial with a Given Number of Zeros
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
Find the Given-Length Subarray with the Maximum Minimum
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Array Problems Involving Modulos
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Useful Math: The Inclusion-Exclusion Principle
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
Doing a lot with very little - Quiz
The Course Overview
This video will give you an overview about the course.
The Course Overview
This video will give you an overview about the course.
The Course Overview
This video will give you an overview about the course.
The Course Overview
This video will give you an overview about the course.
This video will give you an overview about the course.
This video will give you an overview about the course.
From Painfully Slow to Optimal: The Maximum Sum Subarray
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
From Painfully Slow to Optimal: The Maximum Sum Subarray
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
From Painfully Slow to Optimal: The Maximum Sum Subarray
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
From Painfully Slow to Optimal: The Maximum Sum Subarray
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
This video presents the optimal solution (Kadane’s algorithm) for the maximum sum subarray problem and how to arrive at it by optimizing less efficient algorithms.
• Understand the problem with examples
• Go over some naive solutions
• Arrive at the optimal solution and implement it
Find the Factorial with a Given Number of Zeros
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
Find the Factorial with a Given Number of Zeros
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
Find the Factorial with a Given Number of Zeros
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
Find the Factorial with a Given Number of Zeros
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
The video explains how to find a factorial, that ends with a given number of trailing zeros, by using some mathematical reasoning and a binary search.
• Introduce factorials
• Efficiently counting trailing zeros in n factorial
• Implement the solution using binary search
Find the Given-Length Subarray with the Maximum Minimum
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Find the Given-Length Subarray with the Maximum Minimum
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Find the Given-Length Subarray with the Maximum Minimum
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Find the Given-Length Subarray with the Maximum Minimum
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Explain the problem requirements with reference to video 1.4
• Understand why binary search and deque is adequate here
• Implement the solution, think about an even faster solution
• Implement the optimal solution using a deque
Array Problems Involving Modulos
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Array Problems Involving Modulos
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Array Problems Involving Modulos
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Array Problems Involving Modulos
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Understand the problem with examples
• Draw some parallels to video 1.5
• Implement the discussed solution
• Implement an efficient solution for the problem
Useful Math: The Inclusion-Exclusion Principle
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
Useful Math: The Inclusion-Exclusion Principle
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
Useful Math: The Inclusion-Exclusion Principle
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
Useful Math: The Inclusion-Exclusion Principle
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
The video presents the inclusion-exclusion principle and its application to two basic problems, as well as a recursive implementation for one of the problems.
- Understand the inclusion-exclusion principle and why it is useful
- Solve a problem mathematically using inclusion-exclusion principle
- Understand the inclusion-exclusion solution for a problem
Doing a lot with very little - Quiz
Doing a lot with very little - Quiz
Doing a lot with very little - Quiz
Doing a lot with very little - Quiz
More Complex Algorithms on Arrays.
5 lectures 38:54
Rolling Hashes for Constructing a Palindrome
The video presents an algorithm using rolling hashes, for optimally determining the minimum number of characters we need, to append to a string, in order to turn it into a palindrome.
- Recap palindromes and briefly explain hashes
- Understand the math behind rolling hashes and the solution
- Implement the solution and discuss potential shortcomings
Efficiently Counting Subarrays with a Given Sum
This video shows how we can draw on ideas from video 1.5 in order to efficiently count how many subarrays have a given sum.
- Understand the problem with examples
- Draw some parallels to video 1 zations, using standard Python
- Understand a very powerful optimization using NumPy
This video presents four...
