Skip to content

Linked Lists

Jump to bottom
Arighna Chakrabarty edited this page Jul 8, 2018 · 8 revisions

Here are some important questions on Linked Lists :--

  1. Linked List Introduction, and its advantages over Arrays

  2. A Programmer’s approach of looking at Array vs. Linked List

  3. Insertion in a Linked List

  4. Deletion in a Linked List

  5. Delete node at a given position

  6. Deleting a list

  7. Print Middle of a Linked List

  8. Delete Nth node from the end of a LL

  9. Detect a loop in Linked List - Floyd's Cycle Finding Algorithm.

  10. Length of loop of the LL

  11. Detect and remove loop in Linked List

  12. Reverse a linked list - Both iterative and recursive

  13. Reverse in groups of given size

  14. Check whether LL is palindrome

  15. Find the intersection point of two LL

  16. Remove duplicates from sorted Linked Lists

  17. Remove duplicates from an unsorted LL

  18. Segregate odd and even node of an LL

  19. Merge two Sorted LLs

  20. Merge Sort for a Linked List

  21. Union and Intersection of Two Linked Lists

  22. Intersection of two sorted LLs

  23. Queue Implementation using LL

  24. Add two numbers represented by linked lists

  25. Extract leaves of a Binary Tree into a Doubly Linked List

  26. Tricky - Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it?

  27. Sort a linked list that is sorted alternating ascending and descending orders

  28. Clone a LL with next and random pointer

  29. Clone a linked list with next and random pointer - Hashing Method

  30. Clone a linked list with next and random pointer in O(1) space

  31. Pairwise swapping of Linked list nodes

  32. Rearrange a LL such that the even and odd positioned nodes are together

  33. Remove every k-th node of a LL

  34. Sort a Linked List of 0's, 1's and 2's

  35. Sort a Linked List of 0, 1, & 2 by changing links

  36. Sort linked list which is already sorted on absolute values

  37. Reorder Linked List - My LeetCode solution

  38. Sorted Insert For Linked List

  39. Merge K Sorted Linked Lists

  40. Flattening a Linked List

  41. Check if a linked list is Circular Linked List

  42. Merge two sorted LLs such that the merged list is in reverse order

  43. Partition Linked List

  44. Insertion Sort For Linked List

Clone this wiki locally