Skip to main content

LinkedList Interview Questions


1) Print Elements of Linked List


2) Reverse LinkedList



3) Delete a given Element of a LinkedList



4) Delete kth Element from headNode of  a LinkedList



5) Delete kth Element from tailNode of  a LinkedList



6) Detect if a LinkedList contains a Cycle



7) Remove an Element from a DoublyLinkedList



8) Merge Elements of a DoublyLinkedList



9) Create a Cache such that the Elements can be added at Head and removed from Tail, in O(1)



10) Merge K Sorted Lists

K Sorted Linked Lists cab be merged using MinHeap. All the elements from all the K Linked Lists are added to the MinHeap one by one. Create a Dummy LinkedList Node and add all the nodes from the Min Heap to the LinkedList node. Return the Next Node of the dummy Node which becomes the head for the combined LinkedList.


Comments

Post a Comment

Popular posts from this blog

HashMap in Java

1) Implement HashMap in Java, with the put and get operations   HashMap can be implemented in Java Using Arrays. Use the same logic that the Out of the Box   HashMap follows, for resizing, and load factor, when ever the HashMap reaches the size of the   resize with the load factor a new Array is created, and the previous array contents are copied over   to the new Array.  HashMap is Not Synchronized by default. We can synchronize the whole map by using Synchronization, or by using collection.synchronizedmap(map), which synchronizes all the operations on the map. Alternatively We can use the CocurrentHashMap which does not lock the read operations, rather locks the segments that are being written. 2) HashMap vs LinkedHashMap vs IdentityHashMap 3) HashMap vs ConcurrentHashMap 4) Implement a Cache using LinkedHashMap
Post a Comment
Read more