I would be adding the solution to this problem in Java. Please assign me this task.

Hi,

I want to add a Python script which acts as a meta-searcher to query multiple Torrent-sites at once. I did this as a contribution during Hacktoberfest ^^

PR #275

I've created a small Python script to scrape articles from Medium.com to extend the available scripts in the Python subfolder for Hacktoberfest.

PR #277

Hii there first of all sorry for all the interested candidate who wants to contribute in this repo , Since as we all know many repo has been already excluded from hacktoberfest because of many acceptance of pr . That's why to save our already contributed member we should stop accepting any more pr in order to protect our community.

Here will create a tkinter based GUI application which will allow user to correct the wrong spelling correctly.

#421
Include PRs in the right path (child folders)

Here will create a GUI based virtual keyboard using Python language.

#296 please consider for hacktoberfest 2021

This folder is missing an implementation of Linked list

The tracker will track cases, deaths and recovered cases worldwide and also in every country.
Can I work on this?

#include
#include
using namespace std;

// here maxD represent the diameter of the tree
int maxD = -1 , maxNode = -1 ;
// maxNode represents node at maximum distance

// declaring the visited node as we will be using the DFS
int vis[8] ;

void createEdge( int a , int b , vector graph[] ){

 // creating undireted edges between the connected nodes
 graph[a].push_back(b) ;
 graph[b].push_back(a) ;

}

void DFS( vector graph[] , int node , int d )
{
// marking the node as visited
vis[node] = 1 ;

// if the distance from root is greater then maximum Distance then updating the maximum value of distance
// also storing the maxNode no. as this node is now at the farthest distance
if( d > maxD )
{
    maxNode = node ;
    maxD = d ;
}

 // applying the standard dfs 
for( auto x : graph[node] )
{
    if( vis[x] == 0 )
    {
        DFS( graph , x , d+1 ) ;
    }
}

}

int main()
{

// first creating the nodes of the graph
vector<int> graph[8] ;

// now creating the edges of the tree as shown in the image of  this article
createEdge( 1 , 2 , graph ) ;
createEdge( 2 , 3 , graph ) ;
createEdge( 3 , 7 , graph ) ;
createEdge( 2 , 4 , graph ) ;
createEdge( 4 , 5 , graph ) ;
createEdge( 4 , 6 , graph ) ;

 // Applyting DFS from node 1
 DFS( graph , 1 , 1 ) ;
 // we could have choosen any node in the graph but for simplicity we have choosen node 1

 // making every node unvisited as we will be applying DFS
 maxD = -1 ;
 for( int i = 1 ; i<=8 ; i++ )
 {
     vis[i] = 0 ;
 }
 
 // applying the dfs for the second time as this will give the diameter of the tree
 DFS( graph , maxNode , 1  ) ;

 // Now printing the maximum diameter of the tree
 cout<<maxD<<" is the diameter of the tree "<<endl;


return 0;

}