LeetCode 147 | Insertion Sort List | Python Solution Explained | AlgoYogi

Welcome to **AlgoYogi**! In this video, we solve **LeetCode problem 147: Insertion Sort List** step-by-step using Python. This problem teaches you how to implement the **insertion sort algorithm** specifically on a **singly linked list**, helping you master **pointer manipulation**, **sorted sublist maintenance**, and efficient **node insertion**. 👉 **LeetCode Problem Link:** [Insertion Sort List - LeetCode 147](https://leetcode.com/problems/insertion-sort-list/) --- ### 🚀 Timestamps 0:00 Introduction 0:20 Problem Explanation and Constraints 0:50 Insertion Sort Logic on Linked List 8:30 Python Implementation 15:20 Time and Space Complexity --- ### 💡 Why Watch? - Understand how **insertion sort works** when applied to a linked list - Learn to **insert nodes into a growing sorted part** while maintaining pointers correctly - Practice building sorting algorithms on **non-array structures like linked lists** --- ### 📢 Next Steps - Solve this problem on LeetCode and test your version - Explore related problems like: - **Sort List (Merge Sort)** - **Reverse Linked List** - **Partition List** - Comment below if you want to see other sorting algorithms applied to linked lists! 👍 Like, 💬 Comment, and 🔔 Subscribe to **AlgoYogi** for structured Python tutorials and LeetCode prep. #LeetCode #PythonSolutions #InsertionSort #LinkedList #AlgoYogi #CodingInterview