https://vhaos-leetcode-solutions.now.sh/tags/backtracking/ Recent content in Backtracking on Vhaos's Leetcode Solutions Hugo -- gohugo.io en-us Kareem Daggash Fri, 02 Oct 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/october/2-combination-sum/ Fri, 02 Oct 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/october/2-combination-sum/ LeetCode October - Day 2 Problem Statement Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different. https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/8-path-sum-iii/ Sat, 08 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/8-path-sum-iii/ LeetCode August - Day 8 Problem Statement 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 need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes). The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000. https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/30-word-break-ii/ Thu, 30 Jul 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/30-word-break-ii/ LeetCode July - Day 30 Problem Statement Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. Note: The same word in the dictionary may be reused multiple times in the segmentation. You may assume the dictionary does not contain duplicate words. Example 1: https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/21-word-search/ Tue, 21 Jul 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/21-word-search/ LeetCode July - Day 21 Problem Statement Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once. Example: board = [ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E'] ] Given word = “ABCCED”, return true. Given word = “SEE”, return true. https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/11-subsets/ Sat, 11 Jul 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/july/11-subsets/ LeetCode July - Day 11 Problem Statement Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Example: Input: nums = [1,2,3] Output: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ] Inputs, Outputs, Constraints & Exceptions I: number[] O: number[][] C: no duplicates in result, optimise E: empty array Code /** * @param {number[]} nums * @return {number[][]} */ function subsets(nums) { if(nums.