Quick Start with Algorithm


This course offers numerous interactive coding challenges to help you comprehend and implement algorithms quickly. The challenges were designed by Donne Martin and are available in the GitHub repository donnemartin/interactive-coding-challenges.



In this course, you will learn how to quickly comprehend and implement a variety of algorithms through numerous interactive coding challenges.

🎯 Tasks

In this course, you will learn:

  • How to implement algorithms such as permutation, two sum, compression, hash map, string difference, Fizz Buzz, reverse string, unique characters, rotation, priority queue, linked list, partition, deletion, loop detection, sorting, stacks, queues, breadth-first search, shortest path, depth-first search, and tree balancing.

🏆 Achievements

After completing this course, you will be able to:

  • Effectively solve a wide range of algorithmic problems using various data structures and techniques.
  • Develop a deeper understanding of fundamental algorithms and their practical applications.
  • Enhance your problem-solving skills and become more proficient in coding and algorithm implementation.




Labby is the LabEx teacher.