Skip to main content

Linkedlist :Questions




Linked List Data Structure

Topic :
Singly Linked List :
  1. Introduction to Linked List
  2. Linked List vs Array
  3. Linked List Insertion
  4. Linked List Deletion (Deleting a given key)
  5. Linked List Deletion (Deleting a key at given position)
  6. Find Length of a Linked List (Iterative and Recursive)
  7. Search an element in a Linked List (Iterative and Recursive)
  8. Swap nodes in a linked list without swapping data
  9. Write a function to get Nth node in a Linked List
  10. Print the middle of a given linked list
  11. Nth node from the end of a Linked List
  12. Write a function to delete a Linked List
  13. Write a function that counts the number of times a given int occurs in a Linked List
  14. Reverse a linked list
  15. Detect loop in a linked list
  16. Merge two sorted linked lists
  17. Generic Linked List in C
  18. Function to check if a singly linked list is palindrome
  19. Intersection point of two Linked Lists.
  20. Recursive function to print reverse of a Linked List
  21. Remove duplicates from a sorted linked list
  22. Remove duplicates from an unsorted linked list
  23. Pairwise swap elements of a given linked list
  24. Move last element to front of a given Linked List
  25. Intersection of two Sorted Linked Lists
  26. Delete alternate nodes of a Linked List
  27. Alternating split of a given Singly Linked List
  28. Identical Linked Lists
  29. Merge Sort for Linked Lists
  30. Reverse a Linked List in groups of given size
  31. Reverse alternate K nodes in a Singly Linked List
  32. Delete nodes which have a greater value on right side
  33. Segregate even and odd nodes in a Linked List
  34. Detect and Remove Loop in a Linked List
  35. Add two numbers represented by linked lists | Set 1
  36. Delete a given node in Linked List under given constraints
  37. Union and Intersection of two Linked Lists
  38. Find a triplet from three linked lists with sum equal to a given number
  39. Rotate a Linked List
  40. Flattening a Linked List
  41. Add two numbers represented by linked lists | Set 2
  42. Sort a linked list of 0s, 1s and 2s
  43. Flatten a multilevel linked list
  44. Delete N nodes after M nodes of a linked list
  45. QuickSort on Singly Linked List
  46. Merge a linked list into another linked list at alternate positions
  47. Pairwise swap elements of a given linked list by changing links
  48. Given a linked list of line segments, remove middle points
  49. Clone a linked list with next and random pointer | Set 1
  50. Clone a linked list with next and random pointer | Set 2
  51. Insertion Sort for Singly Linked List
  52. Point to next higher value node in a linked list with an arbitrary pointer
  53. Rearrange a given linked list in-place.
  54. Sort a linked list that is sorted alternating ascending and descending orders.
  55. Select a Random Node from a Singly Linked List
  56. Merge two sorted linked lists such that merged list is in reverse order
  57. Compare two strings represented as linked lists
  58. Rearrange a linked list such that all even and odd positioned nodes are together
  59. Rearrange a Linked List in Zig-Zag fashion
  60. Add 1 to a number represented as linked list
  61. Point arbit pointer to greatest value right side node in a linked list
  62. Merge two sorted linked lists such that merged list is in reverse order
  63. Check if a linked list of strings forms a palindrome
  64. Sort linked list which is already sorted on absolute values
  65. Delete last occurrence of an item from linked list
  66. Delete a Linked List node at a given position
  67. Linked List in java
  68. In-place Merge two linked lists without changing links of first list
  69. Delete middle of linked list
  70. Merge K sorted linked lists | Set 1
  71. Decimal Equivalent of Binary Linked List
  72. Flatten a multi-level linked list | Set 2 (Depth wise)
  73. Rearrange a given list such that it consists of alternating minimum maximum elements
  74. Subtract Two Numbers represented as Linked Lists
  75. Find pair for given sum in a sorted singly linked without extra space
  76. Iteratively Reverse a linked list using only 2 pointers (An Interesting Method)
  77. Partitioning a linked list around a given value and keeping the original order
  78. Check linked list with a loop is palindrome or not
  79. Clone a linked list with next and random pointer in O(1) space
  80. Length of longest palindrome list in a linked list using O(1) extra space
  81. Adding two polynomials using Linked List
  82. Implementing Iterator pattern of a single Linked List
  83. Move all occurrences of an element to end in a linked list
  84. Remove all occurrences of duplicates from a sorted Linked List
  85. Remove every k-th node of the linked list
  86. Check whether the length of given linked list is Even or Odd
  87. Union and Intersection of two linked lists | Set-2 (Using Merge Sort)
  88. Multiply two numbers represented by Linked Lists
  89. Union and Intersection of two linked lists | Set-3 (Hashing)
  90. Find the sum of last n nodes of the given Linked List
  91. Count pairs from two linked lists whose sum is equal to a given value
  92. Merge k sorted linked lists | Set 2 (Using Min Heap)
  93. Recursive selection sort for singly linked list | Swapping node links
  94. Find length of loop in linked list
  95. Reverse a Linked List in groups of given size | Set 2
  96. Insert node into the middle of the linked list
  97. Merge two sorted lists (in-place)
  98. Sort a linked list of 0s, 1s and 2s by changing links
  99. Insert a node after the n-th node from the end
  100. Rotate Linked List block wise
  101. Count rotations in sorted and rotated linked list
  102. Make middle node head in a linked list
