🚀 Feature

Given a number n, print all primes smaller than or equal to n using Sieve of Eratosthenes technique.

Have you read the Contribution Guidelines?

Yes

Pitch

This is one of the best algorithms to find the prime from a particular range and also to find the prime number with O(nlogn) time complexity

Assignees

@shaswatsingh19 - Python
@harshit-labs - C
@mcaupybugs - C++
@chhipanikhil9 - Java
@Carbon24 - JavaScript

🚀 Feature

Given the first two terms, a1 and a2, of an A.P. (Arithmetic Progression), and an integer n, find the value of nth term in the A.P.

For example -

Input:
a1 = 2
a2 = 3
n=4

Output:
5

Explanation:
The A.P. for this example would be - 2, 3, 4, 5, 6, 7, ...

Have you read the Contribution Guidelines?

Yes

Pitch

This is an extremely simple mathematical problem. A good beginner-friendly issue.

Assignees

@vanisha23 - C
@niranjantuty - C-Plus-Plus
@mananchawla2005 - Java
@mananchawla2005 - Python

Implement Ternary Search Algorithm

Assignees

@maharajch - Java
@Mynk-9 - C++
@Manavi18 - Python
@Manognya1000 - C

🚀 Feature

Check whether a number entered by the user is Armstrong or not.

A positive integer of n digits is called an Armstrong Number (of order n) if:
abcd.. = a^n + b^n + c^n + d^n + ...

for eg: 153 is an armstrong number because, 153= 1x1x1 + 5x5x5 + 3x3x3 i.e. 1^3+5^3+3^3 = 153.

Have you read the Contribution Guidelines?

Yes

Pitch

An interesting and elementary math-based problem.

Assignees

@lostgirljourney - C
@AnkitJuyal009 - Java
@niranjantuty - Python
@Anushka-Rajvanshi - C++
@Anni852 - JavaScript
@FinalGetsugaa - C#

🚀 Feature

Given two strings find the longest common subsequence.
Example:
string1 : abaaba
string2: aababa
Output: aaba

Have you read the Contribution Guidelines?

Yes

Pitch

Solve this problem using hashing and binary search.

Assignees

@krishnapatil1406 - C
@SuyashGupte - Python
@mcaupybugs - CPP
@sukanyashet - Java

🚀 Implementing Greedy algorithm in C++

Given a value V, if we want to make a change for V Rs, and we have an infinite supply of each of the denominations in Indian currency, i.e., we have an infinite supply of { 1, 2, 5, 10, 20, 50, 100, 500, 1000} valued coins/notes, what is the minimum number of coins and/or notes needed to make the change?

Have you read the Contribution Guidelines?

Yes

Pitch

This is an important algorithm to be looked upon

Assignees

@sushant-varanasi - Java, Python

🚀 Feature

Add Dijkstra's Algorithm in C++ (optimized in best way possible)

Have you read the Contribution Guidelines?

Yes

Pitch

Dijkstra's Algorithm is a very famous graph algorithm which finds shortest paths from the starting node to all nodes of the graph provided there is no negative edges in the graph.

Assignees

@krrahul23 - C++
@nileshteji - Java
@sukanyashet - C
@Pratik-Patil-p0212-m3108 - Python

🚀 Feature

Add tower of Hanoi recursion code in C++ (Optimized in the best way possible)

Have you read the Contribution Guidelines?

Yes

Pitch

(Please explain why this feature should be implemented and how it would be used.)

Want to add the tower of Hanoi program as it is not yet added but remains one of the most asked interview questions. Please assign me the cpp code task

Assignees

@nileshteji - Java
@Devansh2005 - Python
@therohanjaiswal - C

Create largest number possible using given numbers (can be multiple digits)

Have you read the Contribution Guidelines?

Yes

Pitch

This algorithm would be really useful when someone needs to find largest number possible in short amount of time without trying out all possible combinations.

Assignees

@tatticoder - C++
@Manavi18 - Python
@natedtcc - Java
@ShovikGod - C
@natedtcc - PHP
@sejalshri - JavaScript

🚀 Feature

Implement Circular Queue

Have you read the Contribution Guidelines?

Yes

Pitch

A basic linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle.

Assignees

@jovianjaison - C++
@scshiv29-dev - Python
@yashkansal - Java
@Devansh2005 - C

🚀 Feature

Given the first two terms, a1 and a2, of an G.P. (Geometric Progression), and an integer n, find the value of nth term in the G.P.

