Back to Learning Paths

LinkedList Problems

شرح LeetCode 287 - Find the Duplicate Number

Watch on YouTube

Find the Duplicate Number Using C++ ---------------------------------------- Floyd's Cycle Detection - Tortoise and Hare - Slow and Fast Pointers Method Time Complexity : O(n) Space Complexity : O(1) ------------------------------------------ Negative Marker Algorithm Time Complexity : O(n) Space Complexity : O(1)

Previous

شرح LeetCode 138 - Copy List with Random Pointer

Next Up

شرح LeetCode 2 - Add Two Numbers

More from LinkedList Problems

شرح LeetCode 23 - Merge k Sorted Lists

شرح LeetCode 23 - Merge k Sorted Lists

Merge k Sorted Lists Using C++ Merge Using Divide And Conquer (Iteration) -----...

شرح LeetCode 146 - LRU Cache

شرح LeetCode 146 - LRU Cache

LRU Cache Design Problem Using C++ Hash Map + Doubly Linked List Time complexity...

شرح LeetCode 138 - Copy List with Random Pointer

شرح LeetCode 138 - Copy List with Random Pointer

Copy List with Random Pointer Using C++ --------------------------------- Hash T...

شرح LeetCode 2 - Add Two Numbers

شرح LeetCode 2 - Add Two Numbers

Add Two Numbers Using C++ Time Complexity : O(max(m,n)) Space Complexity : O(max...

شرح LeetCode 19 - Remove Nth Node From End of List

شرح LeetCode 19 - Remove Nth Node From End of List

Remove Nth Node From End of List Using C++ Two Pointers Technique Time Complexit...

شرح LeetCode 143 - Reorder List

شرح LeetCode 143 - Reorder List

Reorder List Using C++ I used the slow and fast pointer (tortoise and hare) appr...

شرح LeetCode 141 - Linked List Cycle

شرح LeetCode 141 - Linked List Cycle

Linked List Cycle Using C++ slow and fast pointer / Floyd's Cycle Algorithm / to...

شرح LeetCode 21 - Merge Two Sorted Lists

شرح LeetCode 21 - Merge Two Sorted Lists

Merge Two Sorted Lists Using C++ (Dummy Node Pattern) Time Complexity : O(n+m) ...

شرح LeetCode 206 - Reverse Linked List

شرح LeetCode 206 - Reverse Linked List

Reverse Linked List Using C++ iterative method. Time Complexity : O(n) Space Com...