Circular Linked List:
  1. Circular Linked List Introduction and Applications,
  2. Circular Linked List Traversal
  3. Split a Circular Linked List into two halves
  4. Sorted insert for circular linked list
  5. Check if a linked list is Circular Linked List
  6. Convert a Binary Tree to a Circular Doubly Link List
  7. Circular Singly Linked List | Insertion
  8. Deletion from a Circular Linked List
  9. Circular Queue | Set 2 (Circular Linked List Implementation)
  10. Count nodes in Circular linked list
  11. Josephus Circle using circular linked list
  12. Convert singly linked list into circular linked list
Doubly Linked List:
  1. Doubly Linked List Introduction and Insertion
  2. Delete a node in a Doubly Linked List
  3. Reverse a Doubly Linked List
  4. The Great Tree-List Recursion Problem.
  5. Copy a linked list with next and arbit pointer
  6. QuickSort on Doubly Linked List
  7. Swap Kth node from beginning with Kth node from end in a Linked List
  8. Merge Sort for Doubly Linked List
  9. Create a Doubly Linked List from a Ternary Tree
  10. Find pairs with given sum in doubly linked list
  11. Insert value in sorted way in a sorted doubly linked list
  12. Delete a Doubly Linked List node at a given position
  13. Count triplets in a sorted doubly linked list whose sum is equal to a given value x
  14. Remove duplicates from a sorted doubly linked list
  15. Delete all occurrences of a given key in a doubly linked list
  16. Remove duplicates from an unsorted doubly linked list
  17. Sort the biotonic doubly linked list
  18. Sort a k sorted doubly linked list
  19. Convert a given Binary Tree to Doubly Linked List | Set
Misc :
  1. Skip List | Set 1 (Introduction)
  2. Skip List | Set 2 (Insertion)
  3. Skip List | Set 3 (Searching and Deletion)
  4. Reverse a stack without using extra space in O(n)
  5. An interesting method to print reverse of a linked list
  6. Linked List representation of Disjoint Set Data Structures
  7. Sublist Search (Search a linked list in another list)
  8. Doubly Circular Linked List | Set 1 (Introduction and Insertion)
  9. Doubly Circular Linked List | Set 2 (Deletion)
  10. How to insert elements in C++ STL List ?
  11. Unrolled Linked List | Set 1 (Introduction)
  12. A Programmer’s approach of looking at Array vs. Linked List
  13. How to write C functions that modify head pointer of a Linked List?
  14. Given a linked list which is sorted, how will you insert in sorted way
  15. Can we reverse a linked list in less than O(n)?
  16. Practice questions for Linked List and Recursion
  17. Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
  18. Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
  19. Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?
  20. Squareroot(n)-th node in a Linked List
  21. Find the fractional (or n/k – th) node in linked list
  22. Find modular node in a linked list
  23. Construct a linked list from 2D matrix
  24. Find smallest and largest elements in singly linked list
  25. Arrange consonants and vowels nodes in a linked list
  26. Partitioning a linked list around a given value and If we don’t care about making the elements of the list “stable”
  27. Modify contents of Linked List
Quick Links :
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

Comments

Popular posts from this blog

Microservices Design patterns

What are microservices? Microservices - also known as the microservice architecture - is an architectural style that structures an application as a collection of services that are Highly maintainable and testable Loosely coupled Independently deployable Organized around business capabilities Owned by a small team The microservice architecture enables the rapid, frequent and reliable delivery of large, complex applications. It also enables an organization to evolve its technology stack. You are developing a server-side enterprise application. It must support a variety of different clients including desktop browsers, mobile browsers and native mobile applications. The application might also expose an API for 3rd parties to consume. It might also integrate with other applications via either web services or a message broker. The application handles requests (HTTP requests and messages) by executing business logic; accessing a database; exchanging messages with other systems; and returni...

GraphQL

What is GraphQL  API Standard invented & open-sourced by Facebook Alternative to  REST API  enables declarative data fetching  exposes single endpoint & responds to queries How it works?  Why Graphql? Improvises performance by reducing the data that is to be transferred over the internet Variety of different frontend frameworks and platforms on client-side Fast development speed & expectation for rapid feature development Why Graphql is better than REST? Flexibility & efficient  No more over /under fetching of data Over fetching : Under fetching: Insightful analytics  Schema serves as contract between client and server CORE CONCEPTS : SDL :SCHEMA DEFINITION LANGUAGE Writing Data with mutations 3 kinds of mutations creating new data updating existing data deleting existing data

Jackson

<dependency> <groupId>com.fasterxml.jackson.core</groupId> <artifactId> jackson-core </artifactId> <version>2.9.6</version> </dependency> <dependency> <groupId>com.fasterxml.jackson.core</groupId> <artifactId> jackson-annotations </artifactId> <version>2.9.6</version> </dependency> <dependency> <groupId>com.fasterxml.jackson.core</groupId> <artifactId> jackson-databind </artifactId> <version>2.9.6</version> </dependency> CBOR encoded data with Jackson <dependency> <groupId>com.fasterxml.jackson.dataformat</groupId> <artifactId>jackson-dataformat-cbor</artifactId> <version>2.9.6</version> </dependency> In order to read and write MessagePack encoded data <dependency> <groupId>org.msgpack</groupId> <artifactId>jackson-dataformat-msgp...