Mosh Hamedani – The Ultimate Data Structures & Algorithms: Part 3 | Instant Download !
Sale page: Mosh Hamedani – The Ultimate Data Structures & Algorithms: Part 3
Studied Computer Science – but never really understood the complex topic of data structures and algorithms?
Or maybe you’re a self-taught programmer, with little to no knowledge of this important topic.
Or perhaps you failed a job interview because you couldn’t answer basic data structure and algorithm questions.
So, why are data structures so important these days?
Data structures and algorithms are patterns for solving problems. Developers who know more about data structures and algorithms are better at solving problems. That’s why companies like Google, Microsoft and Amazon always include interview questions on data structures and algorithms. They want to assess your problem-solving skills. They don’t care how many programming languages and frameworks you’re familiar with.
A complex topic made simple
That’s why I made this course. I want to demystify data structures and algorithms once and for all.
I remember being hopelessly confused when my college lecturer tried to teach it, many moons ago. So I had to teach myself. Now I’m an expert on the topic, and I want to save you the dozens of hours I wasted at the library trying to wrap my head around it.
By the end of this course…
You’ll be able to:
- Ace your next coding interview
- Write better, faster code
- Become a better developer
- Improve your problem solving skills
- Master computer science fundamentals
- Implement all the essential data structures from scratch
- Master dozens of popular algorithms
What you’re going to learn
This course is the third of a series. In the first part, we covered the linear data structures (Arrays, Linked Lists, Stacks, Queues and Hash Tables). In the second part, we covered the non-linear data structures (Binary Trees, AVL Trees, Heaps, Tries and Graphs). Part 3 explores additional algorithms that every developer must study.
Here’s what you’re going to learn in this part:
- Searching Algorithms
- Sorting Algorithms
- String Manipulation Algorithms
This is the most comprehensive data structures and algorithms series online. Every example and exercise is picked from popular interview questions asked by Google, Microsoft, Amazon and other big companies.
Who is this course for?
- Anyone preparing for a coding job interview
- Computer science students whose lecturers failed to explain the topics
- Self-taught developers who missed out on a computer science degree
- Anyone who wants to become a better developer
Getting Started (1m)
Start1- Introduction (0:45)
Start2- Course Code
Sorting Algorithms (75m)
Preview1- Introduction (1:00)
Preview2- Bubble Sort (3:10)
Preview3- Bubble Sort- Implementation (6:24)
Preview4- Selection Sort (2:41)
Start5- Selection Sort- Implementation (3:23)
Start6- Insertion Sort (3:58)
Start7- Insertion Sort- Implementation (2:28)
Start8- Merge Sort (5:06)
Start9- Merge Sort- Implementation (8:04)
Start10- Quick Sort (3:14)
Start11- Partitioning (6:01)
Start12- Quick Sort- Implementation (9:00)
Start13- Counting Sort (4:08)
Start14- Counting Sort- Implementation (2:48)
Start15- Bucket Sort (4:18)
Start16- Bucket Sort- Implementation (7:07)
Searching Algorithms (35m)
Start1- Introduction (0:46)
Start2- Linear Search (1:04)
Start3- Linear Search- Implementation (1:36)
Start4- Binary Search (3:47)
Start5- Binary Search- Recursive Implementation (4:52)
Start6- Binary Search- Iterative Implementation (2:14)
Start7- Ternary Search (3:27)
Start8- Ternary Search- Implementation (4:12)
Start9- Jump Search (3:16)
Start10- Jump Search- Implementation (3:54)
Start11- Exponential Search (2:47)
Start12- Exponential Search- Implementation (2:55)
String Manipulation Algorithms (60m)
Start1- Introduction (0:35)
Start3- Useful Java Methods
Start4- Count Vowels (4:49)
Start5- Reverse a String (5:40)
Start6- Reverse Words (6:13)
Start7- Rotations (5:48)
Start8- Remove Duplicates (3:12)
Start9- Most Repeated Char (7:12)
Start10- Sentence Capitalization (6:38)
Start11- Anagrams- Using Sorting (6:07)
Start12- Anagrams- Using Histogramming (6:18)
Start13- Palindrome (4:25)
Start14- Course Wrap Up (1:06)