📚 DSA Study Hub

Live Demo: https://dsa-hub-eosin.vercel.app/

📚 DSA Study Hub

Master Data Structures & Algorithms with Interactive Simulations

🔴 Live Demo | 🐛 Report Bug | ✨ Request Feature

---

📖 Overview

DSA Study Hub is an interactive educational web application designed to bridge the gap between theory and practice. It helps students master Data Structures and Applications (DSA) by providing a modern interface where users can view C source code for standard laboratory programs and run interactive simulations of those algorithms directly in the browser.

📸 Gallery

🏠 About Me & Portfolio	⚙️ Program Simulator
📍 Path Finder Visualizer	📊 Sorting Algorithms

📐 System Design for DSA

---

🚀 Features

• 🎮 Interactive Simulations: Visualize logic (Stack operations, Graph traversals, Pathfinding) without needing a compiler.
• 💻 Code Repository: Access full, copy-ready C source code for 12+ standard DSA programs.
• 🎨 Modern UI/UX:
  • Dark/Light Mode toggle for comfortable reading.
  • Responsive Design built with Tailwind CSS.
  • Copy-to-Clipboard functionality for instant usage.
• 👨‍💻 Integrated Portfolio: A dedicated section to showcase student/developer details.

🛠️ Tech Stack

Component	Technology
Frontend	React (v18+)
Language	TypeScript
Build Tool	Vite
Styling	Tailwind CSS
Icons	Lucide React

---

📂 Included Programs

The application includes simulations and source code for the following curriculum:

ID	Topic	Description
1	Weekly Calendar	Struct usage and dynamic memory allocation.
2	String Operations	Pattern matching and replacement algorithms.
3	Stack Operations	Push, pop, overflow checks, and palindrome validation.
4	Expression Conversion	Infix to Postfix conversion logic.
5a	Postfix Evaluation	Mathematical evaluation of postfix expressions.
5b	Tower of Hanoi	Recursion visualization.
6	Circular Queue	Array-based queue implementation.
7	Singly Linked List	Student data management (Insert/Delete/Display).
8	Doubly Linked List	(Placeholder/Coming Soon)
9	Polynomials	Addition and evaluation using Linked Lists.
10	Binary Search Tree	Creation, Traversals (In/Pre/Post), and Search.
11	Graph Algorithms	BFS (Breadth-First) and DFS (Depth-First) search.
12	Hashing	Hash table implementation with linear probing.

---

⚡ Getting Started

Follow these steps to run the project locally on your machine.

Prerequisites

• Node.js (v16 or higher)
• npm (Node Package Manager)

Installation

1. Clone the repository

   git clone [https://github.com/yourusername/dsa-study-hub.git](https://github.com/yourusername/dsa-study-hub.git)
   cd dsa-study-hub

2. Install dependencies

   npm install

3. Run the development server

   npm run dev

4. Open in Browser Click the link shown in the terminal (usually http://localhost:5173) to view the app.

---

🎨 Customization Guide

Changing the Profile Image

To update the image in the "About Me" section:

1. Place your image file (e.g., profile.jpg) in the src/ folder.
2. Open src/App.tsx.
3. Import the image at the top:

   import profilePic from './profile.jpg';

4. Find the <img> tag in the About section and update the src:

   <img src={profilePic} alt="Profile" ... />

Adding New Programs

To add a new program (e.g., Program 13):

1. Add the C code to the C_CODE dictionary in src/App.tsx.
2. Add a new entry to the programs array in the menu.
3. Add a state handler (e.g., handleProgram13Input) for the interactive logic.
4. Add a render block in the return statement to display the UI.

---

🤝 Contributing

Contributions are welcome! If you have better C code examples, want to improve the simulations, or fix a bug:

1. Fork the Project.
2. Create your Feature Branch (git checkout -b feature/AmazingFeature).
3. Commit your Changes (git commit -m 'Add some AmazingFeature').
4. Push to the Branch (git push origin feature/AmazingFeature).
5. Open a Pull Request.

📄 License

This project is licensed under the MIT License - see the LICENSE file for details.

---

Happy Coding! 🚀
_{Made with ❤️ by Rohith R}