For example -

Input:
a1 = 1
a2 = 2
n=4

Output:
8

Explanation:
The G.P. for this example would be - 1, 2, 4, 8, 16, ...

Have you read the Contribution Guidelines?

Yes

Pitch

This is an extremely simple mathematical problem. A good beginner-friendly issue.

Assignees

@banerjee-suchismita - C
@Pratap2018 - C++
@niranjantuty - Java
@mananchawla2005 - Python

🚀 Feature

Implementing Kahn's Algorithm for finding the Topological Sort of a Directed Acyclic Graph

Have you read the Contribution Guidelines?

Yes.

Pitch

Topological Sort is a very technique to find which task needs to be completed before whom. In real world, we can represent the dependent tasks into a directed acyclic graph and find the topological sorting of the Directed Acyclic graph to find the optimal ordering.

Assignees

@ankur-kayal - C++
@Manognya1000 - Java
@AdeshChoudhar19 - Python
@SuyashMore - Go

🚀 Implementing Kosaraju's algorithm

kosaraju algorithm is used to find Strongly connected components in a Directed Graph,

Have you read the Contribution Guidelines?

Yes

Pitch

This algorithm is quite essential for a programmer to learn

Assignees

@sig5 - C++
@shaswatsingh19 - Python
@anjanik012 - Java
@anjanik012 - C

🚀 Feature

merge sort implementation in python

Have you read the Contribution Guidelines?

Yes

Pitch

Merge sort is a divide and conquer type algorithm with a time complexity of O(nlogn) which is better than selection and insertion sort

🚀 Feature

Consider an example of a thief who wants to steal jewelry from a jewelry shop but he has a constraint with the bag he carries which can only hold some specific weight. Help him picking up the jewelry such that he gets maximum profit without violating the bag's constraint.

For example-
Input-
value[] = {60,100,120}
weight[] = {10,20,30}
W = 50 (weight of knapsack)
Output-
Profit = 220

Have you read the Contribution Guidelines?

yes

Pitch

By solving this problem one can understand the concept of dynamic programming approach.

Assignees

@juanbelieni - Python
@chhipanikhil9 - C++
@shubhi2000 - Java
@616bqwerty - C

🚀 Feature

Implement Linear Search.

Have you read the Contribution Guidelines?

Yes

Pitch

Standard Searching Technique

Assignees

@shaswatsingh19 - Python
@mcaupybugs - C++
@ShovikGod - C
@niranjanneeru - Java
@100mik - Go
@Carbon24 - JS

🚀 Feature

Given a string expression, check whether the pair and order of { }, ( ),[ ] are correct in expression.

For example-
Input: ({[]})
Output: Balanced

