Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/labex-labs/quick-start-with-algorithm
[Quick Start with Algorithm] This repository collects 90 of programming scenarios (labs and challenges) for 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 a...
https://github.com/labex-labs/quick-start-with-algorithm
List: quick-start-with-algorithm
algorithm awesome awesome-list challenges course education hands-on labex labs programming python
Last synced: 5 days ago
JSON representation
[Quick Start with Algorithm] This repository collects 90 of programming scenarios (labs and challenges) for 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 a...
- Host: GitHub
- URL: https://github.com/labex-labs/quick-start-with-algorithm
- Owner: labex-labs
- Created: 2024-05-22T07:02:01.000Z (6 months ago)
- Default Branch: master
- Last Pushed: 2024-08-01T01:26:32.000Z (4 months ago)
- Last Synced: 2024-08-01T04:21:36.531Z (4 months ago)
- Topics: algorithm, awesome, awesome-list, challenges, course, education, hands-on, labex, labs, programming, python
- Homepage: https://labex.io/skilltrees/python
- Size: 27.3 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Quick Start with Algorithm
[](https://labex.io/courses/quick-start-with-algorithm)
[](https://labex.io/courses/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.
## Environment
LabEx is an interactive, hands-on learning platform dedicated to coding and technology. It combines labs, AI assistance, and virtual machines to provide a no-video, practical learning experience.
- A strict “Learn by Doing” approach with exclusive hands-on labs and no videos.
- Interactive online environments within the browser, with automated step-by-step checks.
- A structured content organization with the Skill Tree based learning system.
- A growing learning resource of 30 Skill Trees and over 6,000 Labs.
- The AI learning assistant Labby, built on ChatGPT, providing a conversational learning experience.
Learn more about [LabEx VM](https://support.labex.io/using-labex/virtual-machine).
## Exercises
| Index | Name | Difficulty | Practice |
|---------|---------------------------------------------------------|--------------|-------------------------------------------------------------------------------------------------------------------------------------------|
| 01 | 🎯 Permutation Check of String Pairs | ★☆☆ | Start Challenge |
| 02 | 🎯 Solving the Two Sum Problem | ★☆☆ | Start Challenge |
| 03 | 🎯 Compress String Using Python | ★☆☆ | Start Challenge |
| 04 | 🎯 Implement Hash Table with Key-Value Operations | ★☆☆ | Start Challenge |
| 05 | 🎯 Find Differing Character in Strings | ★☆☆ | Start Challenge |
| 06 | 🎯 Implement Fizz Buzz in Python | ★☆☆ | Start Challenge |
| 07 | 🎯 String Compression Challenge | ★☆☆ | Start Challenge |
| 08 | 🎯 Reverse String In-Place Programming | ★☆☆ | Start Challenge |
| 09 | 🎯 Unique Character String Validation | ★☆☆ | Start Challenge |
| 10 | 🎯 Determine String Rotation in Computer Science | ★☆☆ | Start Challenge |
| 11 | 🎯 Efficient Array-Backed Priority Queue Implementati... | ★☆☆ | Start Challenge |
| 12 | 🎯 Linked List Data Structure | ★☆☆ | Start Challenge |
| 13 | 🎯 Reverse Order Number Addition in Python | ★☆☆ | Start Challenge |
| 14 | 🎯 Partition Linked List Around Value | ★☆☆ | Start Challenge |
| 15 | 🎯 Deleting Middle Node in Python Linked List | ★☆☆ | Start Challenge |
| 16 | 🎯 Find Loop Start | ★☆☆ | Start Challenge |
| 17 | 🎯 Kth To Last Elem | ★☆☆ | Start Challenge |
| 18 | 🎯 Removing Duplicates in Linked Lists | ★☆☆ | Start Challenge |
| 19 | 🎯 Palindrome Detection in Linked Lists | ★☆☆ | Start Challenge |
| 20 | 🎯 Implementing Multiple Stacks Using Array | ★☆☆ | Start Challenge |
| 21 | 🎯 Sorting Stack Using Additional Stack | ★☆☆ | Start Challenge |
| 22 | 🎯 Set of Stacks | ★☆☆ | Start Challenge |
| 23 | 🎯 Implement O(1) Stack with Push, Pop, Min | ★☆☆ | Start Challenge |
| 24 | 🎯 Implementing Queue Using Linked List | ★☆☆ | Start Challenge |
| 25 | 🎯 Concise Introduction to Stacks | ★☆☆ | Start Challenge |
| 26 | 🎯 Queue From Stacks | ★☆☆ | Start Challenge |
| 27 | 🎯 Breadth-First Search Graph Traversal Algorithm | ★☆☆ | Start Challenge |
| 28 | 🎯 Graph Shortest Path | ★☆☆ | Start Challenge |
| 29 | 🎯 Depth-First Traversal of Binary Trees | ★☆☆ | Start Challenge |
| 30 | 🎯 Balanced Binary Tree in Python | ★☆☆ | Start Challenge |
| 31 | 🎯 Binary Tree Lowest Common Ancestor | ★☆☆ | Start Challenge |
| 32 | 🎯 Graph Data Structure Fundamentals | ★☆☆ | Start Challenge |
| 33 | 🎯 Trie Data Structure for String Storage | ★☆☆ | Start Challenge |
| 34 | 🎯 Bst Second Largest | ★☆☆ | Start Challenge |
| 35 | 🎯 Graph Build Order | ★☆☆ | Start Challenge |
| 36 | 🎯 Min Heap Binary Tree Introduction | ★☆☆ | Start Challenge |
| 37 | 🎯 Determine Binary Tree Height | ★☆☆ | Start Challenge |
| 38 | 🎯 Binary Search Tree In-Order Successor | ★☆☆ | Start Challenge |
| 39 | 🎯 Depth-First Search on Directed Graphs | ★☆☆ | Start Challenge |
| 40 | 🎯 Inverting Binary Tree Technique | ★☆☆ | Start Challenge |
| 41 | 🎯 Breadth-First Traversal Binary Tree | ★☆☆ | Start Challenge |
| 42 | 🎯 Minimal Height Binary Search Tree | ★☆☆ | Start Challenge |
| 43 | 🎯 Graph Shortest Path Unweighted | ★☆☆ | Start Challenge |
| 44 | 🎯 Graph Path Exists | ★☆☆ | Start Challenge |
| 45 | 🎯 Validating Binary Search Tree | ★☆☆ | Start Challenge |
| 46 | 🎯 Binary Search Tree Implementation in Python | ★☆☆ | Start Challenge |
| 47 | 🎯 Tree Level Lists | ★☆☆ | Start Challenge |
| 48 | 🎯 Rotated Array Search | ★☆☆ | Start Challenge |
| 49 | 🎯 Efficient Merge Sort Algorithm Implementation | ★☆☆ | Start Challenge |
| 50 | 🎯 Search Sorted Matrix | ★☆☆ | Start Challenge |
| 51 | 🎯 Efficient Quick Sort Algorithm | ★☆☆ | Start Challenge |
| 52 | 🎯 Sorting with Selection Algorithm | ★☆☆ | Start Challenge |
| 53 | 🎯 Merge Sorted Arrays into One | ★☆☆ | Start Challenge |
| 54 | 🎯 Missing Integer in Array | ★☆☆ | Start Challenge |
| 55 | 🎯 Anagram Sorting Array | ★☆☆ | Start Challenge |
| 56 | 🎯 Efficient Insertion Sort Algorithm | ★☆☆ | Start Challenge |
| 57 | 🎯 Radix Sort: Efficient Integer Sorting Algorithm | ★☆☆ | Start Challenge |
| 58 | 🎯 Fibonacci Sequence Programming Tutorial | ★☆☆ | Start Challenge |
| 59 | 🎯 Max Profit K | ★☆☆ | Start Challenge |
| 60 | 🎯 Longest Inc Subseq | ★☆☆ | Start Challenge |
| 61 | 🎯 Solving the Towers of Hanoi Problem | ★☆☆ | Start Challenge |
| 62 | 🎯 Generating All Permutations of Input String | ★☆☆ | Start Challenge |
| 63 | 🎯 N Pairs Parentheses | ★☆☆ | Start Challenge |
| 64 | 🎯 Coin Change Ways | ★☆☆ | Start Challenge |
| 65 | 🎯 Longest Common Subsequence | ★☆☆ | Start Challenge |
| 66 | 🎯 Exploring Step Climbing with Python | ★☆☆ | Start Challenge |
| 67 | 🎯 Knapsack Problem Optimization Techniques | ★☆☆ | Start Challenge |
| 68 | 🎯 Coin Change Min | ★☆☆ | Start Challenge |
| 69 | 🎯 Generating Power Sets in Python | ★☆☆ | Start Challenge |
| 70 | 🎯 Unbounded Knapsack Optimization Problem | ★☆☆ | Start Challenge |
| 71 | 🎯 Longest Substr K Distinct | ★☆☆ | Start Challenge |
| 72 | 🎯 Optimizing 2x2 Matrix Multiplication | ★☆☆ | Start Challenge |
| 73 | 🎯 Identifying Magic Indexes in Arrays | ★☆☆ | Start Challenge |
| 74 | 🎯 Python Challenge: Longest Common Substring | ★☆☆ | Start Challenge |
| 75 | 🎯 Optimal Coin Change Solution | ★☆☆ | Start Challenge |
| 76 | 🎯 Robot Grid Path Planning | ★☆☆ | Start Challenge |
| 77 | 🎯 Primality Test in Python | ★☆☆ | Start Challenge |
| 78 | 🎯 Integers Manipulation Python | ★☆☆ | Start Challenge |
| 79 | 🎯 Subtracting Integers Without Arithmetic Operators | ★☆☆ | Start Challenge |
| 80 | 🎯 Efficient List Operations in Python | ★☆☆ | Start Challenge |
| 81 | 🎯 Generate Prime Numbers | ★☆☆ | Start Challenge |
| 82 | 🎯 Determine Power of Two in Python | ★☆☆ | Start Challenge |
| 83 | 🎯 Bit Manipulation Operations in Python | ★☆☆ | Start Challenge |
| 84 | 🎯 Efficient Bit Manipulation for Odd-Even Swap | ★☆☆ | Start Challenge |
| 85 | 🎯 Maximizing Longest Sequence of Ones | ★☆☆ | Start Challenge |
| 86 | 🎯 Bits To Flip | ★☆☆ | Start Challenge |
| 87 | 🎯 Insert M Into N | ★☆☆ | Start Challenge |
| 88 | 🎯 Find Next Largest Smallest Binary Numbers | ★☆☆ | Start Challenge |
| 89 | 🎯 Binary Representation of Real Numbers | ★☆☆ | Start Challenge |
| 90 | 🎯 Implementing Line Drawing Algorithm | ★☆☆ | Start Challenge |
## More
- 🔗 [Python Programming Courses](https://github.com/labex-labs/awesome-programming-courses)
- 🔗 [Python Programming Projects](https://github.com/labex-labs/awesome-programming-projects)
- 🔗 [Python Free Tutorials](https://github.com/labex-labs/python-free-tutorials)