Code Monkey home page Code Monkey logo

sr-sunny-raj / hacktoberfest2021-dsa Goto Github PK

View Code? Open in Web Editor NEW
228.0 5.0 1.0K 53.07 MB

NOTE -: For Hacktoberfest2022 please refer this repository https://github.com/SR-Sunny-Raj/Hacktoberfest2022-for-everyone to make your contribution. If You know the implementation of any DSA related topic/problem 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. Welcoming developers, content writers, and programming enthusiasts.

Home Page: https://sr-sunny-raj.github.io/Hacktoberfest2021-DSA/

License: MIT License

C 8.20% C++ 68.26% Python 9.18% Java 13.26% JavaScript 0.32% HTML 0.14% CSS 0.22% Go 0.02% CMake 0.04% C# 0.36%
hacktoberfest cpp dsa-algorithm java data-structures beginner-friendly python open-source c hacktoberfest-2021 hacktoberfest-accepted hacktoberfest-approved hacktoberfest-event hacktoberfest2021

hacktoberfest2021-dsa's Introduction

image

Hacktoberfest 2021

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 8th 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 October 1 and October 31.

How can you Join?

Step - 1:

Create a GitHub account, if you don't already have one. Need help? Here are some resources to help you set up your GitHub account:

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:

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 55,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 2021 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.



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


Contributors


Connect with me

Sunny's LinkdeIn Sunny's Instagram Sunny's Twitter    



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

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

hacktoberfest2021-dsa's People

Contributors

0904-mansi avatar aasthasingh650 avatar abhijit25mishra avatar adars-h avatar anmolmanocha avatar astroakanksha24 avatar busybee23 avatar cr1spyvada avatar dev7omprakash avatar draconewman avatar gulshanjakhon avatar hellogit2309 avatar i-m-ishika avatar ishabhutto avatar kanakalathavemuru avatar kushal13112001 avatar malyabansalper avatar manish7392 avatar manvii3110 avatar meghagupta19 avatar nihardubey19 avatar pragya7156 avatar pruthvirajjadhav1 avatar rachitgoel19 avatar sagarcode28 avatar sahilsingh2402 avatar sr-sunny-raj avatar suffisme avatar vivekananda99 avatar yashgosaliya avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar

hacktoberfest2021-dsa's Issues

Insertion and search in trie

Is your feature request related to a problem? Please describe.
I want to add insertion and search using trie in trie section

please assign this problem to me.
Thank you

Cycle Detection in Linked List (CPP)

Is your feature request related to a problem? Please describe.
Detect Cycle in Linked List and return start of Cycle if present otherwise return NULL without using extra space.

Language = C++

Please assign this to me
Thank You

Project Excluded

I just created a PR in this project but on the hacktoberfest dashboard it is showing project excluded.

image

LINKED LIST

i want to add new linked list. kindly give me the permission to push.

Add Flattening a Linked List Problem

Problem Statement:-

Given a Linked List of size N, where every node represents a sub-linked-list and contains two pointers:
(i) a next pointer to the next node,
(ii) a bottom pointer to a linked list where this node is head.
Each of the sub-linked-list is in sorted order.
Flatten the Link List such that all the nodes appear in a single level while maintaining the sorted order. 
**Note**: The flattened list will be printed using the bottom pointer instead of the next pointer.

Possible Solution:-

The idea is to use the Merge() process of merge sort for linked lists. We use merge() to merge lists one by one. We recursively merge() the current list with the already flattened list. The down pointer is used to link nodes of the flattened list.

Add Union of two arrays.cpp

I would like to add union of two arrays.cpp solution of Leetcode problem statement.
Please assign me this task.

#602 is my pull request ID.

Merge Two BSTs (C++)

I would like to add a C++ code that optimally merges 2 BSTs in LogN Space and Linear time.

K-Closest point to origin

In this question we will be given points and we need to find the closest point from origin.
Input:-
points = [[3,3],[5,-1],[-2,4]], k = 2

Output:-
[[3,3],[-2,4]]

Nearest smaller no to left

like if we have a array like
arr={2,7,4,8}
we need to find the nearest smaller no for each element in a array.
output:
{-1,2,2,4}

