ritikbanger/hacktoberfest2022-dsa

If You know the implementation of any DSA related topic/problem or HackerRank, HackerEarth, LeetCode problems then you can contribute it in this repo. Raise Genuine PRs only. Your PRs will be accepted, keep patience. Star this Repo. You aren't allowed to Update README.md. Create PR and win Swags in hacktoberfest 2022

Hacktoberfest 2022

Link To HacktoberFest 2022

Event details :

• Hacktoberfest is a month-long challenge. It happens every year in the month of October.
• Hacktoberfest is open to everyone and it marks the celebration of Open Source. It's the biggest Open Source event that encourages newbies to participate in Open Source and create their 1st meaningful PR.
• Hacktoberfest will be hosted by Digital Ocean for the 9th year in a row in partnership with GitHub and other companies.
• 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.
• You can sign up anytime between September 26 and October 31.

---

How can you Join?

Step - 1:

Create a GitHub account, if you don't already have one.

Step - 2:

Register for Hacktoberfest: Navigate to the Hacktoberfest registration page and follow the instructions. But, read the rules carefully before you do and then sign In using your GitHub credentials.

Step - 3:

Find good projects worth contributing on the GitHub page. You can type label:hactoberfest is:issue is:open

You can add a language label of your choice to filter open issues. If you are a beginner and can’t find good issues then there’s tag label:good first issue which filters out issues for beginners who want to contribute.

Here's something beginner-friendly for you:

• https://www.firsttimersonly.com/
• https://github.com/mungell/awesome-for-beginners

Step - 4:

Submit PRs: Try and submit at least 4 PRs and wait for it to be verified. Make sure to submit quality PRs.

---

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 40,000 participants who successfully complete the challenge will be eligible to receive a prize.

For your PR to count it must be:

• Submitted in a public repo, AND the PR is labelled as hacktoberfest-accepted by a maintainer. or
• Submitted in a repo labelled hacktoberfest , AND Merged, OR Approved
• You can opt not to receive a t-shirt and stickers and you can choose to have a tree planted in your name and help make Hacktoberfest 2022 more carbon neutral.

---

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.

---

Join Discord Conversation

---

Rules To Contribute To This Repo

• You can write solutions in C/C++/Java for Data Structure and Algorithms.
• Follow file naming convention for all your pull requests.
• While adding any content it should be inside its appropiate directory
• if there is any problem with inaccurate solution create an issue!

file naming convention

use	file type	comments
questions	README.md	all questions of particular topic are mentioned in a README.md file inside the sub topic folder
C++ solutions	[topic name].cpp	solution C++ code file code to a question is written in same folder where question is mentioned
algorithm solution	[topic name]-algorithm.txt	algorithm solution to a question is written in a .txt txt file in same folder where question is mentioned

Things you can contribute to

• Repo contain folders of all the data structures and algorithms topics with some pre-addressed questions. You can add a solution to a question ( present in the readme of particular topic folder) that is unanswered.
• you can update existing solution with a better one ( better complexity).
• Participants can even add new questions and solutions of their interest.
• solve issues raised by other people or yourself.
• make webpage ( hosted from GitHub readme ) more appealing and updated.
• Well-documented source code with detailed explanations provides a valuable resource for educators and students alike.

Steps For Contribution

1. Fork this repo
2. Star this repo
3. Add a file ( txt/cpp ) inside appropriate folder
4. commit the code
5. Make pull request

---

FEATURES

1. Beginner-friendly
2. Targeted for developers, content writers, and programming enthusiasts.
3. Would also help participants who are not familiar with development but are eager to participate in open source.

---

Materials

• GFG learn C++
• DSA ALL TOPICS
• DSA Complete Tutorial

---

Connect with me

You can follow me on Github here:

   

---

if (isAwesome) {
  // thanks in advance :p
  starThisRepository();
}

