From 679367eff46e17f6bc72bffdba477bef5fb75818 Mon Sep 17 00:00:00 2001 From: "google-labs-jules[bot]" <161369871+google-labs-jules[bot]@users.noreply.github.com> Date: Sat, 16 May 2026 02:13:26 +0000 Subject: [PATCH] docs: comprehensive README update and PascalCase refactor - Update root and subdirectory READMEs - Rename directories and files for consistency - Use LaTeX for complexity notations - Fix Table of Contents anchor links Co-authored-by: ppant <149585+ppant@users.noreply.github.com> --- ...manual_Sol.py => AnagramCheckManualSol.py} | 0 ...Sorted_Sol.py => AnagramCheckSortedSol.py} | 0 ...rrayFindTheMissingElementBruteForceSol.py} | 0 ...ArrayFindTheMissingElementHashTableSol.py} | 0 ...py => ArrayFindTheMissingElementSumSol.py} | 0 ...py => ArrayFindTheMissingElementXORSol.py} | 0 Arrays/README.md | 12 ++-- {deque => Deque}/DequeImple.py | 0 {deque => Deque}/README.md | 2 +- Error-debug/README.md | 7 -- .../ErrorExceptions.py | 0 ErrorHandling/README.md | 7 ++ GraphAlgorithms/README.md | 14 ++-- LinkedLists/README.md | 12 ++-- Queues/README.md | 4 +- README.md | 68 +++++++++---------- Recursion/README.md | 27 +++----- Sorting/README.md | 8 +-- Stacks/README.md | 6 +- Trees/{buildTreeTest.py => BuildTreeTest.py} | 0 Trees/README.md | 29 +++----- 21 files changed, 92 insertions(+), 104 deletions(-) rename Arrays/{Anagram_Check_manual_Sol.py => AnagramCheckManualSol.py} (100%) rename Arrays/{Anagram_Check_Sorted_Sol.py => AnagramCheckSortedSol.py} (100%) rename Arrays/{ArrayFindTheMissingElement_brute_force_sol.py => ArrayFindTheMissingElementBruteForceSol.py} (100%) rename Arrays/{ArrayFindTheMissingElement_hash_table_sol.py => ArrayFindTheMissingElementHashTableSol.py} (100%) rename Arrays/{ArrayFindTheMissingElement_takingSumandSubtract_sol.py => ArrayFindTheMissingElementSumSol.py} (100%) rename Arrays/{ArrayFindTheMissingElement_XOR_sol.py => ArrayFindTheMissingElementXORSol.py} (100%) rename {deque => Deque}/DequeImple.py (100%) rename {deque => Deque}/README.md (58%) delete mode 100644 Error-debug/README.md rename {Error-debug => ErrorHandling}/ErrorExceptions.py (100%) create mode 100644 ErrorHandling/README.md rename Trees/{buildTreeTest.py => BuildTreeTest.py} (100%) diff --git a/Arrays/Anagram_Check_manual_Sol.py b/Arrays/AnagramCheckManualSol.py similarity index 100% rename from Arrays/Anagram_Check_manual_Sol.py rename to Arrays/AnagramCheckManualSol.py diff --git a/Arrays/Anagram_Check_Sorted_Sol.py b/Arrays/AnagramCheckSortedSol.py similarity index 100% rename from Arrays/Anagram_Check_Sorted_Sol.py rename to Arrays/AnagramCheckSortedSol.py diff --git a/Arrays/ArrayFindTheMissingElement_brute_force_sol.py b/Arrays/ArrayFindTheMissingElementBruteForceSol.py similarity index 100% rename from Arrays/ArrayFindTheMissingElement_brute_force_sol.py rename to Arrays/ArrayFindTheMissingElementBruteForceSol.py diff --git a/Arrays/ArrayFindTheMissingElement_hash_table_sol.py b/Arrays/ArrayFindTheMissingElementHashTableSol.py similarity index 100% rename from Arrays/ArrayFindTheMissingElement_hash_table_sol.py rename to Arrays/ArrayFindTheMissingElementHashTableSol.py diff --git a/Arrays/ArrayFindTheMissingElement_takingSumandSubtract_sol.py b/Arrays/ArrayFindTheMissingElementSumSol.py similarity index 100% rename from Arrays/ArrayFindTheMissingElement_takingSumandSubtract_sol.py rename to Arrays/ArrayFindTheMissingElementSumSol.py diff --git a/Arrays/ArrayFindTheMissingElement_XOR_sol.py b/Arrays/ArrayFindTheMissingElementXORSol.py similarity index 100% rename from Arrays/ArrayFindTheMissingElement_XOR_sol.py rename to Arrays/ArrayFindTheMissingElementXORSol.py diff --git a/Arrays/README.md b/Arrays/README.md index 707a82e..6a3de28 100644 --- a/Arrays/README.md +++ b/Arrays/README.md @@ -4,10 +4,10 @@ This directory contains Python implementations of common array-based algorithms ## Contents -- [Anagram Check (Sorted Solution)](Anagram_Check_Sorted_Sol.py): Checks if two strings are anagrams by comparing their sorted versions. -- [Anagram Check (Manual Solution)](Anagram_Check_manual_Sol.py): Checks if two strings are anagrams using a hash table (dictionary) to count character frequencies. -- [Array Find Missing Element (XOR Solution)](ArrayFindTheMissingElement_XOR_sol.py): Efficiently finds a missing element in a shuffled array using bitwise XOR. -- [Array Find Missing Element (Brute Force Solution)](ArrayFindTheMissingElement_brute_force_sol.py): Finds a missing element by sorting both arrays and comparing them. -- [Array Find Missing Element (Hash Table Solution)](ArrayFindTheMissingElement_hash_table_sol.py): Finds a missing element using a hash table (dictionary) to track element counts. -- [Array Find Missing Element (Sum/Subtract Solution)](ArrayFindTheMissingElement_takingSumandSubtract_sol.py): Finds a missing element by calculating the difference between the sums of the two arrays. +- [Anagram Check (Sorted Solution)](AnagramCheckSortedSol.py): Checks if two strings are anagrams by comparing their sorted versions. +- [Anagram Check (Manual Solution)](AnagramCheckManualSol.py): Checks if two strings are anagrams using a hash table (dictionary) to count character frequencies. +- [Array Find Missing Element (XOR Solution)](ArrayFindTheMissingElementXORSol.py): Efficiently finds a missing element in a shuffled array using bitwise XOR. +- [Array Find Missing Element (Brute Force Solution)](ArrayFindTheMissingElementBruteForceSol.py): Finds a missing element by sorting both arrays and comparing them. +- [Array Find Missing Element (Hash Table Solution)](ArrayFindTheMissingElementHashTableSol.py): Finds a missing element using a hash table (dictionary) to track element counts. +- [Array Find Missing Element (Sum/Subtract Solution)](ArrayFindTheMissingElementSumSol.py): Finds a missing element by calculating the difference between the sums of the two arrays. - [Array Pair Sum Solution](ArrayPairSumSol.py): Finds all unique pairs in an array that sum up to a specific value $k$ using a set for $O(n)$ complexity. diff --git a/deque/DequeImple.py b/Deque/DequeImple.py similarity index 100% rename from deque/DequeImple.py rename to Deque/DequeImple.py diff --git a/deque/README.md b/Deque/README.md similarity index 58% rename from deque/README.md rename to Deque/README.md index 046a17f..9fdc30d 100644 --- a/deque/README.md +++ b/Deque/README.md @@ -4,4 +4,4 @@ This directory contains Python implementations of the Deque (Double-Ended Queue) ## Contents -- [Deque Implementation](DequeImple.py): Basic implementation of a Deque using a Python list. Includes operations like `addFront`, `addRear`, `removeFront`, `removeRear`, `isEmpty`, and `size`. +- [Deque Implementation](DequeImple.py): Basic implementation of a Deque using a Python list. diff --git a/Error-debug/README.md b/Error-debug/README.md deleted file mode 100644 index c8bc4d4..0000000 --- a/Error-debug/README.md +++ /dev/null @@ -1,7 +0,0 @@ -# Error and Debugging - -This directory contains examples of error handling and debugging techniques in Python. - -## Contents - -- [Error and Exceptions](ErrorExceptions.py): Demonstrates the use of `try`, `except`, `else`, and `finally` blocks for robust error handling, specifically validating integer user input. diff --git a/Error-debug/ErrorExceptions.py b/ErrorHandling/ErrorExceptions.py similarity index 100% rename from Error-debug/ErrorExceptions.py rename to ErrorHandling/ErrorExceptions.py diff --git a/ErrorHandling/README.md b/ErrorHandling/README.md new file mode 100644 index 0000000..4155aad --- /dev/null +++ b/ErrorHandling/README.md @@ -0,0 +1,7 @@ +# Error Handling + +This directory contains examples of error handling and debugging in Python. + +## Contents + +- [Error and Exceptions](ErrorExceptions.py): Demonstrates `try`, `except`, `else`, and `finally` blocks for robust error handling. diff --git a/GraphAlgorithms/README.md b/GraphAlgorithms/README.md index f0330f8..668019a 100644 --- a/GraphAlgorithms/README.md +++ b/GraphAlgorithms/README.md @@ -1,12 +1,12 @@ # Graph Algorithms -This directory contains Python implementations of common graph-based algorithms and data structures. +This directory contains Python implementations of graph-based algorithms and data structures. ## Contents -- [Adjacency List Implementation](AdjacencyListGraphImple.py): Implements the Graph Abstract Data Type (ADT) using an adjacency list (dictionaries in Python). Includes `Vertex` and `Graph` classes. -- [Breadth First Search (BFS)](BFS.py): Implements BFS to solve the Word Ladder problem, finding the shortest transformation path between words. -- [General Depth First Search (DFS)](DFSGeneral.py): Provides a general implementation of DFS, including discovery and finish times for vertices. -- [DFS - Knight's Tour Problem](DFSImpleTheKnightsTourProblem.py): Another implementation of DFS specifically tailored to the Knight's Tour puzzle. -- [The Knight's Tour Problem](TheKnightsTourProblem.py): Focuses on generating the knight's move graph and solving the tour using DFS and backtracking. -- [Word Ladder Problem](WordLadderProblem.py): Specifically focuses on building the word ladder graph where edges connect words that differ by only one letter. +- [Adjacency List Graph](AdjacencyListGraphImple.py): Implementation of the Graph Abstract Data Type (ADT) using an adjacency list. +- [Breadth First Search (BFS)](BFS.py): Implementation of BFS to solve the Word Ladder problem. +- [Depth First Search (DFS)](DFSGeneral.py): General implementation of the DFS algorithm. +- [The Knight's Tour Problem (Graph Generation)](TheKnightsTourProblem.py): Generating a graph of legal moves for a knight on a chessboard. +- [The Knight's Tour Problem (DFS Solution)](DFSImpleTheKnightsTourProblem.py): Solving the Knight's Tour problem using DFS. +- [Word Ladder Problem](WordLadderProblem.py): Building the word ladder graph and finding paths between words. diff --git a/LinkedLists/README.md b/LinkedLists/README.md index bead21d..66d542e 100644 --- a/LinkedLists/README.md +++ b/LinkedLists/README.md @@ -1,11 +1,11 @@ # Linked Lists -This directory contains Python implementations of various types of linked lists and related algorithms. +This directory contains Python implementations of Singly and Doubly Linked Lists and related problems. ## Contents -- [Singly Linked List Implementation](SingleLinkedListImple.py): Basic implementation of a singly linked list node and basic linkage. -- [Doubly Linked List Implementation](DoublyLinkedListImple.py): Basic implementation of a doubly linked list node with `prev` and `next` pointers. -- [Singly Linked List Cycle Check](SinglyLinkedListCycleCheckImple.py): Implements Floyd's Cycle-Finding Algorithm (two pointers) to detect cycles in a linked list. -- [Linked List Reversal](LinkedListReversal.py): Reverses a singly linked list in-place in $O(n)$ time. -- [Nth to Last Node](LinkedListNthToLastNode.py): Finds the $n$-th to last node in a singly linked list using two pointers. +- [Singly Linked List Implementation](SingleLinkedListImple.py): Basic operations for a Singly Linked List. +- [Doubly Linked List Implementation](DoublyLinkedListImple.py): Basic operations for a Doubly Linked List. +- [Singly Linked List Cycle Check](SinglyLinkedListCycleCheckImple.py): Implementation of Floyd's Cycle-Finding algorithm ($O(n)$ time, $O(1)$ space). +- [Linked List Reversal](LinkedListReversal.py): In-place reversal of a Singly Linked List. +- [Linked List N-th to Last Node](LinkedListNthToLastNode.py): Finding the $n$-th node from the end of a Singly Linked List. diff --git a/Queues/README.md b/Queues/README.md index a1c90d0..5ff2941 100644 --- a/Queues/README.md +++ b/Queues/README.md @@ -4,5 +4,5 @@ This directory contains Python implementations of the Queue data structure. ## Contents -- [Queue Implementation](QueueImple.py): Basic implementation of a FIFO (First-In-First-Out) queue using a Python list. Includes `enqueue`, `dequeue`, `isEmpty`, and `size` methods. -- [Queue with Two Stacks](QueueWith2StacksImple.py): Implements a queue using two stacks (represented by Python lists) to achieve FIFO behavior. +- [Queue Implementation](QueueImple.py): Basic implementation of a Queue using a Python list. +- [Queue with Two Stacks](QueueWith2StacksImple.py): Implementation of a Queue using two Stacks. diff --git a/README.md b/README.md index b8de7d5..aa82c6c 100644 --- a/README.md +++ b/README.md @@ -35,23 +35,23 @@ See [CONTRIBUTING.md](CONTRIBUTING.md) for more details. ## πŸ“– Table of Contents -- [Getting Started](#getting-started) -- [Project Structure](#project-structure) -- [Data Structures](#data-structures) - - [Arrays](#arrays) - - [Linked Lists](#linked-lists) - - [Stacks](#stacks) - - [Queues](#queues) - - [Deque](#deque) - - [Trees](#trees) -- [Algorithms](#algorithms) - - [Sorting](#sorting) - - [Recursion & Dynamic Programming](#recursion--dynamic-programming) - - [Graph Algorithms](#graph-algorithms) -- [Error Handling & Debugging](#error-handling--debugging) -- [Usage](#usage) -- [Quick Reference](#quick-reference) -- [License](#license) +- [Getting Started](#-getting-started) +- [Project Structure](#-project-structure) +- [Data Structures](#-data-structures) + - [Arrays](#arrays-) + - [Linked Lists](#linked-lists-) + - [Stacks](#stacks-) + - [Queues](#queues-) + - [Deque](#deque-) + - [Trees](#trees-) +- [Algorithms](#-algorithms) + - [Sorting](#sorting-) + - [Recursion & Dynamic Programming](#recursion--dynamic-programming-) + - [Graph Algorithms](#graph-algorithms-) +- [Error Handling & Debugging](#-error-handling--debugging) +- [Usage](#-usage) +- [Quick Reference](#-quick-reference) +- [License](#-license) --- @@ -67,7 +67,7 @@ Most scripts in this repository are standalone and can be executed directly: ```bash # Run any Python script -python3 Arrays/Anagram_Check_Sorted_Sol.py +python3 Arrays/AnagramCheckSortedSol.py # Or run from the repo root python3 Sorting/BubbleSortImple.py @@ -80,7 +80,7 @@ python3 Sorting/BubbleSortImple.py ``` . β”œβ”€β”€ Arrays/ # πŸ”€ Array-based problems and algorithms -β”œβ”€β”€ Error-debug/ # ⚠️ Error handling and debugging examples +β”œβ”€β”€ ErrorHandling/ # ⚠️ Error handling and debugging examples β”œβ”€β”€ GraphAlgorithms/ # πŸ—ΊοΈ Graph traversal (BFS, DFS) and pathfinding β”œβ”€β”€ LinkedLists/ # πŸ”— Singly and Doubly Linked Lists β”œβ”€β”€ Queues/ # πŸ“¦ Queue implementations (FIFO) @@ -88,7 +88,7 @@ python3 Sorting/BubbleSortImple.py β”œβ”€β”€ Sorting/ # πŸ“Š Common sorting algorithms β”œβ”€β”€ Stacks/ # πŸ“š Stack implementations and applications β”œβ”€β”€ Trees/ # 🌳 Binary Trees, BSTs, Heaps, and Traversals -β”œβ”€β”€ deque/ # πŸ”„ Double-ended queue +β”œβ”€β”€ Deque/ # πŸ”„ Double-ended queue β”œβ”€β”€ CONTRIBUTING.md # 🀝 Contribution guidelines β”œβ”€β”€ LICENSE # πŸ“„ MIT License └── README.md # πŸ“– This file @@ -100,13 +100,13 @@ python3 Sorting/BubbleSortImple.py ### Arrays πŸ”€ Common array-based algorithms and manipulations. -- [Anagram Check](Arrays/): [Sorted](Arrays/Anagram_Check_Sorted_Sol.py) & [Manual](Arrays/Anagram_Check_manual_Sol.py) solutions +- [Anagram Check](Arrays/): [Sorted](Arrays/AnagramCheckSortedSol.py) and [Manual](Arrays/AnagramCheckManualSol.py) solutions - [Array Pair Sum](Arrays/ArrayPairSumSol.py): Find pairs that sum to $k$ -- [Find Missing Element](Arrays/): [XOR](Arrays/ArrayFindTheMissingElement_XOR_sol.py), [Brute Force](Arrays/ArrayFindTheMissingElement_brute_force_sol.py), [Hash Table](Arrays/ArrayFindTheMissingElement_hash_table_sol.py), & [Sum](Arrays/ArrayFindTheMissingElement_takingSumandSubtract_sol.py) approaches +- [Find Missing Element](Arrays/): [XOR](Arrays/ArrayFindTheMissingElementXORSol.py), [Brute Force](Arrays/ArrayFindTheMissingElementBruteForceSol.py), [Hash Table](Arrays/ArrayFindTheMissingElementHashTableSol.py), and [Sum](Arrays/ArrayFindTheMissingElementSumSol.py) approaches ### Linked Lists πŸ”— Implementations and problems involving linked structures. -- [Singly Linked List](LinkedLists/SingleLinkedListImple.py) & [Doubly Linked List](LinkedLists/DoublyLinkedListImple.py) +- [Singly Linked List](LinkedLists/SingleLinkedListImple.py) and [Doubly Linked List](LinkedLists/DoublyLinkedListImple.py) - [Cycle Detection](LinkedLists/SinglyLinkedListCycleCheckImple.py): Detect cycles using two pointers (Floyd's algorithm) - [Reverse Linked List](LinkedLists/LinkedListReversal.py): In-place reversal - [Nth to Last Node](LinkedLists/LinkedListNthToLastNode.py): Find the $n$-th node from the end @@ -123,17 +123,17 @@ FIFO (First-In-First-Out) data structures. ### Deque πŸ”„ Double-ended queue operations. -- [Deque Implementation](deque/DequeImple.py): Operations at both ends +- [Deque Implementation](Deque/DequeImple.py): Operations at both ends ### Trees 🌳 Hierarchical data structures. - [Binary Search Tree](Trees/BinarySearchTreesImple.py): Complete BST implementation -- [BST Validation](Trees/): [Solution 1 (In-order)](Trees/BinarySearchTreeCheckImpleSol1.py) & [Solution 2 (Range check)](Trees/BinarySearchTreeCheckImpleSol2.py) -- [Binary Search](Trees/): [Iterative](Trees/BinarySearchImple.py) & [Recursive](Trees/BinarySearchRecursiveImple.py) +- [BST Validation](Trees/): [Solution 1 (In-order)](Trees/BinarySearchTreeCheckImpleSol1.py) and [Solution 2 (Range check)](Trees/BinarySearchTreeCheckImpleSol2.py) +- [Binary Search](Trees/): [Iterative](Trees/BinarySearchImple.py) and [Recursive](Trees/BinarySearchRecursiveImple.py) - [Binary Heap](Trees/BinaryHeapImple.py): Min-heap implementation - [Tree Traversals](Trees/TreeLevelOrderPrintImple.py): Level order (BFS) printing - [Trim BST](Trees/TrimBinarySearchTreeImple.py): Keep nodes within a range -- [Tree Representations](Trees/): [Nodes & References](Trees/TreeRepresentationWithNodesReferences.py) & [List of Lists](Trees/buildTreeTest.py) +- [Tree Representations](Trees/): [Nodes & References](Trees/TreeRepresentationWithNodesReferences.py) and [List of Lists](Trees/BuildTreeTest.py) --- @@ -144,16 +144,16 @@ Algorithms for arranging elements in order. - [Bubble Sort](Sorting/BubbleSortImple.py) - $O(n^2)$ - [Selection Sort](Sorting/SelectionSortImple.py) - $O(n^2)$ - [Insertion Sort](Sorting/InsertionSortImple.py) - $O(n^2)$ -- [Shell Sort](Sorting/ShellSortImple.py) - $O(n \log n)$ +- [Shell Sort](Sorting/ShellSortImple.py) - $O(n^2)$ - [Merge Sort](Sorting/MergeSortImple.py) - $O(n \log n)$ - [Quick Sort](Sorting/QuickSortImple.py) - $O(n \log n)$ average ### Recursion & Dynamic Programming πŸ”€ Solving problems by breaking them into smaller sub-problems. -- [Fibonacci Sequence](Recursion/): [Iterative](Recursion/FibonacciSeqIterative.py), [Recursive](Recursion/FibonacciSeqRecursion.py), & [Dynamic Programming](Recursion/FibonacciSeqDynamic.py) -- [Coin Change Problem](Recursion/): [Recursive](Recursion/CoinChangeProblemRecursion.py) & [Dynamic Programming](Recursion/CoinChangeProblemDynamic.py) -- [String Operations](Recursion/): [Reverse](Recursion/RecursionReverseStr.py) & [Permutations](Recursion/RecursionStrPermutation.py) -- [Math Operations](Recursion/): [Cumulative Sum](Recursion/RecursionCumulativeSum.py) & [Sum of Digits](Recursion/RecursionSumOfDigits.py) +- [Fibonacci Sequence](Recursion/): [Iterative](Recursion/FibonacciSeqIterative.py), [Recursive](Recursion/FibonacciSeqRecursion.py), and [Dynamic Programming](Recursion/FibonacciSeqDynamic.py) +- [Coin Change Problem](Recursion/): [Recursive](Recursion/CoinChangeProblemRecursion.py) and [Dynamic Programming](Recursion/CoinChangeProblemDynamic.py) +- [String Operations](Recursion/): [Reverse](Recursion/RecursionReverseStr.py) and [Permutations](Recursion/RecursionStrPermutation.py) +- [Math Operations](Recursion/): [Cumulative Sum](Recursion/RecursionCumulativeSum.py) and [Sum of Digits](Recursion/RecursionSumOfDigits.py) - [Word Split](Recursion/RecursionWordSplit.py): Dynamic Programming solution ### Graph Algorithms πŸ—ΊοΈ @@ -161,14 +161,14 @@ Algorithms for graph traversal and pathfinding. - [Adjacency List](GraphAlgorithms/AdjacencyListGraphImple.py): Graph ADT implementation - [Breadth First Search (BFS)](GraphAlgorithms/BFS.py): Word Ladder problem - [Depth First Search (DFS)](GraphAlgorithms/DFSGeneral.py): General DFS implementation -- [Knight's Tour Problem](GraphAlgorithms/): [Graph Generation](GraphAlgorithms/TheKnightsTourProblem.py) & [DFS Solution](GraphAlgorithms/DFSImpleTheKnightsTourProblem.py) +- [Knight's Tour Problem](GraphAlgorithms/): [Graph Generation](GraphAlgorithms/TheKnightsTourProblem.py) and [DFS Solution](GraphAlgorithms/DFSImpleTheKnightsTourProblem.py) - [Word Ladder Problem](GraphAlgorithms/WordLadderProblem.py): Building the word ladder graph --- ## ⚠️ Error Handling & Debugging -- [Error and Exceptions](Error-debug/ErrorExceptions.py): Demonstrates `try`, `except`, `else`, and `finally` blocks for robust error handling. +- [Error and Exceptions](ErrorHandling/ErrorExceptions.py): Demonstrates `try`, `except`, `else`, and `finally` blocks for robust error handling. --- diff --git a/Recursion/README.md b/Recursion/README.md index 7265340..17f776c 100644 --- a/Recursion/README.md +++ b/Recursion/README.md @@ -1,21 +1,16 @@ -# Recursion +# Recursion and Dynamic Programming This directory contains Python implementations of problems solved using recursion and dynamic programming. ## Contents -### Fibonacci Sequence -- [Fibonacci (Iterative)](FibonacciSeqIterative.py): Iterative implementation of the Fibonacci sequence. -- [Fibonacci (Recursive)](FibonacciSeqRecursion.py): Simple recursive implementation of the Fibonacci sequence. -- [Fibonacci (Dynamic Programming)](FibonacciSeqDynamic.py): Optimized Fibonacci sequence using memoization. - -### Coin Change Problem -- [Coin Change (Recursive)](CoinChangeProblemRecursion.py): Basic recursive solution to find the minimum number of coins for change. -- [Coin Change (Dynamic Programming)](CoinChangeProblemDynamic.py): Optimized solution to the coin change problem using dynamic programming. - -### Other Recursive Problems -- [Cumulative Sum](RecursionCumulativeSum.py): Computes the cumulative sum from 0 to $n$ recursively. -- [Reverse a String](RecursionReverseStr.py): Reverses a string using recursive calls. -- [String Permutations](RecursionStrPermutation.py): Generates all possible permutations of a given string. -- [Sum of Digits](RecursionSumOfDigits.py): Calculates the sum of all individual digits in an integer recursively. -- [Word Split](RecursionWordSplit.py): Determines if a string can be split into words from a given list. +- [Fibonacci Sequence (Iterative)](FibonacciSeqIterative.py): Iterative implementation of the Fibonacci sequence. +- [Fibonacci Sequence (Recursive)](FibonacciSeqRecursion.py): Recursive implementation of the Fibonacci sequence. +- [Fibonacci Sequence (Dynamic Programming)](FibonacciSeqDynamic.py): Optimized Fibonacci sequence using memoization. +- [Coin Change Problem (Recursive)](CoinChangeProblemRecursion.py): Recursive solution for the coin change problem. +- [Coin Change Problem (Dynamic Programming)](CoinChangeProblemDynamic.py): Optimized dynamic programming solution for the coin change problem. +- [Recursion Reverse String](RecursionReverseStr.py): Reversing a string using recursion. +- [Recursion String Permutation](RecursionStrPermutation.py): Generating all permutations of a string. +- [Recursion Cumulative Sum](RecursionCumulativeSum.py): Calculating the cumulative sum using recursion. +- [Recursion Sum of Digits](RecursionSumOfDigits.py): Calculating the sum of digits of a number using recursion. +- [Recursion Word Split](RecursionWordSplit.py): Splitting a string into words based on a dictionary using recursion and dynamic programming. diff --git a/Sorting/README.md b/Sorting/README.md index 0b76399..81db589 100644 --- a/Sorting/README.md +++ b/Sorting/README.md @@ -5,8 +5,8 @@ This directory contains Python implementations of various sorting algorithms wit ## Contents - [Bubble Sort](BubbleSortImple.py): Implementation of Bubble Sort with $O(n^2)$ complexity. -- [Selection Sort](SelectionSortImple.py): Implementation of Selection Sort, improving on Bubble Sort by making only one exchange per pass. -- [Insertion Sort](InsertionSortImple.py): Implementation of Insertion Sort, maintaining a sorted sublist. -- [Shell Sort](ShellSortImple.py): Implementation of Shell Sort (diminishing increment sort), improving on Insertion Sort. +- [Selection Sort](SelectionSortImple.py): Implementation of Selection Sort with $O(n^2)$ complexity. +- [Insertion Sort](InsertionSortImple.py): Implementation of Insertion Sort with $O(n^2)$ complexity. +- [Shell Sort](ShellSortImple.py): Implementation of Shell Sort with $O(n^2)$ complexity. - [Merge Sort](MergeSortImple.py): A recursive "divide and conquer" algorithm with $O(n \log n)$ complexity. -- [Quick Sort](QuickSortImple.py): Implementation of Quick Sort (partition exchange sort), using divide and conquer in-place. +- [Quick Sort](QuickSortImple.py): Implementation of Quick Sort with $O(n \log n)$ average complexity. diff --git a/Stacks/README.md b/Stacks/README.md index e799a74..27af4d6 100644 --- a/Stacks/README.md +++ b/Stacks/README.md @@ -1,8 +1,8 @@ # Stacks -This directory contains Python implementations of the Stack data structure and its applications. +This directory contains Python implementations of the Stack data structure and related problems. ## Contents -- [Stack Implementation](StackImple.py): Basic implementation of a LIFO (Last-In-First-Out) stack using a Python list. Includes `push`, `pop`, `peek`, `isEmpty`, and `size` methods. -- [Balanced Parentheses Check](BalanceParenthlessCheckImple.py): Uses a stack to check if a string of opening and closing parentheses (round, square, and curly) is balanced. +- [Stack Implementation](StackImple.py): Basic operations for a Stack (push, pop, peek, size). +- [Balanced Parentheses Check](BalanceParenthlessCheckImple.py): Checking if a string has balanced parentheses using a Stack. diff --git a/Trees/buildTreeTest.py b/Trees/BuildTreeTest.py similarity index 100% rename from Trees/buildTreeTest.py rename to Trees/BuildTreeTest.py diff --git a/Trees/README.md b/Trees/README.md index 2047225..0645f90 100644 --- a/Trees/README.md +++ b/Trees/README.md @@ -1,23 +1,16 @@ # Trees -This directory contains Python implementations of various tree-based data structures and algorithms. +This directory contains Python implementations of tree data structures and algorithms. ## Contents -### Binary Search Trees (BST) -- [Binary Search Tree Implementation](BinarySearchTreesImple.py): A comprehensive implementation of a BST with `TreeNode` and `BinarySearchTree` classes, including insertion, deletion, and search. -- [Validate BST (Solution 1)](BinarySearchTreeCheckImpleSol1.py): Validates a BST by performing an in-order traversal and checking if the resulting values are sorted. -- [Validate BST (Solution 2)](BinarySearchTreeCheckImpleSol2.py): Validates a BST by keeping track of the minimum and maximum allowable values for each node. -- [Trim a BST](TrimBinarySearchTreeImple.py): Trims a BST so that all node values fall within a specified range $[min, max]$. - -### Search Algorithms -- [Binary Search (Iterative)](BinarySearchImple.py): Iterative implementation of the binary search algorithm on a sorted list. -- [Binary Search (Recursive)](BinarySearchRecursiveImple.py): Recursive implementation of the binary search algorithm. - -### Heaps -- [Binary Heap Implementation](BinaryHeapImple.py): Implements a min-heap using a recursive approach, including `insert`, `delMin`, and `buildHeap`. - -### Tree Representations & Traversals -- [Nodes and References Representation](TreeRepresentationWithNodesReferences.py): A simple implementation of a binary tree using a class-based nodes and references approach. -- [List of Lists Representation](buildTreeTest.py): Demonstrates building and manipulating a tree using a "list of lists" approach. -- [Tree Level Order Print](TreeLevelOrderPrintImple.py): Prints a binary tree in level order (breadth-first) using a queue, with each level on a new line. +- [Binary Search Tree Implementation](BinarySearchTreesImple.py): Basic operations for a Binary Search Tree (BST). +- [Binary Search Tree Check (In-order)](BinarySearchTreeCheckImpleSol1.py): Validating a BST using in-order traversal. +- [Binary Search Tree Check (Range Check)](BinarySearchTreeCheckImpleSol2.py): Validating a BST using min/max range values. +- [Binary Search (Iterative)](BinarySearchImple.py): Iterative implementation of binary search. +- [Binary Search (Recursive)](BinarySearchRecursiveImple.py): Recursive implementation of binary search. +- [Binary Heap Implementation](BinaryHeapImple.py): Implementation of a binary min-heap. +- [Tree Level Order Print](TreeLevelOrderPrintImple.py): Level-order (BFS) traversal of a tree. +- [Trim a Binary Search Tree](TrimBinarySearchTreeImple.py): Trimming a BST within a given range. +- [Tree Representation (Nodes and References)](TreeRepresentationWithNodesReferences.py): Representing a tree using node objects and references. +- [Build Tree Test](BuildTreeTest.py): A test script for tree building using a list-of-lists approach.