## Shortest path in a complement graph

Given an undirected non-weighted graph G. For a given node start return the shortest path that is the number of edges from start to all… Read More »

- Sum of all Palindrome Numbers present in a Linked list
- Program to print all the non-reachable nodes | Using BFS
- Least Common Ancestor of any number of nodes in Binary Tree
- Minimum Spanning Tree using Priority Queue and Array List
- Minimum cost to merge numbers from 1 to N
- Encryption and Decryption of String according to given technique
- Program to delete all even nodes from a Singly Linked List
- Program to create Custom Vector Class in C++
- Sideways traversal of a Complete Binary Tree
- Binary Search Tree | Set 3 (Iterative Delete)
- Find all Factors of Large Perfect Square Natural Number in O(sqrt(sqrt(N))
- Maximum of XOR of first and second maximum of all subarrays
- Sum of all perfect numbers present in an Linked list
- C program to implement Adjacency Matrix of a given Graph
- Count of strings possible by replacing two consecutive same character with new character
- Append the last M nodes to the beginning of the given linked list
- Print the nodes having exactly one child in a Binary tree
- Check if alternate path exists from U to V with smaller individual weight in a given Graph

Given an undirected non-weighted graph G. For a given node start return the shortest path that is the number of edges from start to all… Read More »

Given an array A[] of N integers, the task is to generate an array B[] such that B[i] contains the count of indices j in… Read More »

Given an array arr[] of N integers, the task is to count number of triplets (i, j, k) in the array such that a[k] <… Read More »

Given a Linkedlist and two indices A and B, the task is to print a sublist starting from A and ending at B. Examples: Input:… Read More »

Python List Python programming language has four collection data types namely List, Tuple, Set, and Dictionary. A list is a mutable and ordered collection i.e.,… Read More »

Given a binary search tree and a node of the binary search tree, the task is to delete the node from the Binary Search tree… Read More »

Given a undirected Graph of N vertices 1 to N and M edges in form of 2D array arr[][] whose every row consists of two… Read More »

Given a linked list with integer node values, the task is to find the sum of all Palindrome Numbers present as Node values. Examples: Input:… Read More »

Given an Linked list containing N positive integer, the task is to find the sum of all the perfect numbers from the list. A number… Read More »

Given a singly linked list containing N nodes, the task is to delete all the even nodes from the list. Examples: Input: LL = 1… Read More »

Given a binary tree, the task is to print all the nodes having exactly one child. Print “-1” if no such node exists. Examples: Input:… Read More »

Given an integer N, the task is to find the minimum cost to merge all the numbers from 1 to N where the cost of… Read More »

Given an undirected graph and a set of vertices, we have to print all the non-reachable nodes from the given head node using a breadth-first… Read More »

Given an array arr[] of distinct elements, the task is to find the maximum of XOR value of the first and second maximum elements of… Read More »

Given a perfect square natural number N. The task is to find all the factors of N. Examples Input: N = 100 Output: 1 2… Read More »