Create/ implement stack using single linked list in java (generics /example)
Create stack in java using linked list. We will implement stack using java generics. We will create a stack class, […]
LinkedList
Add, remove, retain, sort methods of linkedlist collection (java / example)
Given an LinkedList, we will demonstrate remove Add, Retain, Sort Iterate, Get, Contains & Clear methods of linkedlist using example.
Sort elements of linkedlist in java (ascending & descending order)
The LinkedList class extends AbstractSequentialList and implements the List interface. Given an LinkedList, we would like to sort elements of
Iterate or loop LinkedList collection of String objects in java (with example)
Linked list in java is a doubly-linked list. Insertion order is maintained in a linked list. LinkedList extends AbstractSequentialList class &
Retain & remove elements/ nodes of linkedlist collection (Java/ example)
Given a LinkedList collection in java, we would like retain certain elements or nodes of linkedlist. We would like to
Remove or delete nodes/String objects from LinkedList collection (java/ example)
Linked list in java is a doubly-linked list. Insertion order is maintained in a linked list. LinkedList extends AbstractSequentialList class &
Add or insert elements/nodes to linkedlist in java (example)
What is LinkedList Collection in Java? Linked list collection is a doubly-linked list. LinkedList extends AbstractSequentialList class & implements List, Deque,
Remove duplicate nodes from sorted singly linked list in java(example/ algorithm)
Given the sorted linked list, we need to remove duplicates from the linked list. There should not be any duplicate nodes in the linked linked list. Suppose we are given the linked list as shown in Fig 1, there are some duplicate elements in the sorted linked list.
Insert element/node to sorted singly linked list in java (example/ algorithm)
Given the sorted linked list, we need to insert the element or node in the linked list such that linked list remains sorted. Suppose the sorted linked list as shown in Fig 1, We need to find the proper place before we need to insert the new element in the linked list, so that sorted order remains intact.
Merge two sorted singly linked lists in java (example / recursive)
Given the two sorted linked lists, we need to merge these linked lists into single linked list. The resultant linked list should also in sorted one. Let us take a look into the examples to clear our problem statement.
Delete /remove all nodes of a single linked list in java (example/non-recursive)
Given a single linked list, we will delete all nodes of single linked list i.e. We want to delete the
Find number of times given element exists in single linked list (java/ example)
Given a single linked list, count number of times given element exist in a single linked list. e.g. if we want
Reverse singly linked List in pairs in java (example / non-recursive)
Given the linked list, we need to reverse a linked list in pairs. We need to reverse the nodes in pair. We need to swap the references of alternate nodes, as a result we will get reversed linked list in pairs.
Floyd’s cycle detection algorithm to check loop in single linked list
Given the linked list, we need to find out whether the loop exist in the linked list. We need to find if there is any cycle in the linked list. Let us take an example to elaborate the problem statement. We have shown the linked list in Fig 1.
Find Intersection / join point of two single linked lists in java (example)
Given the two linked list, they are intersected at some node. We need to find out the intersection point of these two linked list. We have shown two linked list Linked list 1 and linked list 2, both linked lists are intersected at node 50. We need to find out the node 50 as per our problem statement.
Find nth node from end / last node in a single linked list in java (example)
Given the linked list, we need to find the nth node from the end of linked list. The n can be any arbitrary number within the range of number of nodes in linked list. Let us understand our problem statement. Let us take a look into the linked list as shown in Fig 1.
Find midpoint / middle node of single linked list in java (example)
Given the linked list we need to find the centre or middle node. Let us take an example to understand our problem statement.
Print single linked list in a reverse order (java / example / recursive)
Given the lined list, we need to print the linked list in reverse order i.e. we need to start printing the linked list from last to first node. Let us take an example to understand the problem statement.
Reverse single linked list in java using non recursive algorithm (examples)
Given the linked list, we need to reverse the linked list. The linked list is shown in Fig 1, the head is location at node 1. Each node in a list have reference to next node in the list. The node 1 will have reference to node 2 and node 2 will have reference to node 3 and so on. The linked list is null terminated or marker for end of linked list.