The Subsequence Algorithm for Two Strings – How to Check if a String is Subsequence of Another?
Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s …
Category: recursive
How to Generate Parentheses using Bruteforce or Depth First Search (Backtracking) Algorithms?
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: We can use the …
Algorithm to Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. You may assume that duplicates do not exist in the tree. For example, given preorder = inorder …
The 24 Game Algorithm using Depth First Search
You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get …
How to Count the Path Sum from a Binary Tree using Depth First Search Algorithm?
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not …