This repository contains a collection of algorithms, data manipulation tools, data structures, miscellaneous utilities, number operations, security tools, and text processing utilities. These tools are designed to assist developers in implementing various functionalities more efficiently.
- Graph Traversals: Implementations for various graph traversal techniques.
- Kadane's Algorithm: An algorithm to find the maximum subarray sum.
- Shortest Path Finder: Algorithms to find the shortest path in graphs.
- Tree Traversals: Methods for pre-order, in-order, and post-order tree traversals.
- Combination Generator: Generate combinations of elements.
- Currency Converter: Convert amounts between different currencies.
- Data Sorter: Sorting data based on multiple algorithms.
- Date Converter: Convert dates between different formats.
- Array Resizer: Dynamically resize arrays.
- AVL Tree Manager: Perform operations on AVL trees.
- BinarySearchTreeManager: Manage binary search trees.
- CircularLinkedListManager: Implement and manage circular linked lists.
- Next Permutation Finder: Find the next lexicographical permutation.
- Number Swapper: Swap numbers using various methods.
- Base Converter: Convert numbers between different bases.
- Bit Manipulator: Perform bit-level operations on numbers.
- Factorial Calculator: Compute the factorial of numbers.
- Credit Card Validator: Validate credit card numbers.
- Cycle Detector: Detect cycles within data structures.
- Data Encryptor: Encrypt data using various algorithms.
- Anagram Checker: Check if two strings are anagrams.
- Expression Evaluator: Evaluate mathematical expressions.
- Levenshtein Distance Calculator: Compute the distance between strings.
To use this library, clone this repository and import the necessary modules into your project.
git clone <repo_url>Contributions are welcome. Please fork the repository and submit a pull request with your changes.
This project is licensed under the MIT License - see the LICENSE.md file for details.