A step-by-step guide with solved problems. I’m teaching visually with lots of examples.
Free tutorial
Created by Andrei Margeloiu
English
What you’ll learn
- Deeply understand basic Algorithms & Data Structures concepts
- Apply Algorithms & Data structures to new problems
- Analyse algorithms efficiency
- Find efficient algorithms
- Solve algorithmic problems!
- Learn more advanced topics
Requirements
- Desire to learn
- The basic syntax of C or C++
Description
***Big update – Dynamic programming***
- Fibonacci sequence
- Dynamic programming
- How to spot recurrence relations?
- 0/1 Knapsack problem
- Stack
- Check parenthesis expression
- Queue
“I learned a lot of things from this course. The GOLD trick was awesome.” Arpan P.
“I started thinking about problems in a more efficient way…” Mokshagna S.
“It’s deep, rich in information, consistent and dense” Laurentiu M.
“It’s a very good course, it focuses on building your concept.” Saransh S.
“Awesome, it’s just awesome” Yazan R.
I’m a competitive programmer, World Finalist in Google HashCode algorithmic challenge, and a 3x Gold Medalist in the Computing Olympiad C/C++. You will learn fundamentals Algorithms & Data structures fast and the knowledge will resist because I teach you using visual examples.
You will get my advice every time you need it! Just message me.
If you know the basics of C++, this course suits you perfectly !
I’ve designed this course to take you down a guided learning path. You will find some GOLD tricks sprinkled throughout the course that will help you become an algorithmic ninja!
What can you take from me ?
I have spent 5 years of my life learning this topic by myself. You have the possibility to take my knowledge for granted! I’m teaching in the way I learnt: with illustration and examples.
My Promise to You
Algorithms and Data structures brought me success and immense satisfaction. I created this course to share my knowledge with you because I love this topic and I promise to teach you with enthusiasm! If you need support, I will be just a message away.
My Approach
Practice, practice and more practice. After each lecture, I will guide you to solve little problems! The most important thing you can obtain from this course is to think like a problem solver!
Who this course is for:
- You, if you don’t know where to start.
- You, if you watched many YouTube videos without understanding!
- You, if you want to learn Algorithms & Data Structures fast!
- You, if you want to solve algorithmic problems!
Show less
Course content
5 sections • 39 lectures • 3h 15m total lengthCollapse all sections
Introduction2 lectures • 4min
- Introduction01:47
- Curriculum overview & Video quality01:44
Getting started2 lectures • 7min
- Installing IDE: Codeblocks03:00
- Creating a project04:21
Building a strong foundation29 lectures • 2hr 13min
- What is STL ?03:45
- Time is your single competitor00:43
- Global/Local variables: Part one03:27
- Global/Local variables: Part two04:39
- How to prepare for competitive programming ?00:10
- Global/Local variables3 questions
- Global/Local variables: Part three05:45
- Lessons from my CS degree00:12
- How debug effectively07:36
- Algorithms complexityPreview09:50
- Complexity analysis3 questions
- Appearance array05:04
- PRACTICAL EXERCISE – Counting sort02:18
- Stack06:20
- PRACTICAL EXERCISE: Check parenthesis expression06:25
- Queue05:50
- PRACTICAL EXERCISE00:27
- How to prepare for the coding interview?00:11
- Binary search09:52
- GOLD trick: Mars trickery05:24
- Finding first or last occurrence of a number07:07
- PRACTICAL EXERCISE00:16
- PRACTICAL EXERCISE – Number of occurrences05:23
- Basic sorting03:08
- Fast sorting: Sort from STL04:04
- PRACTICAL EXERCISE: Majority element03:43
- Data structures: Part one07:13
- Data structures: Part two04:47
- Constructors: Part one06:44
- Constructors: Part two08:13
- Sorting structures04:46
Dynamic programming4 lectures • 38min
- Fibonacci sequence03:56
- Dynamic programming12:02
- How to spot recurrence relations?05:06
- 0/1 Knapsack problem17:15
Becoming a PRO2 lectures • 13min
- Finding the ideal complexity03:33
- PRACTICAL EXERCISE: Finding a sum09:12
