What you'll learn
- How to solve coding interview problems
- How to use recursion, dynamic programming, memoization, divide and conquer, backtracking...
- How to solve problems related to various data structures
- How to analyze time and space complexity of an algorithm
Requirements
- Basics in algorithms, data structures, and time/space complexity analysis
Description
Preparing for coding problems? Competitive programming? Then this course will help you for sure: 50 well-chosen problems to increase your problem-solving skills!
Many algorithms concepts covered: dynamic programming, divide and conquer, memoization, backtracking...
And many data structures used: arrays, hashmaps, sets, trees, stacks...
And also, time and space complexity analysis is provided for every problem!
Who this course is for:
- People preparing for coding interviews
- Competitive programmers
- People who want to increase their problem-solving skills
The 50 popular interview coding problems course, the course you should take if you're preparing for coding interviews or if you want to increase your problem-solving skills
The 50 popular interview coding problems course, the course you should take if you're preparing for coding interviews or if you want to increase your problem-solving skills
Why? Because the course covers different topics on algorithms (dynamic programming, backtracking, divide and conquer...) and on data structures (arrays, linked lists, stacks, trees, graphs...), all that while learning how to solve problems and how to optimize time and space complexity
But wait..there's more, lectures of this course are very rich and complete, you can have a look at free preview lectures below
And also, you will be able to ask questions when you don't understand something! isn't that amazing?
Still hesitating? Know that you have a 30 days money-back guarantee, so you have nothing to lose!
Want to know what problems are covered?
