Skip to content

codexshami/FullStackPython

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation


Typing SVG





AT A GLANCE

Problems Topics Languages Difficulty Status
840+ 42 Python · C++ · JS Easy to Hard 100% Done

WHAT'S INSIDE EVERY FILE

PROBLEM FILES

  Descriptive Title
  Detailed Problem Statement
  Input and Output Formats
  Constraints and Limits
  Example Walkthroughs
  Edge Cases

SOLUTION FILES

  High-Level Approach
  Step-by-Step Logic
  Big O Analysis — Time and Space
  Optimized Python Code
  Inline Code Comments
  Beginner-Friendly Breakdown

REPOSITORY STRUCTURE

dsa-solutions/
┃
┣━━ 01_Array_and_List/
┃   ┣━━ Problems/
┃   ┃   ┣━━ problem01.md
┃   ┃   ┣━━ problem02.md
┃   ┃   ┗━━ ... problem20.md
┃   ┗━━ Solutions/
┃       ┣━━ solution01.md
┃       ┣━━ solution02.md
┃       ┗━━ ... solution20.md
┃
┣━━ 02_Linked_List/
┣━━ 03_Stack_and_Queues/
┣━━ ... (42 topics total)
┃
┗━━ README.md

PROGRESS OVERVIEW

TOTAL   ████████████████████████████████████████   840 / 840   [100%]

TOPICS COVERED

— Core Data Structures and Algorithms —

# Topic Progress Status
01 Array and List ████████████ 20/20 done
02 Linked List ████████████ 20/20 done
03 Stack and Queues ████████████ 20/20 done
04 Trees ████████████ 20/20 done
05 Heaps ████████████ 20/20 done
06 Sorting and Searching ████████████ 20/20 done
07 Matrix ████████████ 20/20 done
08 String ████████████ 20/20 done
09 Hash ████████████ 20/20 done
10 Sliding Window ████████████ 20/20 done
11 Two Pointer ████████████ 20/20 done
12 Recursion ████████████ 20/20 done
13 Backtracking ████████████ 20/20 done
14 Dynamic Programming ████████████ 20/20 done
15 Graphs ████████████ 20/20 done
16 Greedy Algorithm ████████████ 20/20 done
17 Bit Manipulation ████████████ 20/20 done
18 Divide and Conquer ████████████ 20/20 done
19 Mathematical Problems ████████████ 20/20 done
20 Geometrical Problems ████████████ 20/20 done

— Advanced Topics —

# Topic Progress Status
21 Advanced Data Structures ████████████ 20/20 done
22 Advanced String ████████████ 20/20 done
23 Advanced Mathematics ████████████ 20/20 done
24 Advanced Problems ████████████ 20/20 done
25 Competitive Programming ████████████ 20/20 done

— Programming and Software Engineering —

# Topic Progress Status
26 OOP ████████████ 20/20 done
27 Advanced Python Concepts ████████████ 20/20 done
28 Functional Programming ████████████ 20/20 done
29 Basics ████████████ 20/20 done
30 Concurrency and Multithreading ████████████ 20/20 done

— Core Computer Science —

# Topic Progress Status
31 System Design ████████████ 20/20 done
32 Databases ████████████ 20/20 done
33 Networking ████████████ 20/20 done
34 Security ████████████ 20/20 done
35 Testing and Debugging ████████████ 20/20 done

— Data and Development —

# Topic Progress Status
36 Data Science ████████████ 20/20 done
37 Machine Learning ████████████ 20/20 done
38 Web Development ████████████ 20/20 done
39 Game Development ████████████ 20/20 done

— Real-World and Miscellaneous —

# Topic Progress Status
40 Real World Applications ████████████ 20/20 done
41 Real World Problems ████████████ 20/20 done
42 Miscellaneous ████████████ 20/20 done

TECH STACK


ACHIEVEMENTS

┌──────────────────────────────────────────────────────────────────┐
│                                                                   │
│   840+ problems solved across 42 diverse topics                  │
│   Complete DSA + Core CS + Dev domains in one repository         │
│   Optimized solutions with Big O analysis for every problem      │
│   Real-world scenarios mapped to core coding patterns            │
│   Production-style, well-commented Python throughout             │
│   Interview-ready coverage from Easy to Hard difficulty          │
│                                                                   │
└──────────────────────────────────────────────────────────────────┘

GETTING STARTED

Clone the repository

git clone https://github.com/codexshami/dsa-solutions.git

Navigate into the project

cd dsa-solutions

Browse any topic folder

cd 01_Array_and_List/Problems


HOW TO USE THIS REPO

Step 1 — Pick a topic

topic = "Dynamic Programming"

Step 2 — Read the problem statement

problem = open(f"{topic}/Problems/problem01.md").read()

Step 3 — Attempt the solution yourself first

Step 4 — Compare with the provided solution

solution = open(f"{topic}/Solutions/solution01.md").read()

Step 5 — Study the Big O breakdown and approach

Step 6 — Move to the next problem

print("Repeat until you are unstoppable.")


CONNECT

GitHub   LinkedIn   Portfolio


About

A collection of 850+ DSA problems solved in Python, organized topic-wise for practice and learning.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages