#leetcode

Leetcode Practiece

Linked List

  1. Middle of the Linked List
  2. Delete the Middle node of a Linked List
  3. Remove Nth node from End of the List
  4. Reverse a Linked List
  5. Reorder Linked List
  6. Remove Duplicates from Sorted List
  7. Merge Two Sorted Lists
  8. Merge K Sorted Lists
  9. Copy List with Random Pointer
  10. Reverse Nodes in K-Group
  11. Linked List Cycle
  12. Linked List Cycle II
  13. Design a Doubly Linked List
  14. LRU Cache
  15. Reverse a Linked List (Recursive)
  16. Design Browser History
  17. Design Browser History (Optimized)