Python Practice Problems

This repository contains Python solutions to various practice problems covering a range of topics including searching algorithms, graph traversals, data structures like linked lists and binary search trees (BST), as well as problems from platforms like LeetCode. Each solution is provided in a separate Python file for clarity and ease of understanding.

Table of Contents

1. Searching Algorithms
2. Graph Traversal
3. Binary Search Trees
4. Linked Lists
5. LeetCode Problems
6. Queue and Stack Implementations

---

Searching Algorithms

• Codes of Searching algos.py: Implementation of various searching algorithms like binary search, linear search, etc.

---

Graph Traversal

• DFS Traversal of Graph.py: Depth-First Search traversal of a graph.
• Graph Representations.py: Implementation of different representations of a graph like adjacency matrix and adjacency list.

---

Binary Search Trees

• Insertion and Deletion in BST.py: Python implementation for insertion and deletion operations in a Binary Search Tree.

---

Linked Lists

• Linked list.py: Implementation of a singly linked list.
• double linked list.py: Implementation of a doubly linked list.

---

LeetCode Problems

• Number of Islands leetcode.py: Solution to the "Number of Islands" problem from LeetCode.
• Pre, Post, In-order traversal.py: Implementation of different tree traversal methods (Pre-order, Post-order, In-order).
• Rotting oranges.py: Solution to the "Rotting Oranges" problem from LeetCode.
• max count str.py: Solution to a LeetCode problem involving finding the maximum count of a substring.

---

Queue and Stack Implementations

• queue and stack array.py: Implementation of queues and stacks using arrays.
• queue and stack linkedlist.py: Implementation of queues and stacks using linked lists.
• queue and stack.py: Implementation of queues and stacks using Python's built-in data structures.

---

Happy coding! 🚀