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 …
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 …
The Fisher–Yates Random Shuffle Algorithm
Given an array, we want to shuffle it (to make it random), so that every possible random solution gets evenly-distributely possibility. One may quickly write a solution like this, …
How to Run a Specified Set of Javascript (NodeJS) Unit Tests using Mocha?
Suppose you have written a few Javascript (NodeJS) unit tests using Mocha and Chai. You can run a specified set of unit tests by using mocha command. The first …
Algorithm to Find the Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: begin to intersect at node …