Description
Add a new Linked List Practice sheet by creating and populating the questions dataset.
Requirements :
Create a new Linked List Practice dataset.
Add each question with the following metadata:
Title
Difficulty (Easy/Medium/Hard)
LeetCode link (if available)
GeeksforGeeks link (if available)
YouTube solution link
Ensure all links are valid and point to the correct resources.
Questions :
Easy:
Reverse a Linked List
Middle of the Linked List
Linked List Cycle
Merge Two Sorted Lists
Remove Duplicates from Sorted List
Delete Node in a Linked List
Palindrome Linked List
Intersection of Two Linked Lists
Remove Linked List Elements
Convert Binary Number in a Linked List to Integer
Remove Nth Node From End of List
Reverse Linked List II
Medium :
Add Two Numbers
Odd Even Linked List
Swap Nodes in Pairs
Rotate List
Partition List
Reorder List
Sort List
Copy List with Random Pointer
Flatten a Multilevel Doubly Linked List
Linked List Cycle II
Remove Zero Sum Consecutive Nodes from Linked List
Delete the Middle Node of a Linked List
Maximum Twin Sum of a Linked List
Insertion Sort List
Design Linked List
Hard :
Merge k Sorted Lists
Reverse Nodes in k-Group
LFU Cache
LRU Cache
All O`one Data Structure
Reverse Linked List in Groups of Given Size
Clone a Linked List with Next and Random Pointer
Description
Add a new Linked List Practice sheet by creating and populating the questions dataset.
Requirements :
Create a new Linked List Practice dataset.
Add each question with the following metadata:
Title
Difficulty (Easy/Medium/Hard)
LeetCode link (if available)
GeeksforGeeks link (if available)
YouTube solution link
Ensure all links are valid and point to the correct resources.
Questions :
Easy:
Reverse a Linked List
Middle of the Linked List
Linked List Cycle
Merge Two Sorted Lists
Remove Duplicates from Sorted List
Delete Node in a Linked List
Palindrome Linked List
Intersection of Two Linked Lists
Remove Linked List Elements
Convert Binary Number in a Linked List to Integer
Remove Nth Node From End of List
Reverse Linked List II
Medium :
Add Two Numbers
Odd Even Linked List
Swap Nodes in Pairs
Rotate List
Partition List
Reorder List
Sort List
Copy List with Random Pointer
Flatten a Multilevel Doubly Linked List
Linked List Cycle II
Remove Zero Sum Consecutive Nodes from Linked List
Delete the Middle Node of a Linked List
Maximum Twin Sum of a Linked List
Insertion Sort List
Design Linked List
Hard :
Merge k Sorted Lists
Reverse Nodes in k-Group
LFU Cache
LRU Cache
All O`one Data Structure
Reverse Linked List in Groups of Given Size
Clone a Linked List with Next and Random Pointer