adi8080 / hactoberfest2021 Goto Github PK

View Code? Open in Web Editor NEW

33.0 1.0 283.0 720 KB

Add anything about data structure and algorithm in any language.

C++ 46.45% Kotlin 0.15% Python 11.29% PHP 0.16% Java 31.00% C 7.60% JavaScript 3.34%

hacktoberfest hactoberfest2021 hacktoberfest2021 hacktoberfest-accepted

hactoberfest2021's Introduction

Hacktoberfest 2021

Follow the README below to get started!

Note : This repo is excluded from the Hacktoberfest but you can still contribute and the reason is importance of DSA, yourcontribution will be for lifelong.

Getting Started
The Process

Getting Started

Before you begin, please follow my other account and contribute to projects over there.

The Process

Fork this repository
Run git clone [your repo url goes here]
CD into your cloned repo
Run git checkout -b [your branch name goes here] to create your new branch
Make your edits and save
Run git add .
Run git commit -m 'Commit message goes here'
Finally, run git push origin [your branch name goes here]
Star this repo
Create a new pull request from your forked repository (Click the New Pull Request button located at the top of your repo)
Wait for your new PR to be reviewed and merged!

hactoberfest2021's People

Contributors

Stargazers

Watchers

Forkers

avi2021-oss shreyas-mishra ilorah bamsarts nira07 vinaykumar1512 debargha-arch iuc4801 cmvyas pravin1237 manish866 yashmathur03 rishika-crypto statusyaza aakashjain294 siddhant025 faizalam priyamm vanshika-11 ramdevcm jaichhabra rohitkothapalli anish7503 hunt-s7 frepics05 nmndv abhishek23012000 vidhisha28 gargdeepanshi developerops srivaspankhuri sprakhar11 deepcoder012 abhishek4uh grumppie dikshita-jain-13 sumyak-jain saurabh042 mandeepsinghkohli sudip1234567 chandu2000 itskhatri27 mritunjay7065 deeks900 sarthak9999 pushanverma harshitasingh828 teeniv001 adaharshsingh ms-svg piyushwebdev realnamehidden1 ilham-ha1 silvisharma abbhardwaj01 braviab atharvawagh2018 sparshsukralia parundeepsingh deepak089 harshks534 aman-ragh devayush20 freckles30 tsemester chronos25 sarthakupadhyay06 uzairshaikh908 anshita2907 ram-lakhan-01 kamalraj9135 prajwaldev09 naman-gupta1234 ani538 sil3nt-c0d3r rahul-kumar-tiwari arif-bin-abu pareshapraj james7881 bhavyashahm123 mudassirraza912 pradhyumanarora emashutosh bhutani2002 fatimamhtech abhishekb13402 imrohan01 sachin4429 manvikri22 aditimahabole yodifm ronitrangwani anant-02 vaishnavi2210 an-code18 vikash8292 sahilrawat001 rajethanm5 ronak007mistry nayan5

hactoberfest2021's Issues

QuickSort using java

please assign this to me @Adi8080 ...I want to contribute in it

need to add dijkstra's algorithm in setup

i do not find any code for dijkstra's algorithm

Remove upper section of github page theam

for reffrence use this repo

Make different folder for different files

Project excluded from hacktoberfest21?

Missing bubble sort ,selection sort ,insertio9n sort ,quick sort and merge sort.

I want to work on this @Adi8080 . Please assign this to me.

Want to add function overloading program in C++ to find the area of a rectangle.

Implementation of Doubly Circular Linked List

Can I contribute this?

Want to add the Wildcard Matching Code with Explanation wherever needed.

Hey @Adi8080 please assign this to me so that i can add the code for Wildcard Matching with explanation wherever needed in C++.
Thank You

Implementation of Queue using array

Hi I want to contribute a queue using array could you please assign me this issue ?

Added a Balance AVL Tree

Hello There,

I have added the c++ code for the balanced AVL tree with proper balance factor. This code take the input for the user i.e number of node and it's values .

Hope this code find you well .

Thank you
Regards

The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors.
Suppose that we wish to know which stories in a 36-story building are safe to drop eggs from, and which will cause the eggs to break on landing. We make a few assumptions:
…..An egg that survives a fall can be used again.
…..A broken egg must be discarded.
…..The effect of a fall is the same for all eggs.
…..If an egg breaks when dropped, then it would break if dropped from a higher floor.
…..If an egg survives a fall then it would survive a shorter fall.
…..It is not ruled out that the first-floor windows break eggs, nor is it ruled out that the 36th-floor do not cause an egg to break.
If only one egg is available and we wish to be sure of obtaining the right result, the experiment can be carried out in only one way. Drop the egg from the first-floor window; if it survives, drop it from the second-floor window. Continue upward until it breaks. In the worst case, this method may require 36 droppings. Suppose 2 eggs are available. What is the least number of egg-droppings that is guaranteed to work in all cases?

Kindly assign this issue to me...........