update

.github/FUNDING.yml

@@ -0,0 +1 @@
+custom: https://www.buymeacoffee.com/swaazshetty

.github/ISSUE_TEMPLATE/contribution.md

@@ -34,6 +34,7 @@
    eg-git push origin -u swaaz
 - The given link should be copied and pasted in web browser or go to your repo in web browser
 - Create a pull request
+- tag @swaaz under review section
 ## If you are contributing for the first time,then :
 [click here](https://gitme.js.org/)
 

C++/Kosaraju's algorithm.cpp

@@ -0,0 +1,98 @@
+//Name-Avnish Kumar
+//Github id-Avnish010
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+#define mod 100000000
+#define M 0
+#define fastIO                        \
+    ios_base::sync_with_stdio(false); \
+    cin.tie(NULL);                    \
+    cout.tie(NULL)
+#define endl "\n"
+#define mp make_pair
+#define pb push_back
+#define pf push_front
+#define ub upper_bound
+#define lb lower_bound
+#define mod1 1000000009
+#define mem(a, val) memset(a, val, sizeof(a))
+#define vi vector<int>
+#define vvl vector<vector<long>>
+#define vl vector<ll>
+#define vpl vector<pair<ll, ll>>
+#define vpi vector<pair<int, int>>
+#define msi map<string, int>
+vi adj[100005];
+vi adjt[100005];
+int vis[100005];
+vi order; // for first dfs having increasing outtime order
+vi scc;
+void dfs(int v)
+{
+    vis[v] = 1;
+    for (auto x : adj[v])
+    {
+        if (!vis[x])
+        {
+            dfs(x);
+        }
+    }
+    order.pb(v);
+}
+void dfst(int v)
+{
+    vis[v] = 1;
+    for (auto x : adjt[v])
+    {
+        if (!vis[x])
+        {
+            dfst(x);
+        }
+    }
+    scc.pb(v);
+}
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n, m, u, v;
+        cin >> n >> m;
+        for (int i = 1; i <= n; i++)
+        {
+            adj[i].clear(), adjt[i].clear(), vis[i] = 0;
+        }
+        order.clear();
+        for (int i = 1; i <= m; i++)
+        {
+            cin >> u >> v;
+            adj[u].pb(v);
+            adjt[v].pb(u);
+        }
+        for (int i = 1; i <= n; i++)
+        {
+            if (!vis[i])
+                dfs(i);
+        }
+        for (int i = 1; i <= n; i++)
+        {
+            vis[i] = 0;
+        }
+        for (int i = 1; i <= n; i++)
+        {
+            if (!vis[order[n - i]])
+            {
+                scc.clear();
+                dfst(order[n - i]);
+                cout << "dfst is called for" << order[n - i] << " " << endl;
+
+                for (int i : scc)
+                    cout << i << " ";
+                cout << endl;
+            }
+        }
+    }
+}

C++/Kruskal Algorithm.cpp

@@ -0,0 +1,76 @@
+//Name-Avnish Kumar
+//Github id-Avnish010
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+#define mod 100000000
+#define M 0
+#define fastIO                        \
+    ios_base::sync_with_stdio(false); \
+    cin.tie(NULL);                    \
+    cout.tie(NULL)
+#define endl "\n"
+#define mp make_pair
+#define pb push_back
+#define pf push_front
+#define ub upper_bound
+#define lb lower_bound
+#define mod1 1000000009
+#define mem(a, val) memset(a, val, sizeof(a))
+#define vi vector<int>
+#define vvl vector<vector<long>>
+#define vl vector<ll>
+#define vpl vector<pair<ll, ll>>
+#define vpi vector<pair<int, int>>
+#define msi map<string, int>
+
+struct edge
+{
+    int u;
+    int v;
+    int w;
+};
+edge adj[100005];
+edge adj1[200005];
+int par[100005];
+bool comp(edge u, edge v)
+{
+    return u.w < v.w;
+}
+int find(int i)
+{
+    if (par[i] == -1)
+        return i;
+    return par[i] = find(par[i]);
+}
+void set_union(int a, int b)
+{
+    par[b] = a;
+}
+
+int main()
+{
+    int n, m, u, v, w;
+    cin >> n >> m;
+    for (int i = 1; i <= n; i++)
+    {
+        par[i] = -1;
+    }
+    for (int i = 0; i < m; i++)
+    {
+        cin >> adj[i].u >> adj[i].v >> adj[i].w;
+    }
+    sort(adj, adj + m, comp);
+    ll ans = 0;
+    for (int i = 0; i < m; i++)
+    {
+        u = find(adj[i].u);
+        v = find(adj[i].v);
+        if (u != v)
+        {
+            ans += adj[i].w;
+            set_union(u, v);
+        }
+    }
+    cout << ans << endl;
+}

C++/Program - 28/program-28.cpp

