├── 01 Recursion-1 ├── 1 Intro to Recursion.ipynb ├── 2 Fibonacci Number.ipynb ├── 3 Recursion Depth.ipynb ├── 4 List is sorted or not .ipynb ├── 5 Sum of Array.ipynb ├── 6 Check Number in Array.ipynb ├── 7 Find Index of number.ipynb └── 8 Last Index of Number.ipynb ├── 02 Recursion-2 ├── 1 Recursion in Strings.ipynb ├── 2 Replace pi with 3.14.ipynb ├── 3 Remove duplicates recursively.ipynb ├── 4 Binary Search using Recursion.ipynb ├── 5 Merge Sort.ipynb ├── 6 Quick Sort.ipynb └── 7 Towers of Hanoi.ipynb ├── 03 OOPS-1 ├── 3.01 Intro to OOPS.ipynb ├── 3.02 How to create classes & objects.ipynb ├── 3.03 Instance Attributes.ipynb ├── 3.04 Init Method.ipynb ├── 3.05 Instance Methods.ipynb ├── 3.06 Fraction Class - I.ipynb ├── 3.07 Fraction Class - II.ipynb ├── 3.08 Fraction Class = III.ipynb ├── 3.09 Complex Number.ipynb ├── 3.10 Complex Number Addition, Multiplication and Conjunction.ipynb └── 3.11 Complex Number.ipynb ├── 04 OOPS-2 ├── 4.1 [OOPS - 2] Inheritance.ipynb ├── 4.2 Inheritance and Private Members.ipynb ├── 4.3 Inheritance cont.....ipynb ├── 4.4 Polymorphism (Method overriding).ipynb ├── 4.5 Protected Members.ipynb ├── 4.6 Object class.ipynb ├── 4.7 Multiple Inheritance.ipynb ├── 4.8 Method Resolution Order.ipynb └── 4.9 Operator Overloading.ipynb ├── 05 OOPS-3 ├── 5.1 Abstract Classes.ipynb ├── 5.2 Abstract class cont.....ipynb ├── 5.3 Errors and Exceptions.ipynb ├── 5.4 Intro to Exception Handling.ipynb ├── 5.5 Handling Multiple Exceptions.ipynb ├── 5.6 Custom Exceptions (Own Exceptions).ipynb ├── 5.7 Except Functionality.ipynb ├── 5.8 Else and Finally.ipynb └── 5.9 More About Finally.ipynb ├── 06 Time Complexity ├── 6.1 Time Complexity Analysis.ipynb └── 6.2 Excercises.ipynb ├── 07 Space Complexity └── Space Complexity Analysis.ipynb ├── 08 Time Complexity Improvement ├── 8.1 Time Complexity Improvement - power of a number (x^n).ipynb ├── 8.2 Array Intersection.ipynb ├── 8.3 Equilibrium Index.ipynb ├── 8.4 Find a unique number in a list.ipynb ├── 8.5 Duplicate element in an array.ipynb ├── 8.6 Pair sum in a list.ipynb ├── 8.7 Triplet Sum.ipynb └── 8.8 Rotate array.ipynb ├── 09 Linked List-1 ├── 9.01 Intro to Linked List.ipynb ├── 9.02 Creating a linked list by taking input from the user.ipynb ├── 9.03 Printing Linked List.ipynb ├── 9.04 Time Complexity for Taking Input .ipynb ├── 9.05 length of Linked List.ipynb ├── 9.06 Print ith node.ipynb ├── 9.07 Insert a node at ith position.ipynb ├── 9.08 Delete node.ipynb ├── 9.09 Length of a LL (Recursive).ipynb ├── 9.10 Insert at ith postition (Recursively).ipynb ├── 9.11 Deletion of a node using recursion.ipynb ├── 9.12 Find a node in LL.ipynb ├── 9.13 Append Last N elements to First.ipynb ├── 9.14 Eliminate Duplicates from LL.ipynb ├── 9.15 Print Reverse Linked List.ipynb └── 9.16 Palindrome Linked List.ipynb ├── 10 Linked List-2 ├── 10.01 Reverse LL - O(N^2) [Recursive].ipynb ├── 10.02 Reverse LL - 2.ipynb ├── 10.03 Reverse LL - 3 [Best].ipynb ├── 10.04 Reverse LL (Iterative).ipynb ├── 10.05 Mid Point of a Linked List.ipynb ├── 10.06 Merge Two Sorted LL.ipynb ├── 10.07 Merge Sort in LL.ipynb ├── 10.08 Variations in LL.ipynb ├── 10.09 Find a node in LL (recursive).ipynb ├── 10.10 Even nodes after Odd nodes in LL.ipynb ├── 10.11 Delete every N nodes .ipynb ├── 10.12 Swap two nodes of a LL.ipynb ├── 10.13 kReverse.ipynb └── 10.14 Bubble Sort Using Linked List.ipynb ├── 11 Stacks ├── 11.1 Intro to Stack.ipynb ├── 11.2 Stack Using Array.ipynb ├── 11.3 Stack Using Linked List.ipynb ├── 11.4 Inbuilt Stack & Queues.ipynb ├── 11.5 Balanced Paranthesis.ipynb ├── 11.6 Reverse a Stack using Another Stack.ipynb ├── 11.7 Check Redundant Brackets.ipynb ├── 11.8 Stock Span.ipynb └── 11.9 Minimum Bracket Reversal.ipynb ├── 12 Queue ├── 12.1 Intro to Queue.ipynb ├── 12.2 Queue using Array.ipynb ├── 12.3 Queue using LL.ipynb └── 12.4 Inbuilt Stacks and Queues.ipynb ├── 13 Trees ├── 13.01 Introduction to Trees.ipynb ├── 13.02 Print a Tree.ipynb ├── 13.03 Input of Binary Tree.ipynb ├── 13.04 Number of Nodes in a tree.ipynb ├── 13.05 Sum of Nodes.ipynb ├── 13.06 Tree Traversals.ipynb ├── 13.07 Node with Largest Data.ipynb ├── 13.08 Nodes Greater Than X.ipynb ├── 13.09 Height of a tree.ipynb ├── 13.10 Number of Leaf Nodes.ipynb ├── 13.11 Print Nodes at Depth K.ipynb ├── 13.12 Replace Node with Depth .ipynb ├── 13.13 Is node present.ipynb └── 13.14 Nodes without sibling.ipynb ├── 14 Binary Trees - 2 ├── 14.01 Time Complexity of Binary Tree Problem.ipynb ├── 14.02 Remove Leaf Nodes.ipynb ├── 14.03 Mirror Binary Tree.ipynb ├── 14.04 Check tree is balanced or not.ipynb ├── 14.05 Check Balanced {Optimized One}.ipynb ├── 14.06 Diameter of a Binary Tree.ipynb ├── 14.07 Level wise Input Binary Tree.ipynb ├── 14.08 Print Level wise Binary Tree.ipynb ├── 14.09 Construct a tree using inorder and preorder.ipynb ├── 14.10 Construct Tree using In-order and Post-Order.ipynb ├── 14.12 Min and max.ipynb └── 14.13 Level order traversal.ipynb ├── 15 BST-1 ├── 15.1 Intro to Binary Search Tree.ipynb ├── 15.2 Search in BST.ipynb ├── 15.3 Print Elements in range K1 and K2.ipynb ├── 15.4 Convert sorted arrays to BST.ipynb ├── 15.5 Check is BST.ipynb ├── 15.6 isBST optimised.ipynb └── 15.7 isBST (Another solution).ipynb ├── 16 BST-2 ├── 16.1 Root to node path in Binary Tree.ipynb ├── 16.2 Structure of BST class.ipynb ├── 16.3 BST class - search and print.ipynb ├── 16.4 BST class - inserting an element.ipynb ├── 16.5 BST class - delete.ipynb └── 16.6 BST Class Code.ipynb ├── 17 Generic Trees ├── 17.01 Generic Trees.ipynb ├── 17.02 Print a generic tree recursively.ipynb ├── 17.03 Take Tree Input (Recursively).ipynb ├── 17.04 Number of nodes in generic tree.ipynb ├── 17.05 Sum of all nodes.ipynb ├── 17.06 Node with Largest Data.ipynb ├── 17.07 Height of tree.ipynb ├── 17.08 Level wise Input.ipynb ├── 17.09 Print Levelwise.ipynb ├── 17.10 Contains X.ipynb ├── 17.11 Count leaf nodes.ipynb ├── 17.12 Node with maximum child sum.ipynb ├── 17.13 Structurally identical.ipynb └── 17.14 Next larger.ipynb ├── 18 Dictionaries ├── 18.01 Intro to Dictionaries.ipynb ├── 18.02 Accessing or Looping elements in dictionaries.ipynb ├── 18.03 Adding or Removing data in dictionary.ipynb ├── 18.04 Print all words with frequency k.ipynb ├── 18.05 Maximum Frequency.ipynb ├── 18.07 Make our own Hashmap.ipynb ├── 18.08 Collision Handling.ipynb ├── 18.09 Steps for implementing our own Map.ipynb ├── 18.10 How to insert in Map.ipynb ├── 18.11 Search and Remove from Map.ipynb ├── 18.12 Time Complexity for Map Functions.ipynb ├── 18.13 Rehashing.ipynb ├── 18.14 Extract Unique characters.ipynb ├── 18.15 Longest Increasing Subsequence.ipynb ├── 18.17 Longest subset zero sum.ipynb └── img │ ├── README.md │ ├── collision resolution techniques.png │ ├── download (1).png │ ├── download (2).png │ ├── download (3).png │ ├── download (4).png │ ├── download.png │ ├── hash.png │ ├── hashFunction.png │ └── hashTable.png ├── 19 Graphs - 1 ├── 19.01 Intro to Graphs.ipynb ├── 19.02 Terminologies in Graphs.ipynb ├── 19.03 Complexity in terms of edges.ipynb ├── 19.04 How to implement Graphs.ipynb ├── 19.05 Implementation of Graph.ipynb ├── 19.06 DFS.ipynb ├── 19.07 BFS.ipynb ├── 19.08 Has Path.ipynb ├── 19.09 BFS or DFS for disconnected graph.ipynb ├── 19.10 Get Path DFS.ipynb ├── 19.11 Get Path BFS.ipynb ├── 19.12 Is Graph Connected.ipynb ├── 19.13 All Connected Components.ipynb ├── 19.14 Variations of Graph.ipynb └── img │ ├── README.md │ ├── adjacency list.png │ ├── adjacency matrix.png │ ├── bfs.png │ ├── connected.png │ ├── dfs 2.png │ ├── dfs.png │ ├── diagram graph.png │ ├── directed.png │ ├── download (1).png │ ├── download (2).png │ ├── download (3).png │ ├── download.png │ ├── edge list.png │ ├── graph types.png │ ├── graph vertex array.png │ ├── table.png │ ├── tree graph.png │ ├── tree.png │ ├── two component.png │ ├── undirected.png │ ├── weighted directed.png │ └── weighted.png ├── 20 Graphs - 2 ├── 20.1 Minimum Spanning Trees.ipynb ├── 20.2 Kruskal's Algorithm.ipynb ├── 20.3 Detect Cycle.ipynb ├── 20.4 Union Find Algorithm.ipynb ├── 20.5 Kruskal's Algorithm.ipynb ├── 20.6 Prim's Algorithm.ipynb └── 20.7 Dijkstra's Algorithm.ipynb ├── 21 Priority Queues 1 └── README.MD ├── 22 Huffman Coding └── README.MD ├── 23 Priority Queues 2 ├── Buy the ticket.ipynb └── README.MD ├── 24 DP-1 ├── 24.01 Intro to DP.ipynb ├── 24.02 Fibonacci Memoization.ipynb ├── 24.03 Time Complexity of Memoization.ipynb ├── 24.04 Iterative Dynamic Programming.ipynb ├── 24.05 Why Iterative solutions are better.ipynb ├── 24.06 Min steps to 1.ipynb ├── 24.07 Min squares to represent N.ipynb ├── 24.08 longest Increasing Subsequence.ipynb ├── README.MD └── img │ ├── IMG_20190918_145913.jpg │ ├── README.md │ ├── fibdiagram.jpg │ ├── fibonacci__binary_tree_recursive.svg │ ├── fibonacci_tree.png │ ├── lis.jpg │ └── memoization-12.png ├── 25 Recursion-3 ├── 25.01 Return All Subsequences Intro.ipynb ├── 25.02 Keypad combinations.ipynb ├── 25.03 Print the output instead of returning.ipynb ├── 25.04 Minimum of Array.ipynb ├── 25.05 Print All Subsequences.ipynb ├── 25.06 Print keypad combinations.ipynb ├── 25.07 Return subsets sum to K.ipynb ├── 25.07 return subset to sum k.txt ├── 25.08 Return Subsets.txt ├── 25.08 Return subsets.ipynb ├── 25.09 Return Permutations of a String.ipynb ├── 25.09 return all permutations.txt └── img │ ├── keypad.png │ ├── permutation recursion tree.gif │ └── substring and subsequence.jpg ├── 26 DP-2 └── README.MD ├── 27 Backtracking └── README.md ├── 28 Advanced DS Algo Topics ├── Adv. DS Algo Course Outline 1.JPG ├── Adv. DS Algo Course Outline 2.JPG ├── Adv. DS Algo Course Outline 3.JPG └── README.md ├── 29 2048 Game └── README.md ├── Contributing.md ├── LICENSE ├── README.md ├── _config.yml ├── docs ├── README.md └── [Heap] Time complexity of various data structures.docx ├── image.png ├── img ├── 1 Recursion Stack.png ├── 2 Graph.png ├── 3 BFS.png ├── Actual.JPG ├── README.md └── fibonacci_tree.png └── index.md /01 Recursion-1/1 Intro to Recursion.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/1 Intro to Recursion.ipynb -------------------------------------------------------------------------------- /01 Recursion-1/2 Fibonacci Number.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/2 Fibonacci Number.ipynb -------------------------------------------------------------------------------- /01 Recursion-1/3 Recursion Depth.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/3 Recursion Depth.ipynb -------------------------------------------------------------------------------- /01 Recursion-1/4 List is sorted or not .ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/4 List is sorted or not .ipynb -------------------------------------------------------------------------------- /01 Recursion-1/5 Sum of Array.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/5 Sum of Array.ipynb -------------------------------------------------------------------------------- /01 Recursion-1/6 Check Number in Array.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/6 Check Number in Array.ipynb -------------------------------------------------------------------------------- /01 Recursion-1/7 Find Index of number.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/7 Find Index of number.ipynb -------------------------------------------------------------------------------- /01 Recursion-1/8 Last Index of Number.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/01 Recursion-1/8 Last Index of Number.ipynb -------------------------------------------------------------------------------- /02 Recursion-2/1 Recursion in Strings.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/02 Recursion-2/1 Recursion in Strings.ipynb -------------------------------------------------------------------------------- /02 Recursion-2/2 Replace pi with 3.14.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/02 Recursion-2/2 Replace pi with 3.14.ipynb -------------------------------------------------------------------------------- /02 Recursion-2/3 Remove duplicates recursively.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/02 Recursion-2/3 Remove duplicates recursively.ipynb -------------------------------------------------------------------------------- /02 Recursion-2/4 Binary Search using Recursion.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/02 Recursion-2/4 Binary Search using Recursion.ipynb -------------------------------------------------------------------------------- /02 Recursion-2/5 Merge Sort.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/02 Recursion-2/5 Merge Sort.ipynb -------------------------------------------------------------------------------- /02 Recursion-2/6 Quick Sort.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/02 Recursion-2/6 Quick Sort.ipynb -------------------------------------------------------------------------------- /02 Recursion-2/7 Towers of Hanoi.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/02 Recursion-2/7 Towers of Hanoi.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.01 Intro to OOPS.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.01 Intro to OOPS.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.02 How to create classes & objects.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.02 How to create classes & objects.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.03 Instance Attributes.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.03 Instance Attributes.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.04 Init Method.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.04 Init Method.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.05 Instance Methods.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.05 Instance Methods.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.06 Fraction Class - I.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.06 Fraction Class - I.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.07 Fraction Class - II.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.07 Fraction Class - II.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.08 Fraction Class = III.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.08 Fraction Class = III.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.09 Complex Number.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.09 Complex Number.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.10 Complex Number Addition, Multiplication and Conjunction.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.10 Complex Number Addition, Multiplication and Conjunction.ipynb -------------------------------------------------------------------------------- /03 OOPS-1/3.11 Complex Number.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/03 OOPS-1/3.11 Complex Number.ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.1 [OOPS - 2] Inheritance.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.1 [OOPS - 2] Inheritance.ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.2 Inheritance and Private Members.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.2 Inheritance and Private Members.ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.3 Inheritance cont.....ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.3 Inheritance cont.....ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.4 Polymorphism (Method overriding).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.4 Polymorphism (Method overriding).ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.5 Protected Members.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.5 Protected Members.ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.6 Object class.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.6 Object class.ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.7 Multiple Inheritance.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.7 Multiple Inheritance.ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.8 Method Resolution Order.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.8 Method Resolution Order.ipynb -------------------------------------------------------------------------------- /04 OOPS-2/4.9 Operator Overloading.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/04 OOPS-2/4.9 Operator Overloading.ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.1 Abstract Classes.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.1 Abstract Classes.ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.2 Abstract class cont.....ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.2 Abstract class cont.....ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.3 Errors and Exceptions.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.3 Errors and Exceptions.ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.4 Intro to Exception Handling.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.4 Intro to Exception Handling.ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.5 Handling Multiple Exceptions.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.5 Handling Multiple Exceptions.ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.6 Custom Exceptions (Own Exceptions).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.6 Custom Exceptions (Own Exceptions).ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.7 Except Functionality.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.7 Except Functionality.ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.8 Else and Finally.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.8 Else and Finally.ipynb -------------------------------------------------------------------------------- /05 OOPS-3/5.9 More About Finally.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/05 OOPS-3/5.9 More About Finally.ipynb -------------------------------------------------------------------------------- /06 Time Complexity/6.1 Time Complexity Analysis.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/06 Time Complexity/6.1 Time Complexity Analysis.ipynb -------------------------------------------------------------------------------- /06 Time Complexity/6.2 Excercises.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/06 Time Complexity/6.2 Excercises.ipynb -------------------------------------------------------------------------------- /07 Space Complexity/Space Complexity Analysis.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/07 Space Complexity/Space Complexity Analysis.ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.1 Time Complexity Improvement - power of a number (x^n).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.1 Time Complexity Improvement - power of a number (x^n).ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.2 Array Intersection.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.2 Array Intersection.ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.3 Equilibrium Index.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.3 Equilibrium Index.ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.4 Find a unique number in a list.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.4 Find a unique number in a list.ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.5 Duplicate element in an array.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.5 Duplicate element in an array.ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.6 Pair sum in a list.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.6 Pair sum in a list.ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.7 Triplet Sum.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.7 Triplet Sum.ipynb -------------------------------------------------------------------------------- /08 Time Complexity Improvement/8.8 Rotate array.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/08 Time Complexity Improvement/8.8 Rotate array.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.01 Intro to Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.01 Intro to Linked List.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.02 Creating a linked list by taking input from the user.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.02 Creating a linked list by taking input from the user.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.03 Printing Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.03 Printing Linked List.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.04 Time Complexity for Taking Input .ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.04 Time Complexity for Taking Input .ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.05 length of Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.05 length of Linked List.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.06 Print ith node.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.06 Print ith node.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.07 Insert a node at ith position.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.07 Insert a node at ith position.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.08 Delete node.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.08 Delete node.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.09 Length of a LL (Recursive).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.09 Length of a LL (Recursive).ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.10 Insert at ith postition (Recursively).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.10 Insert at ith postition (Recursively).ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.11 Deletion of a node using recursion.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.11 Deletion of a node using recursion.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.12 Find a node in LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.12 Find a node in LL.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.13 Append Last N elements to First.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.13 Append Last N elements to First.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.14 Eliminate Duplicates from LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.14 Eliminate Duplicates from LL.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.15 Print Reverse Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.15 Print Reverse Linked List.ipynb -------------------------------------------------------------------------------- /09 Linked List-1/9.16 Palindrome Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/09 Linked List-1/9.16 Palindrome Linked List.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.01 Reverse LL - O(N^2) [Recursive].ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.01 Reverse LL - O(N^2) [Recursive].ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.02 Reverse LL - 2.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.02 Reverse LL - 2.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.03 Reverse LL - 3 [Best].ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.03 Reverse LL - 3 [Best].ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.04 Reverse LL (Iterative).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.04 Reverse LL (Iterative).ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.05 Mid Point of a Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.05 Mid Point of a Linked List.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.06 Merge Two Sorted LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.06 Merge Two Sorted LL.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.07 Merge Sort in LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.07 Merge Sort in LL.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.08 Variations in LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.08 Variations in LL.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.09 Find a node in LL (recursive).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.09 Find a node in LL (recursive).ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.10 Even nodes after Odd nodes in LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.10 Even nodes after Odd nodes in LL.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.11 Delete every N nodes .ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.11 Delete every N nodes .ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.12 Swap two nodes of a LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.12 Swap two nodes of a LL.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.13 kReverse.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.13 kReverse.ipynb -------------------------------------------------------------------------------- /10 Linked List-2/10.14 Bubble Sort Using Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/10 Linked List-2/10.14 Bubble Sort Using Linked List.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.1 Intro to Stack.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.1 Intro to Stack.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.2 Stack Using Array.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.2 Stack Using Array.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.3 Stack Using Linked List.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.3 Stack Using Linked List.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.4 Inbuilt Stack & Queues.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.4 Inbuilt Stack & Queues.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.5 Balanced Paranthesis.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.5 Balanced Paranthesis.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.6 Reverse a Stack using Another Stack.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.6 Reverse a Stack using Another Stack.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.7 Check Redundant Brackets.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.7 Check Redundant Brackets.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.8 Stock Span.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.8 Stock Span.ipynb -------------------------------------------------------------------------------- /11 Stacks/11.9 Minimum Bracket Reversal.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/11 Stacks/11.9 Minimum Bracket Reversal.ipynb -------------------------------------------------------------------------------- /12 Queue/12.1 Intro to Queue.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/12 Queue/12.1 Intro to Queue.ipynb -------------------------------------------------------------------------------- /12 Queue/12.2 Queue using Array.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/12 Queue/12.2 Queue using Array.ipynb -------------------------------------------------------------------------------- /12 Queue/12.3 Queue using LL.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/12 Queue/12.3 Queue using LL.ipynb -------------------------------------------------------------------------------- /12 Queue/12.4 Inbuilt Stacks and Queues.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/12 Queue/12.4 Inbuilt Stacks and Queues.ipynb -------------------------------------------------------------------------------- /13 Trees/13.01 Introduction to Trees.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.01 Introduction to Trees.ipynb -------------------------------------------------------------------------------- /13 Trees/13.02 Print a Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.02 Print a Tree.ipynb -------------------------------------------------------------------------------- /13 Trees/13.03 Input of Binary Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.03 Input of Binary Tree.ipynb -------------------------------------------------------------------------------- /13 Trees/13.04 Number of Nodes in a tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.04 Number of Nodes in a tree.ipynb -------------------------------------------------------------------------------- /13 Trees/13.05 Sum of Nodes.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.05 Sum of Nodes.ipynb -------------------------------------------------------------------------------- /13 Trees/13.06 Tree Traversals.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.06 Tree Traversals.ipynb -------------------------------------------------------------------------------- /13 Trees/13.07 Node with Largest Data.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.07 Node with Largest Data.ipynb -------------------------------------------------------------------------------- /13 Trees/13.08 Nodes Greater Than X.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.08 Nodes Greater Than X.ipynb -------------------------------------------------------------------------------- /13 Trees/13.09 Height of a tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.09 Height of a tree.ipynb -------------------------------------------------------------------------------- /13 Trees/13.10 Number of Leaf Nodes.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.10 Number of Leaf Nodes.ipynb -------------------------------------------------------------------------------- /13 Trees/13.11 Print Nodes at Depth K.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.11 Print Nodes at Depth K.ipynb -------------------------------------------------------------------------------- /13 Trees/13.12 Replace Node with Depth .ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.12 Replace Node with Depth .ipynb -------------------------------------------------------------------------------- /13 Trees/13.13 Is node present.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.13 Is node present.ipynb -------------------------------------------------------------------------------- /13 Trees/13.14 Nodes without sibling.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/13 Trees/13.14 Nodes without sibling.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.01 Time Complexity of Binary Tree Problem.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.01 Time Complexity of Binary Tree Problem.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.02 Remove Leaf Nodes.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.02 Remove Leaf Nodes.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.03 Mirror Binary Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.03 Mirror Binary Tree.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.04 Check tree is balanced or not.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.04 Check tree is balanced or not.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.05 Check Balanced {Optimized One}.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.05 Check Balanced {Optimized One}.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.06 Diameter of a Binary Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.06 Diameter of a Binary Tree.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.07 Level wise Input Binary Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.07 Level wise Input Binary Tree.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.08 Print Level wise Binary Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.08 Print Level wise Binary Tree.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.09 Construct a tree using inorder and preorder.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.09 Construct a tree using inorder and preorder.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.10 Construct Tree using In-order and Post-Order.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.10 Construct Tree using In-order and Post-Order.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.12 Min and max.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.12 Min and max.ipynb -------------------------------------------------------------------------------- /14 Binary Trees - 2/14.13 Level order traversal.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/14 Binary Trees - 2/14.13 Level order traversal.ipynb -------------------------------------------------------------------------------- /15 BST-1/15.1 Intro to Binary Search Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/15 BST-1/15.1 Intro to Binary Search Tree.ipynb -------------------------------------------------------------------------------- /15 BST-1/15.2 Search in BST.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/15 BST-1/15.2 Search in BST.ipynb -------------------------------------------------------------------------------- /15 BST-1/15.3 Print Elements in range K1 and K2.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/15 BST-1/15.3 Print Elements in range K1 and K2.ipynb -------------------------------------------------------------------------------- /15 BST-1/15.4 Convert sorted arrays to BST.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/15 BST-1/15.4 Convert sorted arrays to BST.ipynb -------------------------------------------------------------------------------- /15 BST-1/15.5 Check is BST.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/15 BST-1/15.5 Check is BST.ipynb -------------------------------------------------------------------------------- /15 BST-1/15.6 isBST optimised.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/15 BST-1/15.6 isBST optimised.ipynb -------------------------------------------------------------------------------- /15 BST-1/15.7 isBST (Another solution).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/15 BST-1/15.7 isBST (Another solution).ipynb -------------------------------------------------------------------------------- /16 BST-2/16.1 Root to node path in Binary Tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/16 BST-2/16.1 Root to node path in Binary Tree.ipynb -------------------------------------------------------------------------------- /16 BST-2/16.2 Structure of BST class.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/16 BST-2/16.2 Structure of BST class.ipynb -------------------------------------------------------------------------------- /16 BST-2/16.3 BST class - search and print.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/16 BST-2/16.3 BST class - search and print.ipynb -------------------------------------------------------------------------------- /16 BST-2/16.4 BST class - inserting an element.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/16 BST-2/16.4 BST class - inserting an element.ipynb -------------------------------------------------------------------------------- /16 BST-2/16.5 BST class - delete.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/16 BST-2/16.5 BST class - delete.ipynb -------------------------------------------------------------------------------- /16 BST-2/16.6 BST Class Code.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/16 BST-2/16.6 BST Class Code.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.01 Generic Trees.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.01 Generic Trees.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.02 Print a generic tree recursively.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.02 Print a generic tree recursively.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.03 Take Tree Input (Recursively).ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.03 Take Tree Input (Recursively).ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.04 Number of nodes in generic tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.04 Number of nodes in generic tree.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.05 Sum of all nodes.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.05 Sum of all nodes.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.06 Node with Largest Data.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.06 Node with Largest Data.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.07 Height of tree.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.07 Height of tree.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.08 Level wise Input.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.08 Level wise Input.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.09 Print Levelwise.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.09 Print Levelwise.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.10 Contains X.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.10 Contains X.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.11 Count leaf nodes.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.11 Count leaf nodes.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.12 Node with maximum child sum.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.12 Node with maximum child sum.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.13 Structurally identical.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.13 Structurally identical.ipynb -------------------------------------------------------------------------------- /17 Generic Trees/17.14 Next larger.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/17 Generic Trees/17.14 Next larger.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.01 Intro to Dictionaries.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.01 Intro to Dictionaries.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.02 Accessing or Looping elements in dictionaries.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.02 Accessing or Looping elements in dictionaries.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.03 Adding or Removing data in dictionary.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.03 Adding or Removing data in dictionary.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.04 Print all words with frequency k.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.04 Print all words with frequency k.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.05 Maximum Frequency.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.05 Maximum Frequency.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.07 Make our own Hashmap.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.07 Make our own Hashmap.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.08 Collision Handling.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.08 Collision Handling.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.09 Steps for implementing our own Map.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.09 Steps for implementing our own Map.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.10 How to insert in Map.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.10 How to insert in Map.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.11 Search and Remove from Map.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.11 Search and Remove from Map.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.12 Time Complexity for Map Functions.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.12 Time Complexity for Map Functions.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.13 Rehashing.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.13 Rehashing.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.14 Extract Unique characters.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.14 Extract Unique characters.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.15 Longest Increasing Subsequence.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.15 Longest Increasing Subsequence.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/18.17 Longest subset zero sum.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/18.17 Longest subset zero sum.ipynb -------------------------------------------------------------------------------- /18 Dictionaries/img/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/README.md -------------------------------------------------------------------------------- /18 Dictionaries/img/collision resolution techniques.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/collision resolution techniques.png -------------------------------------------------------------------------------- /18 Dictionaries/img/download (1).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/download (1).png -------------------------------------------------------------------------------- /18 Dictionaries/img/download (2).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/download (2).png -------------------------------------------------------------------------------- /18 Dictionaries/img/download (3).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/download (3).png -------------------------------------------------------------------------------- /18 Dictionaries/img/download (4).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/download (4).png -------------------------------------------------------------------------------- /18 Dictionaries/img/download.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/download.png -------------------------------------------------------------------------------- /18 Dictionaries/img/hash.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/hash.png -------------------------------------------------------------------------------- /18 Dictionaries/img/hashFunction.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/hashFunction.png -------------------------------------------------------------------------------- /18 Dictionaries/img/hashTable.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/18 Dictionaries/img/hashTable.png -------------------------------------------------------------------------------- /19 Graphs - 1/19.01 Intro to Graphs.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.01 Intro to Graphs.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.02 Terminologies in Graphs.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.02 Terminologies in Graphs.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.03 Complexity in terms of edges.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.03 Complexity in terms of edges.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.04 How to implement Graphs.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.04 How to implement Graphs.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.05 Implementation of Graph.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.05 Implementation of Graph.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.06 DFS.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.06 DFS.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.07 BFS.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.07 BFS.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.08 Has Path.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.08 Has Path.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.09 BFS or DFS for disconnected graph.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.09 BFS or DFS for disconnected graph.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.10 Get Path DFS.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.10 Get Path DFS.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.11 Get Path BFS.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.11 Get Path BFS.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.12 Is Graph Connected.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.12 Is Graph Connected.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.13 All Connected Components.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.13 All Connected Components.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/19.14 Variations of Graph.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/19.14 Variations of Graph.ipynb -------------------------------------------------------------------------------- /19 Graphs - 1/img/README.md: -------------------------------------------------------------------------------- 1 | This folder contains all the images used in Graphs - 1 2 | -------------------------------------------------------------------------------- /19 Graphs - 1/img/adjacency list.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/adjacency list.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/adjacency matrix.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/adjacency matrix.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/bfs.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/bfs.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/connected.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/connected.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/dfs 2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/dfs 2.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/dfs.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/dfs.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/diagram graph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/diagram graph.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/directed.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/directed.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/download (1).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/download (1).png -------------------------------------------------------------------------------- /19 Graphs - 1/img/download (2).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/download (2).png -------------------------------------------------------------------------------- /19 Graphs - 1/img/download (3).png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/download (3).png -------------------------------------------------------------------------------- /19 Graphs - 1/img/download.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/download.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/edge list.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/edge list.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/graph types.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/graph types.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/graph vertex array.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/graph vertex array.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/table.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/table.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/tree graph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/tree graph.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/tree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/tree.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/two component.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/two component.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/undirected.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/undirected.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/weighted directed.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/weighted directed.png -------------------------------------------------------------------------------- /19 Graphs - 1/img/weighted.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/19 Graphs - 1/img/weighted.png -------------------------------------------------------------------------------- /20 Graphs - 2/20.1 Minimum Spanning Trees.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/20 Graphs - 2/20.1 Minimum Spanning Trees.ipynb -------------------------------------------------------------------------------- /20 Graphs - 2/20.2 Kruskal's Algorithm.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/20 Graphs - 2/20.2 Kruskal's Algorithm.ipynb -------------------------------------------------------------------------------- /20 Graphs - 2/20.3 Detect Cycle.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/20 Graphs - 2/20.3 Detect Cycle.ipynb -------------------------------------------------------------------------------- /20 Graphs - 2/20.4 Union Find Algorithm.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/20 Graphs - 2/20.4 Union Find Algorithm.ipynb -------------------------------------------------------------------------------- /20 Graphs - 2/20.5 Kruskal's Algorithm.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/20 Graphs - 2/20.5 Kruskal's Algorithm.ipynb -------------------------------------------------------------------------------- /20 Graphs - 2/20.6 Prim's Algorithm.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/20 Graphs - 2/20.6 Prim's Algorithm.ipynb -------------------------------------------------------------------------------- /20 Graphs - 2/20.7 Dijkstra's Algorithm.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/20 Graphs - 2/20.7 Dijkstra's Algorithm.ipynb -------------------------------------------------------------------------------- /21 Priority Queues 1/README.MD: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/21 Priority Queues 1/README.MD -------------------------------------------------------------------------------- /22 Huffman Coding/README.MD: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/22 Huffman Coding/README.MD -------------------------------------------------------------------------------- /23 Priority Queues 2/Buy the ticket.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/23 Priority Queues 2/Buy the ticket.ipynb -------------------------------------------------------------------------------- /23 Priority Queues 2/README.MD: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/23 Priority Queues 2/README.MD -------------------------------------------------------------------------------- /24 DP-1/24.01 Intro to DP.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.01 Intro to DP.ipynb -------------------------------------------------------------------------------- /24 DP-1/24.02 Fibonacci Memoization.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.02 Fibonacci Memoization.ipynb -------------------------------------------------------------------------------- /24 DP-1/24.03 Time Complexity of Memoization.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.03 Time Complexity of Memoization.ipynb -------------------------------------------------------------------------------- /24 DP-1/24.04 Iterative Dynamic Programming.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.04 Iterative Dynamic Programming.ipynb -------------------------------------------------------------------------------- /24 DP-1/24.05 Why Iterative solutions are better.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.05 Why Iterative solutions are better.ipynb -------------------------------------------------------------------------------- /24 DP-1/24.06 Min steps to 1.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.06 Min steps to 1.ipynb -------------------------------------------------------------------------------- /24 DP-1/24.07 Min squares to represent N.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.07 Min squares to represent N.ipynb -------------------------------------------------------------------------------- /24 DP-1/24.08 longest Increasing Subsequence.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/24.08 longest Increasing Subsequence.ipynb -------------------------------------------------------------------------------- /24 DP-1/README.MD: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/README.MD -------------------------------------------------------------------------------- /24 DP-1/img/IMG_20190918_145913.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/img/IMG_20190918_145913.jpg -------------------------------------------------------------------------------- /24 DP-1/img/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/img/README.md -------------------------------------------------------------------------------- /24 DP-1/img/fibdiagram.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/img/fibdiagram.jpg -------------------------------------------------------------------------------- /24 DP-1/img/fibonacci__binary_tree_recursive.svg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/img/fibonacci__binary_tree_recursive.svg -------------------------------------------------------------------------------- /24 DP-1/img/fibonacci_tree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/img/fibonacci_tree.png -------------------------------------------------------------------------------- /24 DP-1/img/lis.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/img/lis.jpg -------------------------------------------------------------------------------- /24 DP-1/img/memoization-12.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/24 DP-1/img/memoization-12.png -------------------------------------------------------------------------------- /25 Recursion-3/25.01 Return All Subsequences Intro.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.01 Return All Subsequences Intro.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.02 Keypad combinations.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.02 Keypad combinations.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.03 Print the output instead of returning.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.03 Print the output instead of returning.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.04 Minimum of Array.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.04 Minimum of Array.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.05 Print All Subsequences.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.05 Print All Subsequences.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.06 Print keypad combinations.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.06 Print keypad combinations.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.07 Return subsets sum to K.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.07 Return subsets sum to K.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.07 return subset to sum k.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.07 return subset to sum k.txt -------------------------------------------------------------------------------- /25 Recursion-3/25.08 Return Subsets.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.08 Return Subsets.txt -------------------------------------------------------------------------------- /25 Recursion-3/25.08 Return subsets.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.08 Return subsets.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.09 Return Permutations of a String.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.09 Return Permutations of a String.ipynb -------------------------------------------------------------------------------- /25 Recursion-3/25.09 return all permutations.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/25.09 return all permutations.txt -------------------------------------------------------------------------------- /25 Recursion-3/img/keypad.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/img/keypad.png -------------------------------------------------------------------------------- /25 Recursion-3/img/permutation recursion tree.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/img/permutation recursion tree.gif -------------------------------------------------------------------------------- /25 Recursion-3/img/substring and subsequence.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/25 Recursion-3/img/substring and subsequence.jpg -------------------------------------------------------------------------------- /26 DP-2/README.MD: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/26 DP-2/README.MD -------------------------------------------------------------------------------- /27 Backtracking/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/27 Backtracking/README.md -------------------------------------------------------------------------------- /28 Advanced DS Algo Topics/Adv. DS Algo Course Outline 1.JPG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/28 Advanced DS Algo Topics/Adv. DS Algo Course Outline 1.JPG -------------------------------------------------------------------------------- /28 Advanced DS Algo Topics/Adv. DS Algo Course Outline 2.JPG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/28 Advanced DS Algo Topics/Adv. DS Algo Course Outline 2.JPG -------------------------------------------------------------------------------- /28 Advanced DS Algo Topics/Adv. DS Algo Course Outline 3.JPG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/28 Advanced DS Algo Topics/Adv. DS Algo Course Outline 3.JPG -------------------------------------------------------------------------------- /28 Advanced DS Algo Topics/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/28 Advanced DS Algo Topics/README.md -------------------------------------------------------------------------------- /29 2048 Game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/29 2048 Game/README.md -------------------------------------------------------------------------------- /Contributing.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/Contributing.md -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/LICENSE -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/README.md -------------------------------------------------------------------------------- /_config.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/_config.yml -------------------------------------------------------------------------------- /docs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/docs/README.md -------------------------------------------------------------------------------- /docs/[Heap] Time complexity of various data structures.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/docs/[Heap] Time complexity of various data structures.docx -------------------------------------------------------------------------------- /image.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/image.png -------------------------------------------------------------------------------- /img/1 Recursion Stack.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/img/1 Recursion Stack.png -------------------------------------------------------------------------------- /img/2 Graph.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/img/2 Graph.png -------------------------------------------------------------------------------- /img/3 BFS.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/img/3 BFS.png -------------------------------------------------------------------------------- /img/Actual.JPG: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/img/Actual.JPG -------------------------------------------------------------------------------- /img/README.md: -------------------------------------------------------------------------------- 1 | This folder contains all the images used in this repo 2 | -------------------------------------------------------------------------------- /img/fibonacci_tree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/img/fibonacci_tree.png -------------------------------------------------------------------------------- /index.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FazeelUsmani/Data-Structures-and-Algorithms-in-Python/HEAD/index.md --------------------------------------------------------------------------------