30-Days-Of-Python
by AsabenehThe 30 Days of Python programming challenge is a step-by-step guide to learn the Python programming language in 30 days. This challenge may take more than 100 days. Follow your…
全栈增长工程师实战
This is the project's own description from GitHub — we show it as-is rather than inventing details.
This project is listed under Full-Stack Applications in Web Development, a category made for website owners, freelancers, startups and web developers.
Do I need coding knowledge? Coding Knowledge Recommended. (Estimate based on project type: A developer tool/library — setup usually follows the README with basic coding skills. Always confirm from the repo's README.)
The source code is released under the CC0-1.0 license. Open-source licenses like this usually allow free use, including commercial use — but always read the actual license file in the repository before relying on it. Note: the code being free does not mean hosted services, APIs or infrastructure around it are free.
Activity level: Quiet · Last code update: 10 Oct 2018 · Created: 23 Mar 2016 · Open issues: 0
Official links: Official Website ↗ · Releases ↗ · Documentation (README) ↗
We never publish installation steps we have not verified — the README above is the source of truth.
⭐ 2481 stars · 🍴 532 forks · 🐛 0 open issues · 💻 Language: HTML · 📄 License: CC0-1.0 · Default branch: gh-pages
The 30 Days of Python programming challenge is a step-by-step guide to learn the Python programming language in 30 days. This challenge may take more than 100 days. Follow your…
The full-stack Vue framework.
Full-stack web application template with FastAPI, React, SQLModel, PostgreSQL, Vite, Tailwind CSS, shadcn/ui, FastAPI Cloud, and Docker Compose.
🕸️ Web apps in pure Python 🐍
A 100% free modern JS SaaS boilerplate (React, NodeJS, Prisma). Full-featured: Auth (email, google, github, slack, MS), Email sending, Background jobs, Landing page, Payments…
🤖 A client-first, server-capable, fully type-safe router and full-stack framework for the web (React and more).