Skip to main content

5 steps to add existing project to your GIT HUB repository [Windows]

this tutorial will tell you how to add existing project to your git hub account.

Step1.
Go to your GITHUB account.
Create New repository 
add repository



Step2.
Fill the required details.
( uncheck create read me ).

Add details
 Step 3.
Open GIT shell from your desktop.





Step 4.
Go to the directory of your project using cd  “path of the project”
Initialize git by using command  git init
Add your files by using command  git add .
Commit your files by command git commit –m ‘first commit’

commands to add git

 STEP 5 Select your repository
Add using command git remote add origin https://github.com/username/projectname.git

Now push the project to git git push -u origin master
push command



Labels:

Comments

Post a Comment

.

Popular posts from this blog

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md
1 comment
Read more

Merge Sort Implementation in JAVA

Merge Sort  is a technique of sorting data with below steps:- 1) Divide the data recursively until it can not  divide more. 2)  Compare the data and sort it. 3) Merge the data again . /* * Merge Sort is based on the concept below points:- * 1) Divide array until it can not be divide. * 2) Merge it again in sorted pattern * * */ public class MergeSort { public static int [] mergeSort ( int arr []) { //check for size if it is one then already sorted int size = arr . length ; if ( size == 1 ) { return arr ; } //find middle (divide an array into two half) int mid = size / 2 ; //first half int [] fhalf = new int [ mid ]; //second half int [] shalf = new int [ size - mid ]; // Copy first half of the array for ( int i = 0 ; i < mid ; i ++) { fhalf [ i ] = arr [ i ]; } // Copy second half of the array for ( int i = mid...
Post a Comment
Read more