harsh-dart / harsh-hacktoberfest2021

This is for hacktoberfest 2021

Hacktoberfest 2021

---

Link To HacktoberFest 2021

Event details :

• Hacktoberfest® is open to everyone in our global community. Whether you’re a developer, student learning to code, event host, or company of any size, you can help drive growth of open source and make positive contributions to an ever-growing community. All backgrounds and skill levels are encouraged to complete the challenge.

• Hacktoberfest is a celebration open to everyone in our global community.

• Pull requests can be made in any GitHub-hosted repositories/projects.

• You can sign up anytime between October 1 and October 31.

HacktoberFest Rules :

To earn your Hacktoberfest tee or tree reward, you must register and make four valid pull requests (PRs) between October 1-31 (in any time zone). Pull requests can be made in any participating GitHub or GitLab hosted repository/project. Look for the 'hacktoberfest' topic to know if a repository/project is participating in Hacktoberfest. Pull requests must be approved by a maintainer of the repository/project to count. If a maintainer reports your pull request as spam or behavior not in line with the project’s code of conduct, you will be ineligible to participate. This year, the first 55,000 participants who successfully complete the challenge will be eligible to receive a prize.

---

Whether it’s your first or fiftieth pull request, there’s always more to learn! We’ve put together a few resources that can help you create quality pull requests, keep your repositories pristine, and build on your open source knowledge.

Rules To Contribute To This Repo

• Use any language.
• C, C++, JAVA, Data Structure and Algorithms, HTML, CSS, Android Projects.
• Go to the particular folder or (make a folder for your language if it doesnt pre-exist)
• Contribute Anything valuable.

Steps For Contribution

1. Fork this repo
2. Star this repo
3. Add a file
4. commit the code
5. Make pull request

---

Thank You

harsh-hacktoberfest2021's Issues

Merge Sort implementation in Java

kth smallest element in array

Find kth smallest element in array.

Find element in an array

1.You are given a number n, representing the size of array a.
2.You are given n distinct numbers, representing elements of array a.
3. You are given another number d.
4. You are required to check if d number exists in the array a and at what index (0 based). If found print the index, otherwise print -1.

Missing in Natural number

Even_Odd problem

Write a program to find even and Odd of the given number.

Binary Search

Please accept my PR

    Please accept my PR

Originally posted by @SoubhagyaKumaNayak in #180 (comment)

Remove Linked list Elements

ques link-https://leetcode.com/problems/remove-linked-list-elements/
Input: head = [1,2,6,3,4,5,6], val = 6
Output: [1,2,3,4,5]

Armstrong Number

Write program to check weather the number is armstrong number or not.

Prime Number

Write the program to find weather the given number is prime or not.

Kadane's Algorithm

Find maximum sub-array using kadane's algorithm.

Fibonacci series