Author - Wikitechy Author6

Java Algorithm – Delete alternate nodes of a Linked List

Java Algorithm - Delete alternate nodes of a Linked List - Linked List - Given a Singly Linked List, starting from the second node delete all alternate

Cpp Algorithm – Delete alternate nodes of a Linked List

Cpp Algorithm - Delete alternate nodes of a Linked List - Linked List - Given a Singly Linked List, starting from the second node delete all alternate

C Algorithm – Delete alternate nodes of a Linked List

C Algorithm - Delete alternate nodes of a Linked List - Linked List - Given a Singly Linked List, starting from the second node delete all alternate

Graph Cycle

Detect Cycle in a directed graph using colors

Detect Cycle in a directed graph using colors-Graph cycle-Depth First Traversal can be used to detect cycle in a Graph. DFS for a connected graph.

Intersection of two Sorted Linked Lists

Intersection of two Sorted Linked Lists - Linked List - Given two lists sorted in increasing order, create and return a new list representing

C Algorithm – Move last element to front of a given Linked List

C Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last element to front in a given Singly

C Algorithm – Move last element to front of a given Linked List

C Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last element to front in a given Singly

Java Algorithm – Move last element to front of a given Linked List

Python Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last element to front in a given Singly

Cpp Algorithm – Move last element to front of a given Linked List

Cpp Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last element to front in a given Singly

Graph Cycle:

Java Algorithm-Detect cycle in an undirected graph

Detect cycle in an undirected graph-Graph cycle-The time complexity of the union-find algorithm is O(ELogV). Like directed graphs.