---

  _____ _                 _     __   __
 |_   _| |__   __ _ _ __ | | __ \ \ / /__  _   _
   | | | '_ \ / _` | '_ \| |/ /  \ V / _ \| | | |
   | | | | | | (_| | | | |   <    | | (_) | |_| |
   |_| |_| |_|\__,_|_| |_|_|\_\   |_|\___/ \__,_|

---

hacktoberfest2022-dsa's Issues

Morris Traversal on Binary Tree

Morris Traversal on Binary Tree
Details:

Morris Traversal on Binary Trees. Allows tree traversals like inorder, preorder and postorder to run in constant space.
Time Complexity: O(N)
Space Complexity: O(1)

Please move this file to leetcode folder.

    Please move this file to leetcode folder.

Originally posted by @ritikbanger in #14 (review)

Sir completed your requested changes.
Please merge my request.

Weird algorithm question from CSES problem set, Based on recursion

I think this question should be in this list , please assign me this under Hacktoberfest. Thank you

#371

I would like to add kadane's algorithm problem in JAVA

Sieve of Eratosthenes to find prime numbers in c++

Want to add Sieve of Eratosthenes approach for finding prime numbers between 2 numbers in C++, pls assign me this issue

elements of matrix in the spiral order

would be great if you could assign me to add this issue was asked the same question in the microsoft intern interview..

Tower of Hanoi

I'd like to add Tower of Hanoi mathematical puzzle problem, the code is written in C

Union of two arrays in CPP

@ritikbanger I want to add a code for Union of two Arrays in CPP as Hacktoberfest2022 Contribution. Please assign me this issue.

Longest Common Subsequence

This question should in the given list. Please assign me this issue

Vertical Order Traversal of a Binary Tree

hi,
During interview, Interviewer asked me Vertical Order Traversal of a Binary Tree Question.
At that time, I little bit stuck and completed.
So, I requested you please add this solution which comes under Tree Topic

`Given the root of a binary tree, calculate the vertical order traversal of the binary tree.

For each node at position (row, col), its left and right children will be at positions (row + 1, col - 1) and (row + 1, col + 1) respectively. The root of the tree is at (0, 0).

The vertical order traversal of a binary tree is a list of top-to-bottom orderings for each column index starting from the leftmost column and ending on the rightmost column. There may be multiple nodes in the same row and same column. In such a case, sort these nodes by their values.

Return the vertical order traversal of the binary tree.`

Find triplets with zero sum, using sliding window.

I think this question should be in the array list. Please assign me this under Hacktoberfest.
I have already sent a PR related to it, please merge it.
Thank you
@ritikbanger

Flatten binary tree to linked list in c++

I want to con

Modular Exponentiation

I would like to add Modular Exponentiation algortihm as a contribution for the Hacktober Fest 2022, as it is a very useful algo.
Could you assign it to me

Trapping Rainwater (Leetcode)

Validate binary search tree

I will be happy to work on this problem. Please assign this to me.

Triangle Pyramid in C++

Triangle Pyramid in C++

I want to add 25 C++ pattern Questions+Solution

Longest Substring without repeating characters

this question should be in this list , please assign me this under Hacktoberfest. Thank you

Minimum Falling Path Sum- Dynamic programming

I want to submit a cpp code for the above problem

Swap nodes in a Linked List

D.N.F sort in C.Can I do it?

Your Repo Code for checking a prime number can be made faster (link for your code is in description)

Hello @Ritik-Banger-Biz4group,
https://github.com/ritikbanger/Hacktoberfest2022-DSA/blob/main/Prime%20Number%20finder

This code is not optimised much, it's time complexity can be reduced from O(N/2) to O((√N)/2) which will be way more faster and also easy to read and understand like this one.
May u please assign me to optimise it.

I will run a loop from i=3 to sqrt(N) and doing I+=2 every time and check n%2 also at the end, resulting in lesser iterations and saving time.

Kadane's Algorithm in C++

I want to contribute to this issue. Please assign it to me @ritikbanger

Clone a Linked List using random pointers

UTF-8 Validation

Given an integer array data representing the data, return whether it is a valid UTF-8 encoding (i.e. it translates to a sequence of valid UTF-8 encoded characters).

A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:

--> For a 1-byte character, the first bit is a 0, followed by its Unicode code.
--> For an n-bytes character, the first n bits are all one's, the n + 1 bit is 0, followed by n - 1 bytes with the most significant 2 bits being 10.

x denotes a bit in the binary form of a byte that may be either 0 or 1.

Note: The input is an array of integers. Only the least significant 8 bits of each integer is used to store the data. This means each integer represents only 1 byte of data.

Triangle Pyramid in C++

Triangle Pyramid in C++

I added this question bag-of-tokens , it should be in the list of array questions

Planet Queries I (CSES) in C++

I want to add this problem under the graphs section.
This problem has a beautiful use of the Binary lifting concept on graphs.
CSES problem set has very less good solutions present on the web.

Can you please assign this issue to me @ritikbanger under hacktober fest 2022.

Gray code in bit magic

I want to add the gray code problem and solution(c++) in bit manipulation. Please assign it to me under hacktoberfest 2022. @ritikbanger

Stack using Linked List

Want to add code of stack implementation using Linked list in java and cpp. Pls assign this issue to me.

KMP Algorithm

Add HOLIDAY ACCOMODATION problem solution from SPOJ on graphs section

Hi, I can a solution to a famous problem HOLI from SPOJ. Can you assign this issue to me?

Boyer moore algorithm implementation in C++

LEETCODE CONTEST questions

I have some Questions description with my solution which are asked in leetcode contest

Updating modulo multiplicative inverse to logarithmic complexity instead of linear.

Presently the code for modulo multiplicative inverse is written in linear complexity on mod. But it can be calculated using extended eucledian algorithm in logarithmic complexity.

Please assign this task to me.

Code are only in Python and need a C++ version with proper comments

Can you please assign this issue to me with hacktober-accepted label. I am willing to solve the issue and contribute to the repository.

Josephus problem recursion in C++

code for Josephus problem

I want to add my python project.can I do it?

Longest subarray with sum divisible by K

Please assign this issue to me.

Knight,s Tour

added junk file organizer

i have written a program to organize the junk file using python.
allow me to contribute.

Longest Increasing Subsequence II (Leetcode) in C++

This is a recent leetcode weekly contest hard problem.
Usually, LIS is solved using DP ( O(n^2) Solution ).
In this problem, we could only take elements with differences not more than K and we have to find the longest increasing subsequence.
Constraints are such that we can not use O(n^2) DP approach and we can not as well use binary search optimization of LIS.
So, the Solution is based on Range Max Queries using segment Trees.
Time Complexity of solution: O(nlog(maximum element in the array))*
This solution is accepted on leetcode.

Can you please assign it to me @ritikbanger under hacktober fest tag.

Contains Duplicate

You are given an integer array nums and two integers indexDiff and valueDiff.

Find a pair of indices (i, j) such that:

i != j,
abs(i - j) <= indexDiff.
abs(nums[i] - nums[j]) <= valueDiff, and
Return true if such pair exists or false otherwise.