ByteLearn.dev bytelearn.dev Courses Blog
DSA Concepts in Python
01. How to Think About Complexity 12min02. Lists Strings and Arrays 14min03. Two Pointers and Sliding Window 14min04. Hash Maps and Sets 12min05. Stacks and Queues 14min06. Linked Lists 12min07. Recursion 12min08. Sorting Algorithms 12min09. Binary Search 12min10. Trees and BSTs 15min11. Heaps and Priority Queues 14min12. Tries 12min13. Backtracking 12min14. Graphs 15min15. Shortest Path and MST 12min16. Dynamic Programming 18min17. Greedy and Bit Manipulation 12minGlossary 5min 🏆 Final Quiz

Pass a lesson quiz to unlock feedback

GitHub or Google sign in to save progress across devices.

← DSA Concepts in Python

Full Examples

Complete examples for each lesson.

02. Lists Strings and Arrays

  • 📄 Move Zeroes
  • 📄 Rotate Array
  • 📄 Longest Substring Without Repeating Characters
  • 📄 Prefix Sum
  • 📄 Subarray Sum Equals K
  • 📄 Top K Frequent Elements

03. Two Pointers and Sliding Window

  • 📄 3Sum
  • 📄 Kadane's Algorithm
  • 📄 Minimum Size Subarray Sum

04. Hash Maps and Sets

  • 📄 Group Anagrams
  • 📄 Longest Consecutive Sequence
  • 📄 Isomorphic Strings

05. Stacks and Queues

  • 📄 Valid Parentheses
  • 📄 Daily Temperatures
  • 📄 Sliding Window Maximum

06. Linked Lists

  • 📄 Reverse Linked List
  • 📄 Merge Two Sorted Lists

07. Recursion

  • 📄 Maximum Depth of Binary Tree

08. Sorting Algorithms

  • 📄 Merge Intervals
  • 📄 Kth Largest Element
  • 📄 Sort Colors

09. Binary Search

  • 📄 Koko Eating Bananas

10. Trees and BSTs

  • 📄 Binary Tree Level Order Traversal
  • 📄 Lowest Common Ancestor

13. Backtracking

  • 📄 Subsets
  • 📄 Permutations
  • 📄 N-Queens

14. Graphs

  • 📄 Number of Islands
  • 📄 Clone Graph
  • 📄 Course Schedule
  • 📄 Word Ladder

16. Dynamic Programming

  • 📄 Coin Change
  • 📄 Longest Increasing Subsequence
  • 📄 Unique Paths
  • 📄 Edit Distance

17. Greedy and Bit Manipulation

  • 📄 Jump Game
  • 📄 Single Number XOR
© 2026 ByteLearn.dev. Free courses for developers. · Privacy · Terms · About
☕