## Subset Sum Problem (Part II)

Given a set of numbers,our task is to find the number of subsets that sum to a particular value. Example- Set of numbers- {1,3,2,5,4,9} Sum=9 Subsets that sum t...

Skip to content
# Tag: algorithm

## Subset Sum Problem (Part II)

## Subset Sum Problem

## Doubly Linked Lists

## All Permutations

## Path Finding

## Longest path in a tree

## Applications of DFS

## Longest Common Subsequence

## Activity Selection Problem

## Dijkstra’s Algorithm

All's the Code !

Given a set of numbers,our task is to find the number of subsets that sum to a particular value. Example- Set of numbers- {1,3,2,5,4,9} Sum=9 Subsets that sum t...

Given a set of positive integers and a value sum,the task is to find if there is a subset with sum equal to the given value. Example- Given set of numbers- {3,3...

A doubly linked list is a linked linear data structure,each node of which has one or more data fields but only two link fields known as left link (LLINK) and ri...

Given a string,the task is to print all the permutations of the string. A permutation is a rearrangement of the elements of an ordered list S.A string of length...

Given an undirected,unweighted graph and two vertices u and v,the task is to find the path between these two vertices.u can be considered as the source vertex a...

Given an unweighted and undirected tree,the task is to find the length of the longest path (from one node to another) in that tree.The length of a path in this ...

One of the applications of DFS is to find the number of connected components in a graph.In graph theory, a connected component of an undirected graph is a sub-g...

Given two sequences,the task is to find the length of longest sub-sequence present in both of them. A sub-sequence is a sequence that appears in the same relati...

Activity selection problem is an example of greedy algorithm.Greedy algorithms look for simple, easy-to-implement solutions to complex, multi-step problems by d...

Given a network of cities and the distances between them,the task is to find the shortest path from a city(source) to all other cities connected to it.The netwo...