New python program

.vscode/settings.json

@@ -0,0 +1,3 @@
+{
+    "python.pythonPath": "C:\\Users\\deepa\\envs\\conda\\Scripts\\python.exe"
+}

Language/C#/Fatorial.cs

@@ -0,0 +1,15 @@
+
+// C# program for Fatorial
+using System;
+public class Fatorial
+{
+    public static void Main(string[] args)
+    {
+        Console.Write("Enter the factorial you want to find: ");
+        Console.WriteLine(Fat(int.Parse(Console.ReadLine())));
+    }
+    public static int Fat(int a)
+    {
+        return a == 0 ? 1 : a*Fat(a-1);
+    }
+}

Language/C#/IsPrime.cs

@@ -0,0 +1,26 @@
+// C# program to determine is a prime number or not
+using System;
+
+public class IsPrime
+{
+    public static void Main(string[] args)
+    {
+        Console.Write("Enter a number you want to find out: ");
+        Console.WriteLine(IsPrime(Convert.ToInt32(Console.ReadLine())) ? "Yes" : "No");
+    }
+
+    public static bool IsPrime(int x)
+    {
+        if (x == 2) return true;
+        if (x < 2 || x % 2 == 0) return false;
+        for (int i = 3; i <= Math.Sqrt(x); i += 2)
+        {
+            if (x % i == 0)
+            {
+                return false;
+            }
+        }
+
+        return true;
+    }
+}

Language/C++/CelebrityProblem.cpp

@@ -0,0 +1,11 @@
+int getId(int M[MAX][MAX], int n)
+{
+    int cel = 0;
+    for (int i = 1; i < n; i++)
+        if (M[cel][i])
+            cel = i; //prev cel can't be celebrity
+    for (int i = 0; i < n; i++)
+        if ((cel != i) && (M[cel][i] || !M[i][cel]))
+            return -1;
+    return cel;
+}

Language/C++/EquilibriumPoint.cpp

@@ -0,0 +1,22 @@
+int equilibriumPoint(long long a[], int n)
+{
+    int sum = 0;     // initialize sum of whole array
+    int leftsum = 0; // initialize leftsum
+
+    /* Find sum of the whole array */
+    for (int i = 0; i < n; ++i)
+        sum += a[i];
+
+    for (int i = 0; i < n; ++i)
+    {
+        sum -= a[i]; // sum is now right sum for index i
+
+        if (leftsum == sum)
+            return i+1;
+
+        leftsum += a[i];
+    }
+
+    /* If no equilibrium index found, then return 0 */
+    return -1;
+}

Language/C++/JumpGame 2.cpp

@@ -0,0 +1,48 @@
+//O(n)
+class Solution
+{
+public:
+    int jump(vector<int> &nums)
+    {
+        int n = nums.size();
+        int pos(0), reach(0), jumps(0);
+
+        for (int i = 0; i < n - 1; i++)
+        {
+            reach = max(reach, i + nums[i]);
+            if (pos == i)
+            {
+                pos = reach;
+                jumps++;
+            }
+        }
+
+        return jumps;
+    }
+};
+
+//O(n^2)
+class Solution
+{
+public:
+    int jump(vector<int> &nums)
+    {
+        int n = nums.size();
+        int dp[n];
+        memset(dp, 0, sizeof(dp));
+        dp[0] = 0;
+        for (int i = 1; i < n; i++)
+        {
+            int minV = INT_MAX;
+            for (int j = 0; j < i; j++)
+                if (j + nums[j] >= i)
+                    minV = min(minV, dp[j]);
+            if (minV != INT_MAX)
+                dp[i] = minV + 1;
+            else
+                dp[i] = INT_MAX;
+        }
+
+        return dp[n - 1];
+    }
+};

Language/C++/LargestSumContiguousSubarray.cpp

@@ -0,0 +1,48 @@
+// C++ program to print largest contiguous array sum 
+
+#include<iostream> 
+#include<climits> 
+using namespace std; 
+
+int maxSubArraySum(int a[], int size) 
+{ 
+    int max_so_far = INT_MIN, max_ending_here = 0, 
+       start =0, end = 0, s=0; 
+
+    for (int i=0; i< size; i++ ) 
+    { 
+        max_ending_here += a[i]; 
+
+        if (max_so_far < max_ending_here) 
+        { 
+            max_so_far = max_ending_here; 
+            start = s; 
+            end = i; 
+        } 
+
+        if (max_ending_here < 0) 
+        { 
+            max_ending_here = 0; 
+            s = i + 1; 
+        } 
+    } 
+    cout << "Maximum contiguous sum is "
+        << max_so_far << endl; 
+    cout << "Starting index "<< start 
+        << endl << "Ending index "<< end << endl; 
+} 
+
+int main() 
+{ 
+    int n;
+    cout << "Enter number of elements in array \n";
+    cin >> n;
+
+    int a[n];
+    for(int i = 0; i < n; i++) {
+        cout << "Enter element " << i + 1 << " -\n";
+        cin >> a[i]; 
+    }
+    int max_sum = maxSubArraySum(a, n); 
+    return 0; 
+} 

