From 678aaaf4e49eaf235bcb5cb9ff327258ce2a9648 Mon Sep 17 00:00:00 2001
From: Michele Ceccacci <75946413+michelececcacci@users.noreply.github.com>
Date: Mon, 14 Mar 2022 11:10:15 +0100
Subject: [PATCH] Backtracking blueprint

---
 README.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index b9be326..20a488e 100644
--- a/README.md
+++ b/README.md
@@ -968,7 +968,8 @@ Graphs can be used to represent many problems in computer science, so this secti
     - How is tail recursion better than not?
         - [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
         - [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
-
+	
+	[Backtracking Blueprint](https://leetcode.com/problems/combination-sum/discuss/16502/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partitioning))
 - ### Dynamic Programming
     - You probably won't see any dynamic programming problems in your interview, but it's worth being able to recognize a 
     problem as being a candidate for dynamic programming.