How to Find the Vertical Order Traversal of a Binary Tree using DFS Algorithm?
Given a binary tree, return the vertical order traversal of its nodes values. For each node at position (X, Y), its left and right children respectively will be at …
Category: algorithms
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 …
Algorithms to Find Maximum Size Subarray (Contiguous) Sum That Equals k
Given an array nums and a target value k, find the maximum length of a Contiguous subarray that sums to k. If there isn’t one, return 0 instead. The …
How to Reverse Words in a String in Place using C++ std::reverse?
Given an input string , reverse the string word by word. Example: Input: Output: A word is defined as a sequence of non-space characters. The input string does not …
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 …