Input: (({})
Output: Not Balanced

Have you read the Contribution Guidelines?

yes

Pitch

You will get to know about the implementation of the stack data structure.
Checking whether parentheses are balanced or not is one of the most important tasks of a compiler.

Assignees

@chhipanikhil9 - C++
@SuyashGupte - Python
@Anushka-Rajvanshi - C
@yashkansal - Java

Create a separate markdown for for contribution guidelines

Have you read the Contribution Guidelines?

Yes

Pitch

I understand that having guidelines in readme.md is convenient and beginner friendly But, having a separate contributing.md in root of directory will make this repository more modular and structured. Many projects use this structure and GitHub shows a link at top of page to this file to make it easily accessible.
Moreover, This would make it easier for veteran developers easier to contribute to this project and prepare amateur developers to work on other projects and make them familiar with industry standards.

Assignees

@tatticoder

🚀 Feature

i can implement z function in java or c++

Have you read the Contribution Guidelines?

Yes

Pitch

finds all occurrences of a pattern in a text in linear time

Assignees

@jhoserpacheco - Java
@Anushka-Rajvanshi - C++
@AdeshChoudhar19 - Python
@osomat123 - C

Greatest common divisor

Implement Euclidean Algorithm to find greatest common divisor of 2 given numbers.

Have you read the Contribution Guidelines?

Yes

Pitch

It will be implemented as a function which returns Highest common factor of given 2 numbers. This algorithm is much more fast and efficient than the naive approach and takes very short amount of time to compute GCD of very large numbers.

Assignees

@tatticoder - C++
@Manavi18 - Python
@natedtcc - Java
@sudheer121 - C
@arnav-roy - Javascript
@100mik - Go
@natedtcc - PHP

🚀 Feature

it is a problem of finding optimal route between nodes in the graph. The total travel distance can be one of the optimization criterion. I can in Java or c++

Have you read the Contribution Guidelines?

Yes

Pitch

optimization in graph

Assignees

@SuyashMore - Go
@jhoserpacheco - Java
@Manavi18 - C
@ashitajain14 - Python
@jovianjaison - C++

🚀 Feature

implement heap sort

Have you read the Contribution Guidelines?

Yes

Pitch

One of the best sorting algorithm in comparison to selection sort but it is better in term of time and space complexity

Assignees

@shaswatsingh19 - Python
@mephi007 - Java
@singhalpranav22 - C++
@therohanjaiswal - C

🚀 Feature

Implement Binary Search

Have you read the Contribution Guidelines?

Yes

Pitch

It will help us to find elements in the arrays. Standard searching technique.

Assignees

@jhoserpacheco - Java
@mcaupybugs - C++
@shaswatsingh19 - Python
@Pranav1642 - C
@pheeel - JS
@LaxmiNyamagoud - PHP
@AndreaBiondaro - GO

🚀 Feature

Maze Problem using Backtracking

Have you read the Contribution Guidelines?

Yes

Pitch

One of the best sorting algorithm in comparison to selection sort but it is better in term of time and space complexity

Assignees

@banerjee-suchismita - C
@sig5 - C++
@0utplay - Java
@vvekparmar - Python

🚀 Feature

Implement Insertion Sort. Do add Sample Input/Output, Time and Space Complexity at the bottom of the file (inside a comment).

Have you read the Contribution Guidelines?

Yes

Pitch

A very basic and standard sorting algorithm.

Assignees

@lostgirljourney - Python
@Anni852 - C++
@JanetLaysEggs - C
@Anushka-Rajvanshi - Java

🚀 Feature

Given a linked list, reverse it.
Linked List: 1->2->3->4->5->6
After reversing the list, elements are 6->5->4->3->2->1.

Have you read the Contribution Guidelines?

Yes

Pitch

An easy Linked List problem.

Assignees

@Parth505 - Python
@AdeshChoudhar19 - C++
@kamil200 - Java
@satwik-chowdary - C

🚀 Feature

A simple program to check whether the entered number by the user is neon or not.
A neon number is a number where the sum of digits of square of the number is equal to the number.
Example: 9
Sum of digits of it's square = (8 + 1) = 9 = number entered by the user
So, 9 is a NEON NUMBER.

Have you read the Contribution Guidelines?

Yes

Pitch

This can be an initial and easy step for a beginner to implement this code

Assignees

@Devansh2005 - Python
@tauseefmohammed2 - C++
@prophet-x - C
@niranjantuty - Java
@Carbon24 - JS

🚀 Feature

Implement Radix Sort, and Bucket Sort algorithms.

Have you read the Contribution Guidelines?

Yes.

Pitch

Since sorting can often reduce the complexity of a problem, these are the most needed prerequisites for problem-solving in Computer Science. These algorithms have direct applications in them and a must before delving deeper.

Assignees

Radix Sort

C - @kamalrt11
C++ - @ankur-kayal
Java - @yashkansal
Python - @nerdynikhil

Bucket Sort

C - @kamalrt11
C++ - @harshit-labs
Java - @Manognya1000
Python - @nerdynikhil

🚀 Feature

Given a singly linked list of N nodes. The task is to find the middle of the linked list.
For example, if given linked list is 1->2->3->4->5 then the output should be 3.
If there are even nodes, then there would be two middle nodes, we need to print the second middle element.
For example, if given linked list is 1->2->3->4->5->6 then the output should be 4.

Have you read the Contribution Guidelines?

Yes

Pitch

An easy Linked List Question.

Assignees

@gokulkannan7 - C++
@codewithnick - Python
@prophet-x - Java
@satwik-chowdary - C

🚀 Feature

Implement Merge Sort.
Add (inside comment) Sample input and output at the end of the file along with Time and Space Complexity.

Have you read the Contribution Guidelines?

Yes.

Pitch

This sorting technique will let you understand the Divide and Conquer approach and the concept of stable algorithms.

Assignees

@Pratap2018 - C
@AnanyaNagar - C++
@Pratap2018 - Java
@ashitajain14 - Python

🚀 Feature

Rotate LinkedList in K group

Have you read the Contribution Guidelines?

Yes

Pitch

(Please explain why this feature should be implemented and how it would be used.)
Gives visualization to recursion and LinkedList.

Assignees

@mephi007 - Java
@singlamohit1 - C++

🚀 Feature

Search Repeating elements using Map / Hashmap

Have you read the Contribution Guidelines?

Yes

Assignees

@garv-cmd - Java
@nshattuck20 - Python
@satwik-chowdary - C
@jhoserpacheco - C++

🚀 Feature

Implement a shell sort algorithm, including comments and time/space complexity.

Have you read the Contribution Guidelines?

Yes.

Pitch

Haven't seen this one listed yet! I would like to submit a Java implementation of it. Thanks!

Assignees

@Manavi18 - Python
@manan025 - C++
@natedtcc - Java
@AdeshChoudhar19 - C

🚀 Feature

All the Algorithms in python which is easy to understand and can help the beginner to learn algorithm in python

Have you read the Contribution Guidelines?

Yes

Pitch

Most of us do competitive programming in c++ or java but most of the competitive programmer doesn't use python so just trying to make a change here because if a beginner try to read a c++ file of a competitive programmer like William lin or tourist they would have known about a lot of things but python been a full high level that is very much similar to English it's easy of beginner to learn it.

Feature

Find if an element x is present in a 2D matrix when matrix is sorted in increasing order both row and column wise.

Have you read the Contribution Guidelines?

Yes

Pitch

It is a frequently asked interview question of 2D arrays.

Assignees

@yashkansal - Java
@Anushka-Rajvanshi - C++
@krishnapatil1406 - C
@manan025 - Python

🚀 Feature

Implement Bubble Sort. Do add Sample Input/Output, Time and Space Complexity at the bottom of the file (inside a comment).

Have you read the Contribution Guidelines?

Yes

Pitch

A very basic and standard sorting algorithm.

Assignees

@shravani05 - C++
@vanisha23 - Java
@Anushka-Rajvanshi - Python
@yashkansal - C
@wallacecosta - C#
@Carbon24 - Javascript
@jmiguelpv - PHP
@AndreaBiondaro - Go

🚀 Feature

Want to add resources for those who're new to OPEN SOURCE Contribution.
ALL CONTRIBUTORS are welcome to contribute.

A Resources.md file shall be created for this issue.
ALL CONTRIBUTORS can add their set of resources in this file.
Thank you!

Have you read the Contribution Guidelines?

Yes

Pitch

Since Hacktoberfest is around the corner, wanna help who're extremely new to Git and GitHub environment.

Initiative taken by @lostgirljourney

🚀 Feature

(Write down a clear and concise description of what the feature is.)

Have you read the Contribution Guidelines?

Yes

Pitch

Automorphic Number is a natural number in a given number base whose square "ends" in the same digits as the number itself.

Assignees

@Devansh2005 - Python (Since you've created the issue)
@ShovikGod - Java
@dev1920 - C
@Mynk-9 - C++
@deepansha-singh - PHP
@100mik - Go

🚀 Feature

I've seen that Selection Sort is missing from the sorting algorithms

Have you read the Contribution Guidelines?

yes

Pitch

Selection Sort is one of the simple sorting algorithms, if you'll open this issue, I'd like to implement it in Python

Assignees

@patricktrp - Python
@Saujanya0910 - C++
@jcads - Java
@jovianjaison - C
@wallacecosta - C#
@patricktrp - Javascript

🚀 Feature

Description

A program to find the longest length path in a matrix which is taken as input from the user. The difference between two consecutive elements must be same for all the elements present in the path.
(Important concept for competitive programming).

Example

Input:
{{1, 0, 9}
{2, 3, 8}
{4, 6, 7}}

Output: 4

Since, the longest path is 6-7-8-9.

Have you read the Contribution Guidelines?

Yes.

Pitch

(Please explain why this feature should be implemented and how it would be used.)

It is an important topic in dynamic programming and questions from this topic is often found in coding competitions.

Assignees

@mcmonojit - Java assigned
@gfmota - C

🚀 Feature

Implement the code to remove the nth node of a linked list.
For eg. 3,7,1,9,4 (Remove 3rd node) =3,7,9,4

Have you read the Contribution Guidelines?

Yes

Pitch

It is a simple linked list implementation problem to start with.

Assignees

@APOORVANAGAR-2002 - C
@vanisha23 - Java
@krishnapatil1406 - C++
@codewithnick - Python

🚀 Feature

Implementation of -

1. Singly Linked List
2. Doubly Linked List
3. Circular Singly Linked List
4. Circular Doubly Linked List
5. Stack
6. Queue

There will be different files for each data structure.
Don't forget to add Sample I/O and Time & Space Complexity at the end of the file
Each data structure is to be implemented in 4 different languages.
So, for this issue we will have 24 PR's.

Have you read the Contribution Guidelines?

Yes.

Assignees

1. Singly LL

C - @lostgirljourney - Completed
C++ - @Jashandeep2020
Java - @mukulpathania96
Python - @patricktrp

2. Doubly LL

C - @Anni852
C++ - @Anni852
Java - @mukulpathania96
Python - @Karthik-Shenoy

3. Circular Singly LL

C - @osomat123
C++ - @AnanyaNagar
Java - @mukulpathania96
Python - @Karthik-Shenoy

4. Circular Doubly LL

C - @osomat123
C++ - @Rahulraj31
Java - @mukulpathania96
Python - @Karthik-Shenoy

5. Stack

C - @aditik03
C++ - @Jashandeep2020
Java - @scshiv29-dev
Python - @codewithnick
JavaScript - @Ritika0126

6. Queue

C - @aditik03
C++ - @APOORVANAGAR-2002
Java - @scshiv29-dev
Python - @Karthik-Shenoy - Completed

🚀 Feature

Implementation of quick sort algorithm on doubly linked list

Have you read the Contribution Guidelines?

yes

Pitch

Quick Sort algorithm is a divide and conquer algorithm which selects an element as a pivot and does partition around it.

Assignees

@yashkansal - Java
@manan025 - Python
@malhotraravi842 - C++
@Manognya1000 - C

🚀 Feature

Implement Quick Sort.
Add (Inside Comment) Sample Input and Output at the end of the file along with Time and Space Complexity.

Have you read the Contribution Guidelines?

Yes.

Pitch

This is a good sorting technique.

Assignees

@Anni852 - C
@lostgirljourney - C-Plus-Plus
@codewithnick - Python
@aditik03 - Java
@Arsh-ak7 - Javascript
@AndreaBiondaro - Go

🚀 Feature

(Write down a clear and concise description of what the feature is.)
Binary exponation is optimize solution for finding Big squre problem,
Time Complexity : O(log n)

Input : 3 18132 17 example (3 POW 18132 mod 17)=13
Output : 13

Have you read the Contribution Guidelines?

Yes !

(Write your answer here.)

Pitch

(Please explain why this feature should be implemented and how it would be used.)

Assignees

@Akash52 - C++

🚀 Feature

Implementation of Kadane's algorithm which is used to find the maximum sum continuous subarray in O(n) time.

Have you read the Contribution Guidelines?

Yes

Pitch

Kadane's algorithm is a very famous algorithm which is used to find the maximum sum continuous subarray in O(n) time complexity . This algorithm falls under dynamic programming paradigm.

Assignees

@krrahul23 - C++
@mrjoshi0147 - Java
@Mynk-9 - Python
@sohail24 - C

🚀 Feature

An implementation of the Singly Linked List data structure with commands such as:

• reverse traversal
• node deletion
• node insertion
• normal traversal

Have you read the Contribution Guidelines?

Yes

Pitch

I will be doing this in Python with proper commenting.

🚀 Feature

I've seen that Stack is missing from the data structure

Have you read the Contribution Guidelines?

yes

Pitch

Stack is one of the simple data structure ,if you''ll open this issue , i'd like to implement it it in cpp

🚀 Feature

Implementation of Binary Search Tree(BST)

Have you read the Contribution Guidelines?

Yes

Pitch

Implementing Binary Search Tree in C++ and Performing Operations Such as : Insertion, Deletion and Searching

Assignees

@tauseefmohammed2 - C++
@manan025 - Python
@mephi007 - Java
@aditik03 - C

🚀 Feature

Tarjan's Algorithm to find the articulation points in a graph in c++.

Have you read the Contribution Guidelines?

Yes

Pitch

Articulation Points (Cut Vertices ) are those points in graph which when removed results in increase of number of components
of graph . These points can be found efficiently using Tarjan's Algorithm

Assignees

@krrahul23 - C++
@therohanjaiswal - C
@jhoserpacheco - Java