Depth First Search and Breadth First Search Algorithm to Open the Doors to the Rooms with Keys
There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, …, N-1, and each room may have some keys …
Tag: dfs
Classic Unlimited Knapsack Problem Variant: Coin Change via Dynamic Programming and Depth First Search Algorithm
July 14, 2019
algorithms, c / c++, DFS, dynamic programming, Dynamic Programming, Knapsack Problems, math
No Comments
You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may …
Algorithms to Compute the Factor Combinations for An Integer using DFS and BFS
Numbers can be regarded as product of its factors. For example, 8 = 2 x 2 x 2; = 2 x 4. Write a function that takes an integer …
Using BackTracking Algorithm to Find the Combination Integer Sum
Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. The same …
Depth First Search Algorithm to Find Leaves of a Binary Tree
Given a binary tree, collect a tree’s nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example: Input: 1 / …