Welcome to our Hacktoberfest 2025 repository! This is a beginner-friendly collection of Programming implementations in multiple programming languages. Whether you're a seasoned developer or just starting your coding journey, this repository is perfect for contributing to open source during Hacktoberfest.
Hacktoberfest is a month-long celebration of open source software run by DigitalOcean. During October, you can participate by making meaningful contributions to open source projects and earn limited edition swag!
This repository contains implementations of various Programming problems in multiple programming languages. It's designed to help beginners learn and contribute to open source while practicing their coding skills.
- Java ☕
- Python 🐍
- JavaScript 🟨
- TypeScript 🔷
- C++ ⚡
- C# 🔵
- Go 🐹
- Rust 🦀
- A GitHub account
- Git installed on your machine
- Basic knowledge of any programming language listed above
-
Fork the repository 🍴
git clone https://github.com/YOUR_USERNAME/Hacktoberfest-Beginners.git cd Hacktoberfest-Beginners -
Choose a problem 📝
- Pick any programming problem
- Check if it's already implemented in your preferred language
- If not implemented, you can add it!
-
Create your solution 💻
- Navigate to the appropriate language folder
- Create a new file with a descriptive name
- Follow the naming convention:
ProblemName.extension - Example:
TwoSum.java,BinarySearch.py,LinkedList.js
-
Code Style Guidelines ✨
- Write clean, readable code
- Add comments explaining your approach
- Include time and space complexity in comments
- Follow language-specific best practices
- Use meaningful variable names
-
Commit and Push 📤
git add . git commit -m "Add [Problem Name] solution in [Language]" git push origin main
-
Create a Pull Request 🔄
- Go to the original repository
- Click "New Pull Request"
- Describe your contribution
- Submit the PR!
When creating a PR, please include:
## Description
Brief description of the algorithm/data structure implemented
## Language
- [ ] Java
- [ ] Python
- [ ] JavaScript
- [ ] TypeScript
- [ ] C++
- [ ] C#
- [ ] Go
- [ ] Rust
## Problem
- [ ] Two Sum
- [ ] Binary Search
- [ ] Linked List Operations
- [ ] Tree Traversal
- [ ] Sorting Algorithms
- [ ] Dynamic Programming
- [ ] Graph Algorithms
- [ ] Other (please specify)
## Time/Space Complexity
- Time Complexity: O(?)
- Space Complexity: O(?)
## Additional Notes
Any additional information about your implementationHacktoberfest-Beginners/
├── Java/ # Java implementations
├── Python/ # Python implementations
├── JavaScript/ # JavaScript implementations
├── TypeScript/ # TypeScript implementations
├── CPP/ # C++ implementations
├── C#/ # C# implementations
├── Golang/ # Go implementations
├── Rust/ # Rust implementations
├── LICENSE # MIT License
└── README.md # This file
- Two Sum
- Maximum Subarray (Kadane's Algorithm)
- Valid Parentheses
- Longest Common Prefix
- Container With Most Water
- Reverse Linked List
- Merge Two Sorted Lists
- Detect Cycle
- Remove Duplicates
- Binary Tree Traversal (Inorder, Preorder, Postorder)
- Binary Search Tree Operations
- Path Sum
- Course Schedule (Topological Sort)
- Binary Search
- Merge Sort
- Quick Sort
- Bubble Sort
- Selection Sort
- Fibonacci Series
- Longest Common Subsequence
- Knapsack Problem
- Climbing Stairs
Contributors will be recognized in our CONTRIBUTORS.md file. Make sure to add your name and GitHub profile when you make your first contribution!
This project is licensed under the MIT License - see the LICENSE file for details.
Please read our Code of Conduct before contributing.
If you have any questions or need help:
- Open an issue on GitHub
- Join our discussions
- Check out the Hacktoberfest website for general guidelines
Remember, every contribution matters, no matter how small! Whether you're fixing a typo, adding a new algorithm, or improving existing code, your contribution helps the community grow.
Let's make this Hacktoberfest amazing together! 🚀