Search result for Solving algorithmic problems Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 25 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Algorithmic Toolbox
by Alexander S. Kulikov , Michael Levin , Neil Rhodes , Pavel Pevzner , Daniel M Kane- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 39 hours to complete
The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. Solving the Sum of Two Digits Programming Challenge (screencast) Solving Programming Challenges Algorithmic Warm-up Essential algorithmic techniques Practice solving algorithmic interview problems...
Data Structures and Algorithms in Java For Coding Interview
by El Farouk Yasser- 4.2
-
![]()
![]()
![]()
![]()
![]()
6 hours on-demand video
This is the most comprehensive online course to help you with your coding interviews and solving algorithmic problems with Data Structures! This course utilizes Java's strong standard library to efficiently teach you what you need to know to solve basic algorithmic and data structures interview problems in the coding interview! We discuss data structures and algorithmic techniques such as:...
$12.99
Data Structures and Algorithms in C++ For Coding Interview
by El Farouk Yasser- 4
-
![]()
![]()
![]()
![]()
![]()
7 hours on-demand video
This is the most comprehensive online course to help you with your coding interviews and solving algorithmic problems with Data Structures! This course utilizes C++'s strong standard library to efficiently teach you what you need to know to solve basic algorithmic and data structures interview problems in the coding interview! We discuss data structures and algorithmic techniques such as:...
$16.99
NP-Complete Problems
by Daniel Kane , Alexander S. Kulikov- 0.0
-
![]()
![]()
![]()
![]()
![]()
3 Weeks
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques. Step into the area of more complex problems and learn advanced algorithms to help solve them. You will practice solving large instances of some of these problems despite their hardness using very efficient specialized software and algorithmic techniques including:...
$150
Approximation Algorithms
by Mark de Berg- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
Many real-world algorithmic problems cannot be solved efficiently using traditional algorithmic tools, for example because the problems are NP-hard. The goal of this course is to become familiar with important algorithmic concepts and techniques needed to effectively deal with such problems. - Basic calculus: manipulating summations, solving recurrences, working with logarithms, etc....
Competitive Programmer's Core Skills
by Alexander S. Kulikov , Alexander Logunov , Kirill Simonov , Aliaksei Tolstsikau- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 32 hours to complete
Along the way you’ll also gain useful skills for which competitive programmers are so highly valued by employers: ability to write efficient, reliable, and compact code, manage your time well when it’s limited, apply basic algorithmic ideas to real problems, etc. And, you’ll hone all these skills by solving practice problems, which are just like problems on real competitions....
Algorithmic Design and Techniques
by Pavel Pevzner , Daniel Kane , Alexander S. Kulikov , Michael Levin- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Learn how to design algorithms, solve computational problems and implement solutions efficiently. In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn basic algorithmic techniques and ideas for computational problems, which arise in practical applications such as sorting and searching, divide and conquer, greedy algorithms and dynamic programming....
$99
Related searches
Principles of Computing (Part 2)
by Scott Rixner , Joe Warren , Luay Nakhleh- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 16 hours to complete
Developing such algorithmic thinking skills will be critical to writing large scale software and solving real world computational problems. What is Algorithmic Thinking?...
Python for Beginners: Solve 50 Exercises Live
by Tanmay Garg- 4.1
-
![]()
![]()
![]()
![]()
![]()
19 hours on-demand video
Once started you will become addicted to short and beautiful syntax of python but don't we fooled by it's simplicity we will look at some of the very challenging problems and solve them in just few lines of code. We start from basics like printing, looping to advanced features like regular expressions, algorithmic complexity. Algorithmic Complexity...
$11.99
Computational Geometry
by Alexander S. Kulikov , Aliaksei Tolstsikau , Kira Vyatkina- 3.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 19 hours to complete
This course represents an introduction to computational geometry – a branch of algorithm theory that aims at solving problems about geometric objects. 4 Algorithmic details...
