chore: adding 1 question

Author: rupeshtiwari

README.md

@@ -60,6 +60,7 @@
   - [ADT](#adt)
   - [Time Memory Trade-Off technique](#time-memory-trade-off-technique)
 - [Coding Interview Question and Answers](#coding-interview-question-and-answers)
+  - [Graphs](#graphs)
   - [Trees and Graphs](#trees-and-graphs)
     - [Route Between Nodes: Given a directed graph, design an algorithm to find out whether there is a route between two nodes.](#route-between-nodes-given-a-directed-graph-design-an-algorithm-to-find-out-whether-there-is-a-route-between-two-nodes)
     - [Minimal Tree: Given a sorted increasing order array with unique integer elements, write an algorithm to create a binary search tree with minimal height](#minimal-tree-given-a-sorted-increasing-order-array-with-unique-integer-elements-write-an-algorithm-to-create-a-binary-search-tree-with-minimal-height)
@@ -657,6 +658,22 @@ Trade off or invest some memory to improve run time complexity. Suppose use Has-
 
 ## Coding Interview Question and Answers
 
+### Graphs
+
+
+<p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="MWpxezz" 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="Graph: DFS Question (easy)">
+  <span>See the Pen <a href="https://codepen.io/roopkt/pen/MWpxezz">
+  Graph: DFS Question (easy)</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
+  on <a href="https://codepen.io">CodePen</a>.</span>
+</p>
+
+
+<p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="NWpJrjg" 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="Graph: DFS Answer (easy)">
+  <span>See the Pen <a href="https://codepen.io/roopkt/pen/NWpJrjg">
+  Graph: DFS Answer (easy)</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>)
+  on <a href="https://codepen.io">CodePen</a>.</span>
+</p>
+
 ### Trees and Graphs
 
 #### Route Between Nodes: Given a directed graph, design an algorithm to find out whether there is a route between two nodes.

another.md

@@ -0,0 +1,7 @@
+---
+layout: default
+---
+
+## Graph 
+Difficulty: Easy
+Depth-first Search