My Programming Practice Library 🚀

Welcome to my competitive programming and algorithm repository! This project serves as a comprehensive collection of various data structures, algorithms, and problem-solving solutions that I have implemented during my practice sessions.

📌 Project Overview

The goal of this repository is to keep track of my progress in competitive programming and to maintain a clean, reusable library of algorithms in C++.

📂 Topics Covered

Here are some of the key areas covered in this repository:

• Number Theory: Divisibility checks, Sieve of Eratosthenes, GCD/LCM, etc.
• Dynamic Programming: Longest Ascending Subsequence (LAS), Longest Increasing Subsequence (LIS), etc.
• Bit Manipulation: XOR properties, bitwise operations, and masks.
• Data Structures: Implementation of trees, graphs, and sets.
• Problem Solutions: Curated solutions for problems from platforms like Codeforces, AtCoder, SPOJ, and CodeChef.

🛠️ Key Files

• divisibility_check.cpp: Implementation of divisibility rules for numbers 1 to 12.
• longest_ascending_subsequence.cpp: A classic O(n log n) solution for LAS.
• important_solutions.txt: A list of curated problem links and their logic.

🚀 How to Use

1. Clone the repository:

   git clone [https://github.com/nasim-dev0459/My-Programming-Practice.git](https://github.com/nasim-dev0459/My-Programming-Practice.git)