asci-coep / hacktoberfest

COEP's Hacktoberfest Repository

COEP's Hacktoberfest Repository

Update [2020]

While our initial aim was to give some Git hands-on practice to undergraduate students with Hacktoberfest incentives, we understand their decision to have only organic open source contributions count towards Hacktoberfest's 4 pull requests requirement. Hence, contributions to this repository won't count starting 2020. We are keeping this repository alive as a record of participation.

Introduction

Hacktoberfest is a month-long celebration to encourage developers to use and contribute to open source projects. Continuing with the tradition, this year hacktoberfest is happening from 1st to 31st October, 2019.

Details

By contributing to open source, in terms of 4 pull requests, you get a limited edition hacktoberfest T-shirt and stickers shipped to your address by Digital Ocean.

How can I participate?

This repository is for you to practice contributing to open source projects and earn a hacktoberfest T-shirt in the process. Write an implementation of your favorite algorithm in the programming language of your choice and submit a pull request to this repository. If you need any ideas, check out the issues page!

Issues page is just for your reference. You are encouraged to submit implementation of your choice of algorithm in any programming language.

Simultaneously, register yourself on the Hacktoberfest Website. Click on the 'Start Hacking' button and fill in the required details. When you complete 4 pull requests, get ready for an awesome hacktoberfest T-shirt for you to show-off!

Steps to follow

1. Create an empty directory in your local system and cd into it

mkdir open_source
cd open_source

2. Initialize an empty git repository

git init

This command initializes your directory for git version control

3. Fork this repository by clicking on the 'Fork' button

4. Clone the forked repository in the directory you just made

git clone https://github.com/<your-github-username>/hacktoberfest.git

5. cd into the project repository and adding your implementation of your favorite algorithm in the programming language of your choice.

cd hacktoberfest
cd Sorting
vim/subl/gedit/nano my-awesome-algorithm.c/.cpp/.java/.py

6. Commit your changes

git add my-awesome-algorithm.c/.cpp/.java/.py
git commit -m "Add an implementation of my awesome algorithm in Python"

Here are some guidelines on how to write a great commit message.

7. Push your commits

git push

This will prompt you to enter your github credentials for a successful push.

8. Create your first Pull Request!

Go to 'Pull requests' tab of your forked repository
Click on 'New pull request'
Compare your changes
Create the pull request

Github Tutorials

Although this should get you going, here are some awesome tutorials to help you create your first PR!

• An Introduction to Open Source
• How to Create A Pull Request on Github
• Github's Resources for Beginners
• Udacity's Blog
• Atlassian's Git Tutorial

Happy Hacking!

hacktoberfest's Issues

Implement a program to print pascal's triangle

An optimized implementation is preferred

Merge the implementation of Hardy Ramanujan Algorithm in Python.

The theorem states and proves that the number of prime factors of n will approximately be log(log(n)) for most natural numbers n. #136

Find if a number is a perfect number or not.

A number is perfect if, the sum of its positive divisors excluding the number itself is equal to that number.

Convert the string to upper case without using the inbuild functions.

Implement Sieve of Eratosthenes in Python

Given a number n as input, implement a program to print all primes less than n, using Sieve of Eratosthenes in Python

Implement a program that checks for loops in singly linked lists

Implement a function which when given head pointer to a singly linked, (ideally) null-terminated list checks for the presence of a loop inside the list.

Write a sample use of the checker function in the main function of your program. Also, specify the data structure used for the list.

Implement a program to find Primitive Pythagorean Triads.

Eg:

a= 3 b= 4 c= 5
a= 5 b= 12 c= 13
a= 8 b= 15 c= 17
a= 7 b= 24 c= 25
a= 20 b= 21 c= 29
a= 12 b= 35 c= 37
a= 9 b= 40 c= 41

Implement quicksort in C

Implement quicksort in C, placing the code in Sorting/ directory

Implement a program to find the value of nCr given n and r

Implement a program that finds out modular multiplicative inverse using Extended Euclidean Algorithm

Implement KMP String Matching Algorithm in C

Implement the KMP string/pattern matching algorithm by Knuth-Morris-Pratt in C

Implement a program to check if a string is palindrome or not in C++

Write a program to convert a decimal integer to its binary, hex and octal equivalent in C

Given a decimal integer as input, write a program that outputs its binary, hex and octal equivalent.

Implement a program that prints preorder, inorder and postorder traversal of a tree

Implement a function which when given an entry point to a tree, prints its preorder, inorder and postorder traversal.

Write a sample use of the checker function in the main function of your program. Also, specify the data structure used for the tree.

Hint: Use recursion for succinct code. For the really adventurous, try doing the same iteratively (you will need to use a stack).

Pull requests here won’t count toward Hacktoberfest.

Hi there,

Thank you for your interest in Hacktoberfest and in helping others make their first contributions to open source.

While we agree that it's important to help others, this repository does not do this in a way that is in line with the Hacktoberfest values. Please read the part that talks about high-quality contributions to understand why we are reaching out and taking action. Due to this, we've added this repository to the list of excluded repositories which means pull requests here will not count toward Hacktoberfest 2020.

This is not a DigitalOcean decision, it's one that is inspired by the community of maintainers and contributors who all agree that quality is more important than quantity when it comes to engagement in the Open Source community. The values remind us to shift the focus from contributions to repositories that encourage folks to quickly create and gain a pull request to contributions that will help people level-up their skills and contribute to open-source projects that are in need of help.

If you feel that this repository is an effective learning resource, we encourage you to keep running it since a core part of the aim for Hacktoberfest is to encourage new folks to get involved with open-source.

However, if you are interested in having contributions to this repo count toward Hacktoberfest we encourage you to take a look at this list of Hacktoberfest issues for inspiration and make the necessary changes to focus on enabling people to make meaningful contributions to open source projects.

If you have any questions about this or participating in Hacktoberfest, please contact our team via email [email protected] or join our community Discord server.

Happy Hacking,
The Hacktoberfest Team

Hacktoberfest is presented by DigitalOcean, Intel and DEV.

Implement a program that counts number of characters, words, whitespaces and lines in a file in Python

Preference - Implementation in a pure 'Pythonic' way

Implement the Queue data structure and its associated functions in C++

Single Linked List in C language

I want to add code to implement Single Linked List in C language.

Can I go ahead in working with this?

Write a program that functions like Unix utility 'cat' - read a file and print its content on stdout in C

Hint: Use C's getc() function and EOF signal. This makes code succinct.

Implement a program that solves the tower of hanoi puzzle using recursion

Implement Single and Double Columnar Transposition Cipher in Python