moved to new repo

Author: Karandeep Grover

10_Graph/graph.py

@@ -0,0 +1,84 @@
+class Graph:
+    def __init__(self, edges):
+        self.edges = edges
+        self.graph_dict = {}
+        for start, end in edges:
+            if start in self.graph_dict:
+                self.graph_dict[start].append(end)
+            else:
+                self.graph_dict[start] = [end]
+        print("Graph Dict:", self.graph_dict)
+
+    def get_paths(self, start, end, path=[]):
+        path = path + [start]
+
+        if start == end:
+            return [path]
+
+        if start not in self.graph_dict:
+            return []
+
+        paths = []
+        for node in self.graph_dict[start]:
+            if node not in path:
+                new_paths = self.get_paths(node, end, path)
+                for p in new_paths:
+                    paths.append(p)
+
+        return paths
+
+    def get_shortest_path(self, start, end, path=[]):
+        path = path + [start]
+
+        if start == end:
+            return path
+
+        if start not in self.graph_dict:
+            return None
+
+        shortest_path = None
+        for node in self.graph_dict[start]:
+            if node not in path:
+                sp = self.get_shortest_path(node, end, path)
+                if sp:
+                    if shortest_path is None or len(sp) < len(shortest_path):
+                        shortest_path = sp
+
+        return shortest_path
+
+if __name__ == '__main__':
+
+    routes = [
+        ("Mumbai","Pune"),
+        ("Mumbai", "Surat"),
+        ("Surat", "Bangaluru"),
+        ("Pune","Hyderabad"),
+        ("Pune","Mysuru"),
+        ("Hyderabad","Bangaluru"),
+        ("Hyderabad", "Chennai"),
+        ("Mysuru", "Bangaluru"),
+        ("Chennai", "Bangaluru")
+    ]
+
+    routes = [
+        ("Mumbai", "Paris"),
+        ("Mumbai", "Dubai"),
+        ("Paris", "Dubai"),
+        ("Paris", "New York"),
+        ("Dubai", "New York"),
+        ("New York", "Toronto"),
+    ]
+
+    route_graph = Graph(routes)
+
+    start = "Mumbai"
+    end = "New York"
+
+    print(f"All paths between: {start} and {end}: ",route_graph.get_paths(start,end))
+    print(f"Shortest path between {start} and {end}: ", route_graph.get_shortest_path(start,end))
+
+    start = "Dubai"
+    end = "New York"
+
+    print(f"All paths between: {start} and {end}: ",route_graph.get_paths(start,end))
+    print(f"Shortest path between {start} and {end}: ", route_graph.get_shortest_path(start,end))

2_Arrays/2_arrays_exercise.md

@@ -0,0 +1,45 @@
+# Exercise: Array DataStructure
+
+1. Let us say your expense for every month are listed below,
+	1. January -  2200
+ 	2. February - 2350
+    3. March - 2600
+    4. April - 2130
+    5. May - 2190
+
+Create a list to store these monthly expenses and using that find out,
+
+    1. In Feb, how many dollars you spent extra compare to January?
+    2. Find out your total expense in first quarter (first three months) of the year.
+    3. Find out if you spent exactly 2000 dollars in any month
+    4. June month just finished and your expense is 1980 dollar. Add this item to our monthly expense list
+    5. You returned an item that you bought in a month of April and
+    got a refund of 200$. Make a correction to your monthly expense list
+    based on this
+
+[Solution](https://github.com/codebasics/py/blob/master/DataStructures/2_Arrays/Solution/1_expenses.py)
+
+2. You have a list of your favourite marvel super heros.
+```
+heros=['spider man','thor','hulk','iron man','captain america']
+```
+
+Using this find out,
+
+    1. Length of the list
+    2. Add 'black panther' at the end of this list
+    3. You realize that you need to add 'black panther' after 'hulk',
+       so remove it from the list first and then add it after 'hulk'
+    4. Now you don't like thor and hulk because they get angry easily :)
+       So you want to remove thor and hulk from list and replace them with doctor strange (because he is cool).
+       Do that with one line of code.
+    5. Sort the heros list in alphabetical order (Hint. Use dir() functions to list down all functions available in list)
+
+[Solution](https://github.com/codebasics/py/blob/master/DataStructures/2_Arrays/Solution/2_marvel.py)
+
+
+3. Create a list of all odd numbers between 1 and a max number.
+Max number is something you need to take from a user using input() function
+
+[Solution](https://github.com/codebasics/py/blob/master/DataStructures/2_Arrays/Solution/3_odd_even_numbers.py)
+