In this tutorial, we are going to learn how to delete all prime nodes from a singly linked list.Let's see the steps to solve the problem.Write struct with data and next pointer.Write a function to insert the node into the singly linked list.Initialize the singly linked list with dummy data.Iterate ... Read More

In this tutorial, we are going to learn how to delete a node without head pointer in a singly linked list.Let's see the steps to solve the problem.Write struct with data, and next pointer.Write a function to insert the node into the singly linked list.Initialize the singly linked list with ... Read More

In this tutorial, we are going to learn how to delete a node in singly linked list with the given position.Let's see the steps to solve the problem.Write struct with data, and next pointer.Write a function to insert the node into the singly linked list.Initialize the singly linked list with ... Read More

In this tutorial, we are going to learn how to delete a node in doubly linked list with the given position.Let's see the steps to solve the problem.Write struct with data, prev and next pointers.Write a function to insert the node into the doubly linked list.Initialize the doubly linked list ... Read More

In this tutorial, we are going to find the deepest left leaf node in the binary tree. Let's see the binary tree.   A       B    C D       E       F                      GLet's see ... Read More

In this tutorial, we are going to learn about the fixed partitioning in the operating system.Fixed partitioning is one to manage the memory in operating system. It's an old technique. It divides the memory into equal blocks. The size of each block is predefined and can not be changed.The memory ... Read More

In this tutorial, we are going to learn how find the first uppercase letter in the given string. Let's see an example.Input −TutorialspointOutput −TLet's see the steps to solve the problem using iterative method.Initialize the string.Iterate over the string.Check whether the current character is uppercase or not using isupper method.If ... Read More

In this tutorial, we are going to find a triangular number whose number of divisors are greater than n.If the sum of natural numbers at any point less than or equal to n is equal to the given number, then the given number is a triangular number.We have seen what ... Read More

In this tutorial, we are going to learn how to find the first non-repeating character in the given string. Let's see an example.Input −tutorialspointOutput −uLet's see the steps to solve the problem.Initialize the string.Initialize a map char and array to store the frequency of the characters in the string.Iterate over ... Read More

In this tutorial, we have to find whether the natural numbers from 1 to n is divided into two halves or not. It has to satisfy the following conditions.The absolute difference between the two series sum should be m.And the GCD of two sums should be 1 i.e.., co-primes.The sum ... Read More