@dheeraj-2000 I would like to add binary tree zigzag level order traversal.

Hello everyone

You might be aware that a lot of spamming is happening this year, and this has totally disturbed the Open Source community. So new ways has been added to discourage participants from spamming, which were intended to just +1 their PR count, Major updates are:

• Repository classified with the ‘hacktoberfest’ topic: Now onwards, only the repositories which have this topic will be eligible for hacktoberfest contribution.
• The pull requests will also need to be merged, approved by a maintainer, or labeled as ‘hacktoberfest-accepted’ in order to qualify. The deadline for completions, merging, labeling, and approving is November 1.

Read full UPDATE here

Thanks
Happy coding ✌️

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

Examples:

Input: arr[] = {2, 0, 2}
Output: 2
Kindly assign this issue to me......

I would like to add N-Queen Problem Code under Recursion

@dheeraj-2000 I would like to contribute Copy List with random pointers Leetcode problem no. 138. Please assign me this.

I would like to work on this issue.In this I explain my code with understandable comments and with proper input and output Format.
Please assign it to me @dheeraj-2000

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.........

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

The overall run time complexity should be O(log (m+n)).

Example 1:

Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3] and median is 2.
Example 2:

Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

Constraints:

nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106

Matrix chain multiplication problem implemented in c++ using DP to solve it.

I would like to add LRU cache problem in Leetcode problem section

I would like to add this topic in the contest section

I have raised PR #337 for prime factorization of the number ,
finding the number of divisors of number and the sum of all divisors.
Please review it and accept it.

• This repo welcome beginners to Github and the opensource community by helping them learn how to make contributions to open source!

• As said, only high-quality contributions and pull requests that add value to Open Source projects are part of the core values of Hacktoberfest. So, my priority is quality of contribution over quantity and that's what I expect from you as a contributor.

• Therefore, I highly recommend you to contribute in a meaningful way in this repository and other Hacktoberfest issues by following the guidlines of the repos.

⚠️ Please refrain plagiarising code for the sake of pull request. I highly discourage it

I would like to contribute the code to rotate a linked list to the right by k places. Please assign this issue to me under hacktoberfest 2022

@dheeraj-2000 I would like to contribute Sort List Leetcode problem no. 148. Please assign me this.

Hey, I want to implement the solution to this medium-level leet Code problem in JAVA.
My runtime beats the 85%+ submission.
Here is the problem link: https://leetcode.com/problems/longest-substring-without-repeating-characters/

I want to do this as a hacktoberfest contribution
Please assign this to me.

Given n dice each with m faces, numbered from 1 to m, find the number of ways to get sum X. X is the summation of values on each face when all the dice are thrown.

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

Hi @dheeraj-2000
I have made a PR #323 for Bellman Ford Algorithm for finding shortest paths.
Kindy review the same :)

Hi @dheeraj-2000
I would like to write a code for the Longest Repeating Subsequence Problem. In this problem Given a string, find the length of longest repeating subsequence such that two subsequences don't have same string character at same position.. I will implement it using Dynamic Programming in C++ with proper comments and explanation of the code.

Want to add Game Stone Question of Game theory in C++

I would like to add next greatest element in Stack section. @dheeraj-2000 please assign it to me. Thank you!

Two players X and Y are playing a game in which there are pots of gold arranged in a line, each containing some gold coins. They get alternating turns in which the player can pick a pot from one of the ends of the line. The winner is the player who has a higher number of coins at the end. The objective is to maximize the number of coins collected by X, assuming Y also plays optimally.

Return the maximum coins X could get while playing the game. Initially, X starts the game.
Example 1:

Input:
N = 4
Q[] = {8, 15, 3, 7}
Output: 22
Explanation: Player X starts and picks 7. Player Y
picks the pot containing 8. Player X picks the pot
containing 15. Player Y picks 3.
Total coins collected by X = 7 + 15 = 22.
Kindly assign this issue to me......

Hey @dheeraj-2000 I would like to add the algorithm of Maximum Value Contiguous Subsequence in an array using Dynamic Programming

Hey there, I'm participating in #hactoberfest2k21, Please assign me the issue. Good day!
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string "".
Example:
Input: strs = ["flower","flow","flight"]
Output: "fl"

Hi @dheeraj-2000
I would like to write a code for the Longest Common Substring Problem. In this problem we have to determine the length of longest common substring between two given strings. I will implement it using Dynamic Programming in C++ with proper comments and explanation of the code.

I would like to work on this topic and implement the entire code in Java.
I will comment wherever needed.

I want to add Hackerrank Implementation Answers in C++ of:

1. 3d surface area
2. ACM_ICPC_team.cpp
3. Angry_professor.cpp and etc.

Kindly review and merge #232 :-D

