From def475f1bca33d11bac383a72ed577b38cd77c6d Mon Sep 17 00:00:00 2001
From: Michele Ceccacci <75946413+michelececcacci@users.noreply.github.com>
Date: Thu, 27 Jan 2022 10:36:17 +0100
Subject: [PATCH] added leetcode blueprint

---
 README.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/README.md b/README.md
index 2c9198b..d7a1b5b 100644
--- a/README.md
+++ b/README.md
@@ -714,6 +714,7 @@ if you can identify the runtime complexity of different algorithms. It's a super
     - [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
     - [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
     - [ ] [detail](https://www.topcoder.com/community/competitive-programming/tutorials/binary-search/)
+    - [ ] [blueprint](https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems)
     - [ ] Implement:
         - binary search (on sorted array of integers)
         - binary search using recursion