Excluded Project

On the hacktoberfest's website, the project is shown as excluded project.
Please look into the matter....

Dijkstras Algorithm for shortest path in undirected graph

Is your feature request related to a problem? Please describe.
Graph section of the course is missing djistras algorithm for finding shortest path in undirected graph

Describe the solution you'd like
It is among the most essential graph algorithms

@SR-Sunny-Raj I would like to be assigned for this issue. Thankyou

Defense of a Kingdom SPOJ

Theodore implements a new strategy game “Defense of a Kingdom”. On each level a player defends the Kingdom that is represented by a rectangular grid of cells. The player builds crossbow towers in some cells of the grid. The tower defends all the cells in the same row and the same column. No two towers share a row or a column.

The penalty of the position is the number of cells in the largest undefended rectangle. Help Theodore write a program that calculates the penalty of the given position.

Example
Input:
1
15 8 3
3 8
11 2
8 6

Output:
12

Peak Element

I want to contribute to this problem using the Binary search technique.

Minimum number of jumps to reach end

Given an array of integers where each element represents the max number of steps that can be made forward from that element. Write a function to return the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, they cannot move through that element. If the end isn’t reachable, return -1.

Examples:

Input: arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9}
Output: 3 (1-> 3 -> 8 -> 9)
Explanation: Jump from 1st element
to 2nd element as there is only 1 step,
now there are three options 5, 8 or 9.
If 8 or 9 is chosen then the end node 9
can be reached. So 3 jumps are made.

Input: arr[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}
Output: 10
Explanation: In every step a jump
is needed so the count of jumps is 10.
The first element is 1, so can only go to 3. The second element is 3, so can make at most 3 steps eg to 5 or 8 or 9.

I WILL ADD THIS PROBLEM IN DP SECTION

PLEASE ASSIGN THIS PROBLEM TO ME
THANK YOU

Minimum Window Substring

Given two strings s and t , return the minimum window substring of s such that every character in t (including duplicates) is included in the window.

Example: s="adobecodebanc"
t="abc"
Output: "banc"
The minimum length of the the substring of s that includes all the characters of t is "banc"

Adding Rat-Maze problem with efficient solution.

Story: You have to find a path through which the rat move from the starting position (0,0) to the final position where cheese is (n,n). List the total no of possible paths which the rat can take to reach the cheese.

Input
A file whose first line contains the size of the square maze The next n lines contain n binary values separated by space. 0 denotes an open cell while 1 denotes a blocked cell. You have to find paths which contain only cells which are open, and finally print the total no of such unique paths. Retracing the 1 or more cells back and forth is not considered a new path. The set of all cells covered in a single path should be unique from other paths

Output
The output should be the total no of paths possible on the first line

Question link:- https://www.codechef.com/problems/BPHC03

Complex number multiplication problem (leetcode) .

A complex number can be represented as a string on the form "real+imaginaryi" where:

real is the real part and is an integer in the range [-100, 100].
imaginary is the imaginary part and is an integer in the range [-100, 100].
i2 == -1.
Given two complex numbers num1 and num2 as strings, return a string of the complex number that represents their multiplications.

Sieve of Erathosthenes (in C++)

Through this algorithm, prime numbers upto a given target can be found in O(nlog(log(n)))
Example: n=16
Output: 2 3 5 7 11 13

Adding - Insert node at a particular position in a Linked List (CPP)

➕ Adding code sample with proper explanation in detail for better understanding of the problem statement.

▶️ Workflow of the code and the approach used.
▶️ With proper indentation and clean code.
▶️ Added comments, as comments enhance the readability of the program.

I would like to contribute to this issue under hacktoberfest2021.
Pls add suitable hacktoberfest labels.
.
.
Pls assign this issue to me.
Thankyou!!

Missing "Decode String" problem in Stacks.

Is your feature request related to a problem? Please describe.
This problem is to decode a given encoded string. Eg, for s = "3[a]2[bc]", output- "aaabcbc".
Problem Link: https://leetcode.com/problems/decode-string/

Describe the solution you'd like
I would use Stack Data Structure to implement this.

Describe alternatives you've considered
It can also be implemented using DFS.

Additional context
NA

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.