Language/C++/LeadersInArray.cpp

@@ -0,0 +1,39 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+ {
+    int t;
+    cin >> t;
+    while(t--)
+    {
+        long long int n;
+        cin >> n;
+        long long int a[n];
+        for(int i=0;i<n;i++)
+            cin >> a[i];
+
+       vector<int> v;
+
+       int maxV = INT_MIN;
+       for(int i=n-1;i>=0;i--)
+       {
+
+          if(a[i]>=maxV)
+          {
+              maxV = a[i];
+              v.push_back(maxV);
+          }
+       }   
+
+       reverse(v.begin(),v.end());
+       //maxV = a[n-1];
+       //v.push_back(maxV);
+
+
+       for(int i=0;i<v.size();i++)
+            cout<< v[i] << " ";
+        cout<<endl;
+    }
+	return 0;
+}

Language/C++/sieve.cpp

@@ -0,0 +1,34 @@
+//Printing the prime numbers upto a given number 'n' in O(n log log n) time.
+// as it takes O(n) time in iterartive method.
+#include <iostream>
+#include <string.h>
+using namespace std;
+int main()
+{
+    int n;
+    cin >> n;
+    int arr[n + 1];
+    memset(arr, 0, sizeof(arr));
+    arr[0] = 1;
+    arr[1] = 1;
+    for (int i = 2; i <= n; i++)
+    {
+        if (arr[i] == 0)
+        {
+            for (int j = 2; j <= n / i; j++)
+            {
+                if (arr[i * j] != 1)
+                {
+                    arr[i * j] = 1;
+                }
+            }
+        }
+    }
+    for (int i = 0; i <= n; i++)
+    {
+        if (arr[i] == 0)
+        {
+            cout << i << " ";
+        }
+    }
+}

Language/C++/topsort.cpp

@@ -0,0 +1,96 @@
+#include<bits/stdc++.h>
+#define Graph unordered_map<int, vector<int>>
+#define vi vector<int>
+#define vb vector<bool>
+using namespace std;
+//  Top sort is implemented whenever there is no cycle in DAG
+
+bool dfs (int curr, vb visited, Graph graph) {
+  if(!visited[curr]){
+
+    visited[curr] = true;
+    for(int i=0; i < graph[curr].size(); i++)
+      return dfs(graph[curr][i], visited, graph);
+
+  } else
+    return true;
+}
+
+bool detectCycle(int edges, Graph graph) {
+
+  // initialises a visited array of type bool
+    vb visited(edges, false);
+
+    for(auto it : graph) {
+
+      visited[it.first] = true;
+      int sz = it.second.size();
+
+      for(int i=0; i<sz; i++) {
+          // do dfs and check for visited is once againg visiting or not
+          if(dfs( it.second[i], visited, graph))
+            return true;
+      }
+      visited[it.first] = false;
+    }
+    // dfs checked for all vertices and there we found no Cycle
+      return false;
+}
+
+void topSortWithDfs(int curr, vector<int> &result , Graph graph, vb &visitedarray){
+
+  if(!visitedarray[curr]) {
+    visitedarray[curr]=true;
+
+    for(int i=0; i<graph[curr].size(); i++)
+      if(!visitedarray[graph[curr][i]])
+        topSortWithDfs(graph[curr][i], result, graph, visitedarray);
+
+      result.push_back(curr);
+  }
+}
+
+vi topologicalsort(int edges, Graph graph) {
+
+    if(detectCycle(edges, graph)) {
+      cout<< "Oops there is cycle in graph.";
+      return {};
+    }
+
+
+    vector<int> result;
+    vb visitedarray(edges, false);
+
+    for(auto item : graph)
+          topSortWithDfs(item.first, result, graph, visitedarray);
+
+    reverse(result.begin(), result.end());
+    return result;
+}
+
+
+int main() {
+
+  Graph graph;
+  std::cout << "Enter total number of edges : " << '\n';
+  freopen("input.txt", "r", stdin);
+  freopen("output.txt", "w", stdout);
+
+  int edges;
+  cin>>edges;
+
+  // Graph input from user
+  int tempedges = edges;
+  while(tempedges--) {
+    int x;
+    int y;
+    cin >> x >> y;
+    graph[x].push_back(y);
+  }
+
+
+  for( auto x : topologicalsort(edges, graph))
+    cout<< x << " ";
+
+  return 0;
+}

Language/Go/caluclate_bill.go

@@ -0,0 +1,15 @@
+package main
+
+import (  
+    "fmt"
+)
+
+func calculateBill(price, no int) int {  
+    var totalPrice = price * no
+    return totalPrice
+}
+func main() {  
+    price, no := 90, 6
+    totalPrice := calculateBill(price, no)
+    fmt.Println("Total price is", totalPrice)
+}