LogicBuilding101

• Welcome to LogicBuilding101, a curated collection of 101+1 must-do problems designed to build your programming logic from scratch.
• This repository serves as a foundational resource for anyone who wants to sharpen their problem-solving skills before diving into Data Structures and Algorithms (DSA).

Overview

• This repository is structured to take you on a journey from the basics of programming to slightly advanced concepts, focusing on logic-building exercises.
• Over 34 days, with a daily commitment of solving 3 problems, you can develop a strong programming foundation.

Problem Categories

1. Basic Math Problems
2. Basic Patterns
3. Intermediate Math Problems
4. Medium Patterns
5. Arrays
6. Matrix
7. Strings
8. Objects
9. Basic Recursion

Why LogicBuilding101?

• Develop core programming skills.
• Understand basic and intermediate concepts of programming.
• Lay a strong foundation for DSA preparation.
• Practice a diverse set of problems from simple math to recursion.

Repository Structure

The repository is divided into daily problem sets, with each day containing 3 problems:

LogicBuilding101/
├── Day01/
│   ├── Questions.md
│   ├── Solutions.js
├── Day02/
│   ├── Questions.md
│   ├── Solutions.js
...
├── Day34/
│   ├── Questions.md
│   ├── Solutions.js

Questions File Structure

Each Questions file contains:

• Problem Name: The title of the problem.
• Description: A detailed explanation of the problem.
• Input/Output: Sample input and output examples.

How to Use This Repo

1. Clone the repository:

   git clone https://github.com/upendhar10/LogicBuilding101.git

2. Start with Day 1 and progress at your own pace.

3. Solve the problems in your preferred programming language.

4. Check your logic and solutions with the provided examples.

Acknowledgments

• A huge thanks to the programming community for inspiring this project. Let's build a strong foundation together!

• If you found this repo valuable, don't forget to STAR this repo. Thanks in advance!

License

This project is licensed under the MIT License. Feel free to use and share!