Posts by Pranav Prakasan

Author Biographical Info: Not available

Josephus Circle using Circular Linked List in C++

By Pranav Prakasan

This article demonstrates the solution to the Josephus Circle Problem using Circular Linked List in C++. There are many methods by which the solution to this problem may be found. .... Read More

Find nth Node from End of Linked List – C++

By Pranav Prakasan

In this article, we discuss a method and a program to find the nth node from the end of a linked list in C++. We know that a singly-linked list is a data structure that is linear a.... Read More

Finding length of loop in linked list in C++

By Pranav Prakasan

This article discusses an algorithm and hence a program in C++ for finding the length of a loop in a linked list. The algorithm used is an extension to one that is used to check th.... Read More

Performing Intersection of two Sorted Linked Lists in C++

By Pranav Prakasan

This article discusses a method for performing the intersection of two sorted linked lists in C++. ‘Intersection‘ refers to finding the elements common to both the sets.... Read More

Queries on the Left and Right Circular Shift on Array in C++

By Pranav Prakasan

This article discusses the method to perform left and right-shift on C++ arrays. Thereby, answer queries on the left and right circular shift on array in C++. The motive of the pro.... Read More

Deleting a Linked List in C++

By Pranav Prakasan

This article discusses a method and a program for deleting a linked list in C++. A linked list may be entirely removed by deleting all its nodes. We may do this by traversing throu.... Read More

Trim Strings – Boost String Algorithm in C++

By Pranav Prakasan

This article provides a detailed explanation of ‘How to Trim Strings in C++ using the Boost String Algorithm’. Above all, ‘in just a single line of code’. B.... Read More

Graph Representation – Adjacency List in C++

By Pranav Prakasan

This article discusses the Implementation of Graphs using Adjacency List in C++. There are two widely used methods of representing Graphs, these are: Adjacency List Adjacency Matri.... Read More

Related Posts