## Insert a node in the given sorted linked list.

Objective: Given a linked list in which nodes are sorted in ascending order. Write an algorithm to insert a given node into the linked list so that all the nodes in the list will...

Skip to content# Category: Position

## Insert a node in the given sorted linked list.

## Construct the largest number from the given array.

## Given an array, find three-element sum closest to Zero

## Given an array, print all unique subsets with a given sum.

## Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.

## Replace array elements with maximum element on the right.

## Find all unique combinations of numbers (from 1 to 9 ) with sum to N

## Unique Integers in array that sum up to zero.

## Activity Selection Problem

## Find the sum of overlapping elements in two sets

## Check if Graph is Bipartite – Adjacency List using Breadth-First Search(BFS)

## Articulation Points OR Cut Vertices in a Graph

## Check If Given Undirected Graph is a tree

## Find the number of distinct Islands OR connected components.

## Check the completeness of given binary tree | Set 2 – Using Level Order Traversal

@tutorialhorizon

Objective: Given a linked list in which nodes are sorted in ascending order. Write an algorithm to insert a given node into the linked list so that all the nodes in the list will...

Objective: Given an array of integers, write an algorithm to construct the largest number possible by appending the array elements. Example: Given Input: [7, 78] Largest Number Possible: 787 Explanation: two possibilities are 778...

Objective: Given an array of integers, find the sum of any three elements which is closest to zero. The array may contain positive and negative elements. Example: Given Input: [-1, 4, -2, 5, 10,...

Objective: Given an array of integers and number N, Write an algorithm to find and print all the subsets of the array for which sum is equal to N. Example: input [] = {6,2,7,8,2,4,1,3,7,5}...

Objective: Given an array of numbers and integer K. Your task is to find lengths of all the subsets which contain value K and all elements in the subset are less than equal to...

Objective: Given an array of integers, write a program to replace its elements with the maximum element on the right side from their respective positions. Note: If the element is equal to the maximum...

Objective: Given an integer N, Write an algorithm to select numbers from 1 to 9 and make combinations such that its sum to N. Example: N= 5 Output: [1, 4] [2, 3] [5] N...

Objective: Given an integer N, write a function to return an array containing N unique integers that sum up to zero. There are many possible arrays that sum up to 0 for any N,...

Objective: The activity selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time...

Objective: Given two sets of integers, write an algorithm to print the sum of overlapping elements in two sets. Note: Elements in each set are unique or there are no duplicates within a set....

Objective: Given a graph represented by the adjacency List, write a Breadth-First Search(BFS) algorithm to check whether the graph is bipartite or not. Earlier we have solved the same problem using Depth-First Search (DFS)....

Objective: Given a graph, write an algorithm to find all the articulation points or cut vertices. Articulation Points: In a graph, a vertex is called an articulation point if removal of that vertex (along...

Objective: Given an undirected graph, Write an algorithm to determine whether its tree or not. An undirected graph is a tree if it has properties mentioned below There is no cycle present in the...

Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of distinct or unique islands. Island: An island is surrounded by water and is formed by connecting adjacent lands...

Objective: Given a binary tree, write an algorithm to determine whether the tree is complete or not using Level order traversal. Earlier we had solved this problem by counting the number of nodes in...

%d bloggers like this: