Conclusion - Congratulations
Thank you for completing this course!
Strings & Arrays - Remove Dupes
In this lesson, we’ll discuss how to remove duplicates from a string. We’ll cover two different solutions and see how ES2015 constructs can greatly simplify our code.
Strings & Arrays - String Rotation
We’ll discuss how to determine if two strings are rotations of one another. We’ll go over a brute-force solution and an elegant solution.
Advanced Strings & Arrays - Maximum Profits
We’ll discuss how to write a function that can reap the maximum profits from a day’s stock data. We’ll discuss both the simple brute-force solution and an elegant solution to this problem.
Advanced Strings & Arrays - All Anagrams
Learn how to determine if multiple strings are all anagrams of each other. While it seems as if this would require a fairly poor time and space complexity, we can come up with clever solutions that make this problem tractable.
Have questions about Deep Equals? Go for it!
Strings & Arrays - Is Unique
We’ll discuss three ways to determine if all characters in a string are unique. Each has benefits and drawbacks regarding time and space complexity.
Strings & Arrays - Highest Frequency
In this problem, we’ll learn how to keep a count of values as we go through an array. From that data, we’ll return the most common string in the array.
Advanced Strings & Arrays - Single Mutation
We’ll determine how to tell if two different strings are similar or extremely different. We’ll also cover the idea of the double-condition loop, another tool to add to our repertoire.
Advanced Strings & Arrays - Array Subset
Algorithms & Data Structures - Linked List Cycles
Learn how to find cycles in a Linked List. We’ll cover two different methods.
Algorithms & Data Structures - Balanced Brackets
Learn how to determine if brackets are balanced or not. This is an actual problem that software developers must occasionally solve and many dev tools have their own implementation of it. We’ll learn how a code editor can pick up our mistakes and highlight exactly which brackets don’t match.
Introduction - Welcome
Welcome to the course!
Strings & Arrays - Flatten Array
This problem will allow us to perform a task that has practical uses in a developer’s career. We’ll discuss how to flatten deeply nested arrays and why a recursive solution is a good way to attack this problem.
Advanced Strings & Arrays - Rotate Matrix
Advanced Strings & Arrays - Rotate Matrix, Advanced
Learn how to rotate a matrix in place. We’ll go over the complex algorithm required in heavy detail.
Algorithms & Data Structures - Sorted Search
Learn two different ways to complete the search of a sorted array. We’ll go over the brute force method and a more elegant method.
Algorithms & Data Structures - Creating a Queue with O(1) Operations
Learn how to create a queue with constant-time enqueue and dequeue operations.
Algorithms & Data Structures - Creating a Queue with Limited Data Structures
Learn how to create a queue when the only data structure you have access to is a stack.
Have questions about Function Bind? Go for it!
We’ll add yet another tool to our toolbelt in this lesson. We’ll learn memoization, a technique of storing data that has already been computed for later use.