vichitr / hacktoberfestforbeginners

New to open-source? Contribute here!!!

HacktoberfestForBeginners

New to Open Source? You can start contributing to this repo.

Check out current issues and contribute to them. You can send as many Pull Requests as you want!

Algorithms & DS

Some of the basic algorithms - Linear Search, Binary Search, Sorting, Sieve, DP algorithms etc. Some of data structures are mentioned in README of DS folder.

Problem Solutions

You can also contribute to problem solutions of problems available on various platforms like Codeforces, Codechef, Hackerrank, Hackerearth, Atcoder, Topcoder, CS Academy, Leetcode, SPOJ, Interviewbit etc.

Guidelines to contribute

• Read instructions given in CONTRIBUTING.
• Do follow the convention mentioned.

PS: Do not pick a problem from an ongoing contest.

hacktoberfestforbeginners's Issues

hello~i want contribute this repository

hello.
sorry i begin github 7days ago,,,so im very beginner,,,
i want insert Dijkstra Algorithm so i make new branch and add->commit->push . but occur problem "unable to access~~The requested URL returned error : 403" ㅠㅠㅠㅠㅠ how to solved this problem....

Codeforces Problem Solutions

Leetcode Linkedlist Problems

I would like to add leetcode problems for LinkedList in c++.

Algorithms in various languages

Box It! - Hackerrank

Box It!

I have provided the link to question on Hackerrank and i would like to contribute answer to the Question

please assign this to me :))

[x] Hackerrank
[x] C++

@vichitr

Implement Topological Sorting for Directed Acyclic Graph (DAG)

This issue is dedicated to implementing the topological sorting algorithm for directed acyclic graphs (DAGs) in our Python project. Topological sorting is a fundamental graph algorithm that has practical applications in tasks like scheduling, dependency resolution, and determining the order of tasks or events.

The proposed changes for this issue include:

Implementing a Python function, say topological_sort, that performs topological sorting on a given DAG.
Ensuring that the function correctly orders the vertices in a way that respects the graph's directed edges and represents a valid topological order.

The benefits of implementing this feature are as follows:

Enhanced scheduling capabilities: Users can apply topological sorting to schedule tasks or processes with dependencies efficiently.
Improved codebase: The addition of this graph algorithm enhances the project's versatility for solving real-world problems.

Simplistic Number Game

I would like to add a guessing number game here if possible. All the best.

Guessing game

I would love to add python code for a guessing game, please assign this to me.

Codechef problem solutions

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.

Still open to contributions?

Hey @vichitr recently pushed PR for HackerRank solutions..Wanted to know is this dead or accepting PR?

For example, for n = 4 the sum is equal to  - 1 - 2 + 3 - 4 =  - 4, because 1, 2 and 4 are 20, 21 and 22 respectively. Calculate the answer for t values of n.IN PYTHON Input The first line of the input contains a single integer t (1 ≤ t ≤ 100) — the number of values of n to be processed. Each of next t lines contains a single integer n (1 ≤ n ≤ 109). Output Print the requested sum for each of t integers n given in the input

CODE FORCES PYTHON

https://codeforces.com/contest/791/problem/A
Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.

Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.

Limak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year.

After how many full years will Limak become strictly larger (strictly heavier) than Bob

Python PR's not passing the build checks.

I have created a PR for HackerEarth solutions in python it's not passing all the build checks please check the checks. and merge the PR.

CODE FORCES PYTHON

https://codeforces.com/problemset/problem/1452/A
There is an infinite 2-dimensional grid. The robot stands in cell (0,0) and wants to reach cell (x,y). Here is a list of possible commands the robot can execute:

move north from cell (i,j) to (i,j+1);
move east from cell (i,j) to (i+1,j);
move south from cell (i,j) to (i,j−1);
move west from cell (i,j) to (i−1,j);
stay in cell (i,j).
The robot wants to reach cell (x,y) in as few commands as possible. However, he can't execute the same command two or more times in a row.

What is the minimum number of commands required to reach (x,y) from (0,0)?

Input
The first line contains a single integer t (1≤t≤100) — the number of testcases.

Each of the next t lines contains two integers x and y (0≤x,y≤104) — the destination coordinates of the robot.

Output
For each testcase print a single integer — the minimum number of commands required for the robot to reach (x,y) from (0,0) if no command is allowed to be executed two or more times in a row

Hackerearth problem solutions

Hackerrank problem solutions

CODE CHEF PYTHON

https://codeforces.com/contest/1430/problem/A
Recently a new building with a new layout was constructed in Monocarp's hometown. According to this new layout, the building consists of three types of apartments: three-room, five-room, and seven-room apartments. It's also known that each room of each apartment has exactly one window. In other words, a three-room apartment has three windows, a five-room — five windows, and a seven-room — seven windows.

Monocarp went around the building and counted n windows. Now he is wondering, how many apartments of each type the building may have.

Unfortunately, Monocarp only recently has learned to count, so he is asking you to help him to calculate the possible quantities of three-room, five-room, and seven-room apartments in the building that has n windows. If there are multiple answers, you can print any of them.

Here are some examples:

if Monocarp has counted 30 windows, there could have been 2 three-room apartments, 2 five-room apartments and 2 seven-room apartments, since 2⋅3+2⋅5+2⋅7=30;
if Monocarp has counted 67 windows, there could have been 7 three-room apartments, 5 five-room apartments and 3 seven-room apartments, since 7⋅3+5⋅5+3⋅7=67;
if Monocarp has counted 4 windows, he should have mistaken since no building with the aforementioned layout can have 4 windows.
Input
Th first line contains one integer t (1≤t≤1000) — the number of test cases.

The only line of each test case contains one integer n (1≤n≤1000) — the number of windows in the building.

Output
For each test case, if a building with the new layout and the given number of windows just can't exist, print −1.

Otherwise, print three non-negative integers — the possible number of three-room, five-room, and seven-room apartments. If there are multiple answers, print any of them

CODE FORCES PYTHON

https://codeforces.com/problemset/problem/617/A
An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x(x > 0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.

Input
The first line of the input contains an integer x (1 ≤ x ≤ 1 000 000) — The coordinate of the friend's house.

Output
Print the minimum number of steps that elephant needs to make to get from point 0 to point x

Data Structures in various languages