Skip to content
This repository was archived by the owner on May 22, 2025. It is now read-only.

[Archived] Quick Start with Algorithm | This repo collects 90 of programming labs exercises 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 and are avail...

Notifications You must be signed in to change notification settings

labex-labs/quick-start-with-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

23 Commits
Β 
Β 

Repository files navigation

Quick Start with Algorithm

Quick Start with Algorithm

Start-Learning

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.

Algorithm Python

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.

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

About

[Archived] Quick Start with Algorithm | This repo collects 90 of programming labs exercises 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 and are avail...

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published