Merge branch 'master' of https://github.com/codebasics/data-structures-algorithms-python into master

Author: codebasics

.gitignore

@@ -127,3 +127,6 @@ dmypy.json
 
 # Pyre type checker
 .pyre/
+
+# Editor settings
+.vscode/settings.json

algorithms/1_BinarySearch/binary_search_exercise.md

@@ -11,4 +11,4 @@
     ```
    This should return 5,6,7 as indices containing number 15 in the array
     
-[Solution](https://github.com/codebasics/py/blob/master/Algorithms/1_BinarySearch/binary_search_exercise_solution.py)    
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/algorithms/1_BinarySearch/binary_search_exercise_solution.py)    

algorithms/2_BubbleSort/bubble_sort_exercise.md

@@ -1,6 +1,6 @@
 ### Bubble Sort Exercise
 
-Modify [bubble_sort function](https://github.com/codebasics/py/blob/master/Algorithms/2_BubbleSort/bubble_sort.py) such that it can sort following list of transactions happening in an electronic store,
+Modify [bubble_sort function](https://github.com/codebasics/data-structures-algorithms-python/blob/master/algorithms/2_BubbleSort/bubble_sort.py) such that it can sort following list of transactions happening in an electronic store,
 ```
 elements = [
         { 'name': 'mona',   'transaction_amount': 1000, 'device': 'iphone-10'},
@@ -36,5 +36,5 @@ elements = [
     ]
 ``` 
 
-[Solution](https://github.com/codebasics/py/blob/master/Algorithms/2_BubbleSort/bubble_sort_exercise_solution.py)
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/algorithmsAlgorithms/2_BubbleSort/bubble_sort_exercise_solution.py)
 

algorithms/3_QuickSort/quick_sort_exercise.md

@@ -2,7 +2,7 @@
 Implement quick sort using lumoto partition scheme. This partition scheme is explained in the video tutorial, you need to write python code to implement it.
 Check the pseudo code here: https://en.wikipedia.org/wiki/Quicksort Check the section Lomuto partition scheme
 
- [Solution](https://github.com/codebasics/py/blob/master/Algorithms/3_QuickSort/quick_sort_exercise_soluiton_lomuto.py)
+ [Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/algorithms/3_QuickSort/quick_sort_exercise_soluiton_lomuto.py)
 
 
 

algorithms/8_DepthFirstSearch/dfs.py

@@ -0,0 +1,30 @@
+# function for depth first search
+def dfs(data, start, visited=set()):
+
+    # if not visited print it
+    if start not in visited:
+        print(start, end=" ")
+
+    visited.add(start)
+
+    for i in data[start] - visited:
+
+        # if not visited gi in depth of it
+        dfs(data, i, visited)
+    return
+
+
+# sample data in dictionary form
+data = {
+        'A': {'B'},
+        'B': {'A', 'C', 'D'},
+        'C': {'B', 'E'},
+        'D': {'B', 'E'},
+        'E': {'C', 'D', 'F'},
+        'F': {'E'}
+        }
+
+
+if __name__ == '__main__':
+
+    dfs(data, 'A')

algorithms/8_DepthFirstSearch/dfs_exercise.py

@@ -0,0 +1,29 @@
+# function for depth first search
+def find_employees(data, start, employee, visited=set()):
+    # if not visited print it
+    if start not in visited:
+        print(start, end=" ")
+        if start == employee:
+            print(":", end=" ")
+    visited.add(start)
+
+    for i in data[start] - visited:
+        # if not visited go in depth of it
+        find_employees(data, i, visited)
+    return
+
+
+# sample data in dictionary form
+data = {
+    "karan": {"darshan", "nikhil"},
+    "darshan": {"khantil", "tanuj"},
+    "tanuj": {"nikhil"},
+    "krinish": {"hetul"},
+    "khantil": set(),
+    "nikhil": set()
+}
+
+
+if __name__ == '__main__':
+
+    find_employees(data, "karan", "karan")

algorithms/8_DepthFirstSearch/dfs_exerscise.md

@@ -0,0 +1,36 @@
+# DFS Exercise
+
+![Overview : Employee hierarchy](https://github.com/beladiyadarshan/DFS/blob/main/emp.png?raw=true)
+
+Given a graph containing managers and their employees as a dictionary of sets, print all employees reporting to a given manager.
+
+```
+data = {
+        "karan": {"darshan","nikhil"},
+        "darshan": {"khantil", "tanuj"},
+        "tanuj": {"nikhil"},
+        "krinish": {"hetul"},
+        "khantil" : set(),
+        "nikhil" : set()
+ }
+        
+    
+ ```
+ 
+ Example: Darshan and Nikhil are reporting to Karan. Khantil and Tanuj are reporting to Darshan.
+ 
+ ```
+ Q. Find all employees who are reporting to Karan.
+ ```
+
+**Explanation:**
+
+-So here, we want to find all the children nodes of Karan.
+
+-We will perform DFS starting on Karan and then traverse all the children of Karan which are unvisited. 
+
+**Output:**
+
+karan : nikhil darshan tanuj khantil 
+
+[Solution](https://github.com/beladiyadarshan/DFS/blob/main/dfs_exercise.py)