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 …
Category: BFS
Classic Knapsack Problem Variant: Coin Change via Dynamic Programming and Breadth First Search Algorithm
May 27, 2019
algorithms, BFS, c / c++, Dynamic Programming, dynamic programming, Knapsack Problems, math
No Comments
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make …
Algorithms to Check if a Graph is a Valid Tree by Using Disjoint Set (Union Find) and Breadth First Search
According to the definition of tree on Wikipedia: “a tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any …
Breadth First Search Algorithm to Check Completeness of a Binary Tree?
Given a binary tree, determine if it is a complete binary tree. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly …
How to Find Largest Value in Each Tree Row/Level using BFS or DFS Algorithm?
You need to find the largest value in each row of a binary tree. Example: Input: 1 / \ 3 2 / \ \ 5 3 9 Output: This …