chore: added embed

Author: rupeshtiwari

README.md

@@ -724,13 +724,39 @@ Delete 15 from BST
 
 ![](https://i.imgur.com/yqOvCXx.png)
 
-- [Question](https://codepen.io/roopkt/pen/wvJRxJp?editors=0010)
-- [Answer](https://codepen.io/roopkt/pen/bGqOxyN)
+[Question](https://codepen.io/roopkt/pen/wvJRxJp?editors=0010)
 
+ <p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="wvJRxJp" style="height: 265px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="Delete node in BST Question">
+    <span>See the Pen <a href="https://codepen.io/roopkt/pen/wvJRxJp">
+    Delete node in BST Question</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
+    on <a href="https://codepen.io">CodePen</a>.</span>
+  </p>
+
+[Answer](https://codepen.io/roopkt/pen/bGqOxyN)
+
+<p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="rNyovyL" style="height: 265px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="Delete node in BST Answer">
+  <span>See the Pen <a href="https://codepen.io/roopkt/pen/rNyovyL">
+  Delete node in BST Answer</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
+  on <a href="https://codepen.io">CodePen</a>.</span>
+</p>
+<script async src="https://cpwebassets.codepen.io/assets/embed/ei.js"></script>
 #### Find the In-Order successor in a given BST?
 
-- [Question](https://codepen.io/roopkt/pen/YzZdMxa)
-- [Answer](https://codepen.io/roopkt/pen/bGqOxyN)
+[Question](https://codepen.io/roopkt/pen/YzZdMxa)
+
+<p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="YzZdMxa" style="height: 265px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="Find In-order Successor in BST Question">
+  <span>See the Pen <a href="https://codepen.io/roopkt/pen/YzZdMxa">
+  Find In-order Successor in BST Question</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
+  on <a href="https://codepen.io">CodePen</a>.</span>
+</p>
+
+[Answer](https://codepen.io/roopkt/pen/bGqOxyN)
+
+<p class="codepen" data-height="327" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="bGqOxyN" style="height: 327px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="Find In-order Successor in BST Answer">
+  <span>See the Pen <a href="https://codepen.io/roopkt/pen/bGqOxyN">
+  Find In-order Successor in BST Answer</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
+  on <a href="https://codepen.io">CodePen</a>.</span>
+</p>
 
 ### Recursion Interview Questions
 
@@ -758,20 +784,8 @@ Modular Exponentiation is the remainder dividing up on `Pow(x,n)` by `M`.
 ![Modular Exponentiation is the remainder dividing up on `Pow(x,n)` by `M`](https://i.imgur.com/Y3GkhRT.png)
 
 - [Question](https://codepen.io/roopkt/pen/GRWYVEa?editors=0010)
-<p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="YzZdMxa" style="height: 265px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="Find In-order Successor in BST Question">
-  <span>See the Pen <a href="https://codepen.io/roopkt/pen/YzZdMxa">
-  Find In-order Successor in BST Question</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
-  on <a href="https://codepen.io">CodePen</a>.</span>
-</p>
-<script async src="https://cpwebassets.codepen.io/assets/embed/ei.js"></script>
-- [Answer](https://codepen.io/roopkt/pen/gOmBVWJ?editors=0010)
 
-<p class="codepen" data-height="327" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="bGqOxyN" style="height: 327px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="Find In-order Successor in BST Answer">
-  <span>See the Pen <a href="https://codepen.io/roopkt/pen/bGqOxyN">
-  Find In-order Successor in BST Answer</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
-  on <a href="https://codepen.io">CodePen</a>.</span>
-</p>
-<script async src="https://cpwebassets.codepen.io/assets/embed/ei.js"></script>
+- [Answer](https://codepen.io/roopkt/pen/gOmBVWJ?editors=0010)
 
 ### Sorted Array Interview Coding
 
@@ -839,3 +853,5 @@ Reverse Linked List simulation:
 - http://btholt.github.io/four-semesters-of-cs/
 - https://btholt.github.io/four-semesters-of-cs-part-two/
 - [Binary Tree Visualization](https://www.cs.usfca.edu/~galles/visualization/BST.html)
+
+<script async src="https://cpwebassets.codepen.io/assets/embed/ei.js"></script>