I have added Integer Break which is a Leetcode problem in this PR #244
Kindly review it.
Thanks

Kindly review and merge :)
#210

Hey there, I'm participating in #hactoberfest2k21, Please assign me the issue. Good day!
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Example:
Input: intervals = [[1,3],[2,5]]
Output: [[1,5]]

Add linear time sorting algorithms like:

1. Radix Sort
2. Bucket Sort
3. Counting Sort

Hey @dheeraj-2000
I would like to add a program for Matrix in spiral form for which I have created a PR.
Kindy review the same :)

Hey Dheeraj, I want to add a math algorithm in this repository. Do let me know If I should proceed

Please consider this as my contribution towards Hacktoberfest 2022. I would be really grateful to you. I am living for that t-shirt.

I commented every step in order to make the code more readable and understandable.

#include<bits/stdc++.h>
using namespace std;

int moore_voting(int [], int);

int main()
{
    int n, ar[50];
    cout << "Enter the size of the array: ";
    cin >> n;
    for(int i = 0; i<n; i++)
    {
        cout << "ar[" << i << "] = ";
        cin >> ar[i];
    }
    cout << "The majority element in the array is: ";
    cout << moore_voting(ar, n);
}

int moore_voting(int arr[], int size)
{
    //Phase 1: - Finds a suitable candidate for the majority element
    int res = 0, count = 1;     //
    for(int i = 1; i<size; i++)    //Traversing the array
    {
        if(arr[res] == arr[i])   //Checking if first element is same as ith element
            count++;     //If yes then incrementing the count by 1
        else
            count--;     //Decrementing the count if ith element is not equal to first element
        if(count==0)     //If at any point the count becomes 0 while decrementing
        {
            res = i;     //Updating the ith element as result since it's not a suitable 
            count = 1;   //candidate for majority. Also resetting the count of majority element
        }
    }

    //Phase 2: - Checks if the candidate selected is actually in majority or not
    count = 0;
    for(int i = 0; i<size; i++)
    {
        if(arr[res] == arr[i])
        
            count++;              //Line 36-44: - Checks if the candidate
    }                             //element is a majority element or not
    if(count <= size/2)
        res = -1;
    return res;
}

I would like to add Palindromic Partitions Problem Code under Recursion section using C++

I would like to add some famous sorting algorithms (many of which work in O(nlogn) time complexity) in the main section of the repository as a part of hacktoberfest 2020. Please assign me this work

Given a graph and a source vertex in the graph, find the shortest paths from the source to all vertices in the given graph.

Kindly assign this issue to me.....

There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number k which indicates that k-1 persons are skipped and kth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive.
For example, if n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So the person at position 3 survives.
If n = 7 and k = 3, then the safe position is 4. The persons at positions 3, 6, 2, 7, 5, 1 are killed in order, and person at position 4 survives.

Please assign this to me.......

Please make sure the algorithm you're contributing is not already present in the repo.

A simple C program to reverse a singly linked list.

I will be working on this issue under Hacktoberfest'22

A and B are playing a game. At the beginning there are n coins. Given two more numbers x and y. In each move a player can pick x or y or 1 coins. A always starts the game. The player who picks the last coin wins the game or the person who is not able to pick any coin loses the game. For a given value of n, find whether A will win the game or not if both are playing optimally.

Examples: Input : n = 5, x = 3, y = 4
Output : A
There are 5 coins, every player can pick 1 or
3 or 4 coins on his/her turn.
A can win by picking 3 coins in first chance.
Now 2 coins will be left so B will pick one
coin and now A can win by picking the last coin.

Input : 2 3 4
Output : B

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

I would like to add Kosaraju's algorithm used to identify strongly connected components of a graph under graph section.

Addition of DSU concept.

Often it is also called Union Find because of its two main operations.

This data structure provides the following capabilities. We are given several elements, each of which is a separate set. A DSU will have an operation to combine any two sets, and it will be able to tell in which set a specific element is. The classical version also introduces a third operation, it can create a set from a new element.

Thus the basic interface of this data structure consists of only three operations:

make_set(v) - creates a new set consisting of the new element v
union_sets(a, b) - merges the two specified sets (the set in which the element a is located, and the set in which the element b is located)
find_set(v) - returns the representative (also called leader) of the set that contains the element v. This representative is an element of its corresponding set. It is selected in each set by the data structure itself (and can change over time, namely after union_sets calls). This representative can be used to check if two elements are part of the same set or not. a and b are exactly in the same set, if find_set(a) == find_set(b). Otherwise they are in different sets.

I will add a question that involves this concept.
I will update the corresponding PR Number asap.
Please accept my improvement. @dheeraj-2000

@dheeraj-2000 Sir, please assign this to me