Skip to content

Latest commit

 

History

History
103 lines (84 loc) · 4.09 KB

README.md

File metadata and controls

103 lines (84 loc) · 4.09 KB

📝 Daily DSA Practice in Python

Welcome to my DSA (Data Structures and Algorithms) practice repository! 🚀 This repository is dedicated to showcasing my journey of improving my problem-solving skills through consistent practice of DSA questions in Python.

🎯 Goal

My primary goal is to:

  • Enhance Problem-Solving Skills: Build strong problem-solving logic by practicing a wide variety of DSA questions.
  • Consistency is Key: Commit and push my daily progress to this repository to stay consistent and motivated.
  • Prepare for Coding Interviews: Develop a deep understanding of core algorithms and data structures to excel in coding interviews.
  • Share My Journey: Inspire others by sharing my learning path and encourage them to join me in practicing DSA.

📂 Repository Structure

The repository is organized by categories of data structures and algorithms. Each directory contains Python solutions to various problems under that category, with detailed explanations in the code comments.

├── 01. Pattern-Problems
│   ├── Day 1
│   │   └── PatternProblem.py
│   ├── Day 2
│   │   └── PatternProblem.py
│   ├── Day 3
│   │   └── PatternProblem.py
│   └── Day 4
│       └── PatternProblem.py
├── 02. Python-Basics
│   └── Day 5
│       ├── Loops.py
│       └── Simple-Problems.py
├── 03. Basic-Maths-Problems
│   ├── Day 5
│   │   └── 01. extractionOfDigits.py
│   ├── Day 6
│   │   ├── 01. count-digits.py
│   │   ├── 02. reverse-a-number.py
│   │   ├── 03. palindrome-number.py
│   │   ├── 04. armstrong-number.py
│   │   ├── 05. divisors-of-a-number.py
│   │   └── 06. prime-number.py
│   └── Day 7
│       ├── 01. prime-number-logic.py
│       └── 02. greatest-common-factor.py
├── 04. Recursion
│   ├── Day 8
│   │   ├── 01. print-something-n-times.py
│   │   ├── 02. print-linear.py
│   │   ├── 03. print-from-n.py
│   │   ├── 04. print-1-to-n-using-backtracking.py
│   │   └── 05. print-from-n-to-1-using-backtracking.py
│   └── Day 9
│       ├── 01. sum-of-n-numbers-using-recursion.py
│       ├── 02. sum-of-n-numbers-using-backtracking.py
│       ├── 03. factorial-of-n.py
│       ├── 04. reverse-an-array-using-recursion.py
│       ├── 05. reverse-an-array-using-backtracking.py
│       ├── 06. palindrome-string.py
│       └── 07. multiple-recursion-calls.py
└── README.md

🚀 How to Use

  1. Clone the Repository:

    git clone https://github.com/apoorva-info/Data-Structures-and-Algorithms
cd Data-Structures-and-Algorithm
python problem1.py

📈 Progress

Date Problems Solved Topics Covered
Day 1 5 Pattern Problems
Day 2 12 Pattern Problems
Day 3 1 Pattern Problems
Day 4 4 Pattern Problems
Day 5 3 Python Basics, Loops, Simple Problems
Day 6 6 Basic Maths, Digits, Reverse, Prime
Day 7 2 Prime Logic, GCD
Day 8 5 Recursion, Printing Patterns
Day 9 7 Recursion, Sum, Factorial, Palindrome

Updated regularly with new problems and solutions!

🛠️ Technologies Used

  • Language: Python
  • Editor: VS Code, PyCharm
  • Version Control: Git, GitHub

📚 Resources

🤝 Contributions

Feel free to fork this repository, open issues, or submit pull requests. Contributions, suggestions, and improvements are always welcome!