Please allow me to add this program

I Going to add topological sorting algorithm

Hello, I would like to contribute to this repo by adding 6 basic Star pattern programs.

@ossamamehmood Please assign me this.

Thank You!!

implement binary search in javascript

I think there should be a folder for Golang also with a small program as an example.
Others can add more Golang programs.

Hello, I would like to contribute to this repo by adding codes of some data structures and their methods like add,remove,delete,reverse.
@ossamamehmood Please assign me this.

Thank You!

@Chifez can you please assign this to me

Please assign me this issue under Hactoberfest.

i made an football player data in android app native in kotlin but i doesn't see an kotlin folder. doesn't that means i can't contributed my project to this repo?

There are n cities and m flight connections between them. You want to travel from Syrjälä to Lehmälä so that you visit each city exactly once. How many possible routes are there?

Input
The first input line has two integers n and m: the number of cities and flights. The cities are numbered 1,2,…,n. City 1 is Syrjälä, and city n is Lehmälä.

Then, there are m lines describing the flights. Each line has two integers a and b: there is a flight from city a to city b. All flights are one-way flights.

Output
Print one integer: the number of routes modulo 10^9+7.

Constraints
2 ≤ n ≤ 20
1 ≤ m ≤ n^2
1 ≤ a,b ≤ n

Example
Input:

4 6
1 2
1 3
2 3
3 2
2 4
3 4
Output:

2

It is out of date as it seems to be copied from Hacktoberfest2022. So update it.

Given a string s consisting of words and spaces, return the length of the last word in the string.

A word is a maximal substring consisting of non-space characters only.

I want to add a Boggle Word solver in python. Entire program will be modular. So can anyone please assign me this issue under #Hacktoberfest and hacktoberfest-accepted label?

Add Golang section

sorry I forgot to raise issue for #74 but here it is @Chifez

This simple project will help beginners to learn about manipulating DOM in javascript

Given a Directed Acyclic Graph (DAG) with V vertices and E edges, Find any Topological Sorting of that Graph

For the addition of dynamic queue with the help of linked list.

I want to add a new view, This will be a login in Spanish (my native language)

we can also add the variation of the merge sort algorithm which uses recursion.

Hello, I would like to contribute in this repository by adding sorting algorithms like SelctionSort, InsertionSort and BubbleSort.

@ossamamehmood Please assign me this.

Thank You!

i will be creating a discord bot using python, please assign me this issue.

i want to add javascript which searching lucky number with superstition

please assign me this project under hacktoberfest 2023.

this project will help beginners to learn about react hooks and ternary operators

I have just added my first PR on creating a proof-of-concept Music-Player. Song were removed as copyright issue but adding songs and adjust the codes as needed will makes the web fully functional.

create a folder for contributing javascript code and a readme.md file stating the contribution guidelines

Byteland has n cities, and m roads between them. The goal is to construct new roads so that there is a route between any two cities.
Your task is to find out the minimum number of roads required, and also determine which roads should be built.
Input
The first input line has two integers n and m: the number of cities and roads. The cities are numbered 1,2,… n.
After that, there are m lines describing the roads. Each line has two integers a and b: there is a road between those cities.
A road always connects two different cities, and there is at most one road between any two cities.
Output
First print an integer k: the number of required roads.
Then, print k lines that describe the new roads. You can print any valid solution.
Constraints
1<=n<=10^5
1<=m<=2*(10^5)
1<=a,b<=n
Example
Input:
4 2
1 2
3 4
Output:
1
2 3

please add under hacktoberfest

A game has n levels and m teleporters between them. You win the game if you move from level 1 to level n using every teleporter exactly once.

Can you win the game, and what is a possible way to do it?

Input
The first input line has two integers n and m: the number of levels and teleporters. The levels are numbered 1,2,…,n.

Then, there are m lines describing the teleporters. Each line has two integers a and b: there is a teleporter from level a to level b.

You can assume that each pair (a,b) in the input is distinct.

Output
Print m+1 integers: the sequence in which you visit the levels during the game. You can print any valid solution.

If there are no solutions, print "IMPOSSIBLE".

Constraints
2 ≤ n ≤ 10^5
1 ≤ m ≤ 2*10^5
1 ≤ a,b ≤ n

Example
Input:

5 6
1 2
1 3
2 4
2 5
3 1
4 2
Output:

1 3 1 2 4 2 5

can I contribute to this repo, especially in web development?

I will create a project Landing Page for Car Rental, please @Chifez assign it to me under #hacktoberfest-accepted label

thanks...

It seems this repository is also being excluded.

merge two sorted linked lists without wasting extra space , please it me do it @Chifez thank you.

Stack is a data structure that has many practical applications ex- brower history,etc so i have provided the beginner friendly code to stack. It demonstrates the working of stack in JAVA language. It will help new users to learn the basics of stack

Please assign the issue to me

Made a folder for react projects and added a shop application, PR sent #126

PR#126

Kindly assign me this issue under Hacktoberfest 2023.

Description
The problem Grid Search specifies :
Given an array of strings of digits we have to find the occurrence of a given pattern of digits. In the grid and pattern arrays, each string represents a row in the grid. The Pattern is given and then the grid to be found is given .For example, consider the following grid:

1234567890
0987654321
1111111111
1111111111
2222222222

The pattern array is:

876543
111111
111111

The pattern begins at the second row and the third column of the grid and continues in the following two rows. The pattern is said to be present in the grid. The return value should be YES or NO, depending on whether the pattern is found. In this case, return YES.

Eg.
10 10
7283455864
6731158619
8988242643
3830589324
2229505813
5633845374
6473530293
7053106601
0834282956
4607924137
3 4
9505
3845
3530

Output:- YES

DSA Problem
https://www.hackerrank.com/challenges/the-grid-search/problem

A javascript code to find the second largest element in any given array

im found the typo this contributing.md especially in the section 'terminal' is not @ossamamehmood link repo and then I change to this repo

So I try to fix this typo and in the section ##language-specific folders, I am add javascript

Please assign this to me @Chifez under #hacktoberfest and #hacktoberfest-accepted label.
This will be under Project 2 for Web-Development

Thanks

for easy accessibility

Mathematical application of cost function in Linear Regression