@@ -0,0 +1,36 @@
+// C++ program to find number of bins required using
+// next fit algorithm.
+#include <bits/stdc++.h>
+using namespace std;
+
+// Returns number of bins required using next fit
+// online algorithm
+int nextFit(int weight[], int n, int c)
+{
+	// Initialize result (Count of bins) and remaining
+	// capacity in current bin.
+	int res = 0, bin_rem = c;
+
+	// Place items one by one
+	for (int i = 0; i < n; i++) {
+		// If this item can't fit in current bin
+		if (weight[i] > bin_rem) {
+			res++; // Use a new bin
+			bin_rem = c - weight[i];
+		}
+		else
+			bin_rem -= weight[i];
+	}
+	return res;
+}
+
+// Driver program
+int main()
+{
+	int weight[] = { 2, 5, 4, 7, 1, 3, 8 };
+	int c = 10;
+	int n = sizeof(weight) / sizeof(weight[0]);
+	cout << "Number of bins required in Next Fit : "
+		<< nextFit(weight, n, c);
+	return 0;
+}

C++/Program - 28/readme.md

@@ -0,0 +1,7 @@
+## Given n items of different weights and bins each of capacity c, assign each item to a bin such that number of total used bins is minimized. It may be assumed that all items have weights smaller than bin capacity.
+
+### Example: Input: weight[] = {4, 8, 1, 4, 2, 1} Bin Capacity c = 10 Output: 2 We need minimum 2 bins to accommodate all items First bin contains {4, 4, 2} and second bin {8, 1, 1}
+
+### Input: weight[] = {9, 8, 2, 2, 5, 4} Bin Capacity c = 10 Output: 4 We need minimum 4 bins to accommodate all items.
+
+### Input: weight[] = {2, 5, 4, 7, 1, 3, 8}; Bin Capacity c = 10 Output: 3

C++/Program 22/adding_two_string.cpp

@@ -0,0 +1,59 @@
+/*
+Program : To add 2 string
+
+this Program is Contributed by Abhishek Jaiswal
+*/
+
+#include <iostream> 
+using namespace std; 
+
+int Len(string &str1, string &str2) 
+{ 
+    int len1 = str1.size(); 
+    int len2 = str2.size(); 
+    if (len1 < len2) 
+    { 
+        for (int i = 0 ; i < len2 - len1 ; i++) 
+            str1 = '0' + str1; 
+        return len2; 
+    } 
+    else if (len1 > len2) 
+    { 
+        for (int i = 0 ; i < len1 - len2 ; i++) 
+            str2 = '0' + str2; 
+    } 
+    return len1; 
+}
+
+string add( string a, string b ) 
+{ 
+    string result; 
+    int len = Len(a, b); 
+
+    int carry = 0;
+    for (int i = len-1 ; i >= 0 ; i--) 
+    { 
+        int aBit = a.at(i) - '0'; 
+        int bBit = b.at(i) - '0'; 
+        int sum = (aBit ^ bBit ^ carry)+'0'; 
+
+        result = (char)sum + result; 
+        carry = (aBit & bBit) | (bBit & carry) | (aBit & carry); 
+    } 
+
+    if (carry) 
+        result = '1' + result; 
+
+    return result; 
+} 
+
+int main() 
+{ 
+    string str1,str2;
+    cout<<"Enter the string 1 :";
+    cin>>str1;
+    cout<<"Enter the string 2 :";
+    cin>>str2;
+    cout << "Sum is " << add(str1, str2); 
+    return 0; 
+} 

C++/Program 22/readme.md

@@ -0,0 +1,3 @@
+Program : To add Two Binary Number 
+Input : Two Number consitising of 0 and 1
+Output : Number Constisting of 0 and 1

C++/Program 23/readme.md

@@ -0,0 +1,4 @@
+Program :To find the sum of square of binomial coefficient
+Input : Integer
+Output : Integer
+

C++/Program 23/sum_of_square_of_binomial_coefficient.cpp

@@ -0,0 +1,32 @@
+/*
+Program :To find the sum of square of  
+binomial coefficient. 
+
+This Program is contributed by Abhishek Jaiswal
+*/
+#include <bits/stdc++.h>
+using namespace std;
+
+int factorial(int begin, int end)
+{
+    int num = 1;
+    for (int i = begin; i <= end; i++)
+        num *= i;
+
+    return num;
+}
+
+int square(int n)
+{
+    return factorial(n + 1, 2 * n) / factorial(1, n);
+}
+
+int main()
+{
+    int n;
+    cout << "Enter the number :";
+    cin >> n;
+    cout << "The Sum of Square is " << square(n) << endl;
+    return 0;
+}
+

C++/Program 26/PrimeNo.cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n,k=0;
+    cout<<"Check the no is prime or not"<<endl;
+    cin>>n;
+    for(int i=1;i<=n;i++){
+        if(n%i==0){
+            k++;
+        }
+    }
+    if(k==2){
+        cout<<"No. is Prime";
+    }
+    else{
+        cout<<"No. is not prime";
+    }
+
+    return 0;
+}

C++/Program 26/ReadMe.md

@@ -0,0 +1,7 @@
+Program to check whether the no. is prime or not
+
+Input: 6
+Output: No. is not prime
+
+Input: 5
+Output: No. is prime

C++/Program 28/README.md

@@ -0,0 +1 @@
+program for linear search using menu driven program