GitHub - noahk0/Linked-List: Recursion, Two Pointers, Hash Table, Stack, Math, Array, Bit Manipulation, Design, Doubly-Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort

noahk0 / Linked-List Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Recursion, Two Pointers, Hash Table, Stack, Math, Array, Bit Manipulation, Design, Doubly-Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 42 Commits
Add Two Numbers O(max(n, m)).py		Add Two Numbers O(max(n, m)).py
Copy List with Random Pointer O(n).py		Copy List with Random Pointer O(n).py
Find the Duplicate Number O(n).py		Find the Duplicate Number O(n).py
LRU Cache O(1).py		LRU Cache O(1).py
Linked List Cycle O(n).py		Linked List Cycle O(n).py
Merge Two Sorted Lists O(n+m).py		Merge Two Sorted Lists O(n+m).py
Merge k Sorted Lists O(nlogk).py		Merge k Sorted Lists O(nlogk).py
Remove Nth Node From End of List O(n).py		Remove Nth Node From End of List O(n).py
Reorder List O(n).py		Reorder List O(n).py
Reverse Linked List O(n).py		Reverse Linked List O(n).py
Reverse Nodes in k-Group O(n).py		Reverse Nodes in k-Group O(n).py

About

Recursion, Two Pointers, Hash Table, Stack, Math, Array, Bit Manipulation, Design, Doubly-Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort