The Bible of Competitive Programming & Coding Interviews
Build the foundation in Algorithms and Data Structures to ace Competitive Programming & Coding Interviews
Created by Andrei Chiriac | 24 hours on-demand video course
This course is going to be your bible on solving each coding interview question and competitive programming challenge. The content is based on my 6 year experience of struggling to find and solve a wide range of problems and develop the system for mastering this skill. I cover the exact same content that has helped my students’ performance skyrocket and got them offers at top companies like Google, Facebook and Amazon and solid results in the International Competitive Programming Contests.
We start from basics such as Mathematics Fundamentals: Prime Numbers, Sieve of Eratosthenes, Fast Modular Exponentiation. Then we dive into interesting challenges and gold tricks on arrays and matrices, followed by Binary Search, Recursion and Divide and Conquer. We continue by exploring fundamental data structures such as Stack, Queue, Deque, Heap and Hash Table. Then, after building a solid foundation, we explore complex topics such as Greedy and Dynamic Programming, in which I reveal bulletproof formulas that guide you in solving every single problem of that specific type.
What you’ll learn
- Build a solid foundation to become a Competitive Programming wizard
- Master revolutionary data structures and various types of problems using each of them
- Learn fundamental algorithms and solve classical problems
- Get ready for Codeforces, CodeChef, Hackerrank, ACM-ICPC and more
Recommended Course
Master the Coding Interview: Data Structures + Algorithms
LeetCode In Python: 50 Algorithms Coding Interview Questions