3 | using namespace std;
4 |
5 | int main()
6 | {
7 | cout<<"Name: Harshita Bansal";
8 | cout<<"Github ID: harshulab";
9 | }
10 |
--------------------------------------------------------------------------------
/contributions/elizabeth-qiu/helloworld.java:
--------------------------------------------------------------------------------
1 | public class HelloWorld {
2 | public static void main (String[] args) {
3 | System.out.println("Hello world! I'm Elizabeth and I love tech, music, physics, and hack club!");
4 | }
5 | }
6 |
--------------------------------------------------------------------------------
/cloud-function/package.json:
--------------------------------------------------------------------------------
1 | {
2 | "name": "pr-webhook",
3 | "version": "1.0.0",
4 | "main": "index.js",
5 | "author": "Shubham Bhandari",
6 | "license": "MIT",
7 | "dependencies": {
8 | "firebase": "^7.23.0"
9 | }
10 | }
11 |
--------------------------------------------------------------------------------
/contributions/Keshaw Soni:
--------------------------------------------------------------------------------
1 | Hey i am Keshaw, 1st year b-tech CSE
2 | github username - Keshaw08
3 |
4 |
5 | Program to print patterns in different programming languages.
6 |
7 | javascript - console.log("Hello World")
8 | python - print("Hello World")
9 |
--------------------------------------------------------------------------------
/webapp/firestore.rules:
--------------------------------------------------------------------------------
1 | rules_version = '2';
2 | service cloud.firestore {
3 | match /databases/{database}/documents {
4 | match /{document=**} {
5 | allow read, write: if
6 | request.time < timestamp.date(2020, 11, 7);
7 | }
8 | }
9 | }
--------------------------------------------------------------------------------
/contributions/udit_agarwal/forth file:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | My First code
5 |
6 | My name is udit agarwal
7 | I am cureently as student in JKLU college
8 |
9 |
10 |
11 |
12 |
--------------------------------------------------------------------------------
/contributions/mridul/add.py:
--------------------------------------------------------------------------------
1 | a=int(input("give frist number = "))
2 | b=int(input("give second number = "))
3 | print("addition result is",a+b)
4 | print("subtraction result is",a-b)
5 | print("multiplication result is",a*b)
6 | print("divison result is",a/b)
7 |
--------------------------------------------------------------------------------
/webapp/src/BaseComponents/UserId.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import TextField from '@material-ui/core/TextField';
3 |
4 | export default function userId(props) {
5 | return (
6 |
7 | );
8 | }
9 |
--------------------------------------------------------------------------------
/contributions/PayalSharma/file1:
--------------------------------------------------------------------------------
1 | import cv2
2 | import time
3 | import numpy as np
4 |
5 | cap = cv2.VideoCapture("video.mp4")
6 | time.sleep(3)
7 | background=0
8 |
9 | for i in range(30):
10 | ret,background= cap.read()
11 |
12 | backgroud=np.flip(background,axis=1)
13 |
--------------------------------------------------------------------------------
/contributions/mridul/code.txt:
--------------------------------------------------------------------------------
1 | import numpy
2 | matrix_1=mult_matrix
3 | print('A.a')
4 | print(matrix_1)
5 | inverse_a=numpy.array([[0,1],[1,-3]])
6 | print('a-1')
7 | print(inverse_a)
8 | multy_matrix=numpy.dot(inverse_a,matrix_1)
9 | print('decoded matrix =')
10 | print(multy_matrix)
11 |
--------------------------------------------------------------------------------
/webapp/src/setupTests.js:
--------------------------------------------------------------------------------
1 | // jest-dom adds custom jest matchers for asserting on DOM nodes.
2 | // allows you to do things like:
3 | // expect(element).toHaveTextContent(/react/i)
4 | // learn more: https://github.com/testing-library/jest-dom
5 | import '@testing-library/jest-dom/extend-expect';
6 |
--------------------------------------------------------------------------------
/contributions/anujVerma/zoos.py:
--------------------------------------------------------------------------------
1 | str = str(input())
2 | x = str.find("o")
3 | # i=0
4 | count=0
5 | a = len(str) # length of array
6 |
7 | while count < x :
8 | count = count+1 # no. of z
9 |
10 | o = a-count
11 | if 2*count == o:
12 | print("Yes")
13 | else:
14 | print("No")
15 |
--------------------------------------------------------------------------------
/webapp/src/BaseComponents/GraphProgress.js:
--------------------------------------------------------------------------------
1 | import CircularProgress from "@material-ui/core/CircularProgress";
2 | import React from 'react';
3 | import './GraphProgress.css';
4 | export default function GraphProgress() {
5 | return (
6 |
7 | );
8 | }
9 |
--------------------------------------------------------------------------------
/contributions/PayalSharma/into.txt:
--------------------------------------------------------------------------------
1 | hi, I am Payal a hodophile, an adventure-seeker, and a computer science undergraduate student.
2 | I am data science and Machine learning enthusiast and a travel junkie who has an insatiable thirst for travel and adventure!
3 |
4 | Come say hi—we may be future collaborators, partners, or friends!
5 |
--------------------------------------------------------------------------------
/contributions/palindrome_Aayush Mehta:
--------------------------------------------------------------------------------
1 | def isPalindrome(str):
2 |
3 | for i in range(0, int(len(str)/2)):
4 | if str[i] != str[len(str)-i-1]:
5 | return False
6 | return True
7 |
8 | s = "malayalam"
9 | ans = isPalindrome(s)
10 |
11 | if (ans):
12 | print("Yes")
13 | else:
14 | print("No")
15 |
--------------------------------------------------------------------------------
/webapp/src/App.test.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import { render } from '@testing-library/react';
3 | import App from './App';
4 |
5 | test('renders learn react link', () => {
6 | const { getByText } = render();
7 | const linkElement = getByText(/learn react/i);
8 | expect(linkElement).toBeInTheDocument();
9 | });
10 |
--------------------------------------------------------------------------------
/contributions/anujVerma/Ladderophilia.c:
--------------------------------------------------------------------------------
1 | //Name: Anuj Verma
2 |
3 | #include
4 | int main()
5 | {
6 | int N,i;
7 | scanf("%d",&N);
8 | for(i=1;i<=N;i++)
9 | {
10 | printf("* *\n");
11 | printf("* *\n");
12 | printf("*****\n");
13 | }
14 | printf("* *\n");
15 | printf("* *\n");
16 |
17 |
18 | return 0;
19 | }
20 |
--------------------------------------------------------------------------------
/webapp/src/App.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import './App.css';
3 | import 'bootstrap/dist/css/bootstrap.min.css';
4 | import Navigation from "./Components/Navigation";
5 |
6 | function App() {
7 | return (
8 |
9 |
10 |
11 |
12 |
13 | );
14 | }
15 |
16 | export default App;
17 |
--------------------------------------------------------------------------------
/contributions/anujVerma/CharSum.c:
--------------------------------------------------------------------------------
1 | #include
2 |
3 | int main()
4 | {
5 | char s[100];
6 | int i,j[100],sum=0;
7 | scanf("%s",&s);
8 | for(i=0;s[i]!='\0';i++)
9 | {
10 | j[i]=s[i]-96;
11 |
12 |
13 | }
14 |
15 |
16 | for(i=0;s[i]!='\0';i++)
17 | {
18 | sum=sum+j[i];
19 |
20 | }
21 | printf("%d",sum);
22 | return 0;
23 | }
24 |
--------------------------------------------------------------------------------
/contributions/Shubham-Bhandari/Update-chrome-driver.sh:
--------------------------------------------------------------------------------
1 | #!/usr/bin/env bash
2 | #set -e
3 | base="/home/sb/Downloads/temp/"
4 | saveLoc='/usr/bin/'
5 | wget -qP ${base} "https://chromedriver.storage.googleapis.com/2.38/chromedriver_linux64.zip"
6 | sudo unzip -o ${base}chromedriver_linux64.zip -d ${saveLoc}
7 | sudo chmod 755 ${saveLoc}chromedriver
8 | rm -rf ${base}chromedriver_linux64.zip
9 |
--------------------------------------------------------------------------------
/contributions/anujVerma/Life.c:
--------------------------------------------------------------------------------
1 |
2 | #include
3 |
4 | int main(){
5 | long long int i=0;
6 | long long int arr[100000];
7 |
8 | while(arr[i-1]!=42)
9 | {
10 | scanf("%d \n",&arr[i]);
11 | i++;
12 | }
13 |
14 | i=0;
15 | while(arr[i]!=42)
16 | {
17 | printf("%d \n",arr[i]);
18 | i++;
19 | }
20 |
21 |
22 | return 0;
23 | }
24 |
25 |
--------------------------------------------------------------------------------
/contributions/sathiranipun/fibonacci.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main() {
3 | int i, n, x = 0, y = 1, z;
4 | printf("Enter the number of terms: ");
5 | scanf("%d", &n);
6 | printf("Fibonacci Series: ");
7 |
8 | for (i = 1; i <= n; ++i) {
9 | printf("%d, ", x);
10 | z = x + y;
11 | x = y;
12 | y = z;
13 | }
14 |
15 | return 0;
16 | }
--------------------------------------------------------------------------------
/contributions/kanchanachathuranga/fibonacciinc.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main() {
3 | int i, n, x = 0, y = 1, z;
4 | printf("Enter the number of terms: ");
5 | scanf("%d", &n);
6 | printf("Fibonacci Series: ");
7 |
8 | for (i = 1; i <= n; ++i) {
9 | printf("%d, ", x);
10 | z = x + y;
11 | x = y;
12 | y = z;
13 | }
14 |
15 | return 0;
16 | }
--------------------------------------------------------------------------------
/contributions/pyramid:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 |
4 | int main()
5 | {
6 | int rows;
7 |
8 | cout << "Enter number of rows: ";
9 | cin >> rows;
10 |
11 | for(int i = 1; i <= rows; ++i)
12 | {
13 | for(int j = 1; j <= i; ++j)
14 | {
15 | cout << "* ";
16 | }
17 | cout << "\n";
18 | }
19 | return 0;
20 | }
21 |
--------------------------------------------------------------------------------
/contributions/sathiranipun/fibonacci.py:
--------------------------------------------------------------------------------
1 | n = int(input("How many terms :"))
2 | x, y = 0, 1
3 | count = 0
4 | if n <= 0:
5 | print("Enter a positive integer : ")
6 | elif n == 1:
7 | print("Fibonacci Sequence upto",n,":")
8 | print(x)
9 | else:
10 | print("Fibonacci sequence:")
11 | while count < n:
12 | print(x)
13 | z = x + y
14 | x = y
15 | y = z
16 | count += 1
--------------------------------------------------------------------------------
/contributions/gauravbisht005/SumOfArrayElements.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 |
4 | int sum(int arr[], int n){
5 | int sum = 0;
6 | for (int i = 0; i < n; i++)
7 | sum += arr[i];
8 | return sum;
9 | }
10 | int main(){
11 | int arr[] = {12, 3, 4, 15};
12 | int n = sizeof(arr) / sizeof(arr[0]);
13 | cout << "Sum of given array is: " << sum(arr, n);
14 | return 0;
15 | }
16 |
--------------------------------------------------------------------------------
/contributions/Shruti Jain/hw.txt:
--------------------------------------------------------------------------------
1 | n=int(input("enter a number between 2 and 10 "))
2 | while(n>10 or n<2):
3 | print("invalid number")
4 | n=int(input("please enter a valid number"))
5 | i=1
6 | while(i<=10):
7 | print(n, "*" ,i, "=", n*i )
8 | i=i+1
9 |
10 |
11 |
12 |
13 | n=int(input("enter a number n "))
14 | i=1
15 | while(n**i<=100):
16 | print(n**i)
17 | i=i+1
--------------------------------------------------------------------------------
/contributions/Shruti Solani/Palindrome.py:
--------------------------------------------------------------------------------
1 | def check_palindrome(str):
2 | n = len(str)
3 | str_list = list(str)
4 | for i in range(n//2 + 1):
5 | if(str_list[i] == str_list[n-i-1]):
6 | pass
7 | else:
8 | print("Not Palindrome")
9 | exit()
10 | print("Palindrome")
11 |
12 |
13 | if __name__ == '__main__':
14 | str = input()
15 | check_palindrome(str)
16 |
--------------------------------------------------------------------------------
/webapp/firebase.json:
--------------------------------------------------------------------------------
1 | {
2 | "firestore": {
3 | "rules": "firestore.rules",
4 | "indexes": "firestore.indexes.json"
5 | },
6 | "hosting": {
7 | "public": "build",
8 | "ignore": [
9 | "firebase.json",
10 | "**/.*",
11 | "**/node_modules/**"
12 | ],
13 | "rewrites": [
14 | {
15 | "source": "**",
16 | "destination": "/index.html"
17 | }
18 | ]
19 | }
20 | }
21 |
--------------------------------------------------------------------------------
/contributions/Varun Rawat/Backyard boy:
--------------------------------------------------------------------------------
1 | Dance with me in my backyard boy
2 | Looking super fine in your corduroy
3 | Drive me round the block
4 | We can go in a loop
5 | And we'll turn the volume up on some
6 | Good boy band tunes
7 | Love to feel the fresh air
8 | I can feel your eyes stare
9 | And I'm not gonna lie
10 | I get a little bit scared
11 | My heart is on wings
12 | I'm living in dreams
13 | And at the top of our lungs, we sing
14 |
--------------------------------------------------------------------------------
/webapp/src/Components/Contributors.css:
--------------------------------------------------------------------------------
1 | .headname{
2 | padding-top: 0px;
3 | text-align: center;
4 | font-size: 200%;
5 | margin-bottom: 50px;
6 |
7 | }
8 |
9 | .text-head{
10 | position: relative;
11 | top: 10px;
12 | }
13 | @media only screen and (max-width: 494px) {
14 | .headname{
15 | padding-top: 40px;
16 | padding-left: 20px;
17 | padding-right: 20px;
18 | }
19 |
20 | }
21 |
--------------------------------------------------------------------------------
/webapp/src/index.css:
--------------------------------------------------------------------------------
1 | @import url('https://fonts.googleapis.com/css2?family=Work+Sans&display=swap');
2 |
3 | body {
4 | margin: 0;
5 | font-family: 'Work Sans', sans-serif !important;
6 | -webkit-font-smoothing: antialiased;
7 | -moz-osx-font-smoothing: grayscale;
8 | }
9 | .MuiSvgIcon-root{
10 | color: white;
11 | }
12 |
13 | code {
14 | font-family: source-code-pro, Menlo, Monaco, Consolas, 'Courier New',
15 | monospace;
16 | }
17 |
--------------------------------------------------------------------------------
/contributions/floyd triangle:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 |
4 | int main()
5 | {
6 | int rows, number = 1;
7 |
8 | cout << "Enter number of rows: ";
9 | cin >> rows;
10 |
11 | for(int i = 1; i <= rows; i++)
12 | {
13 | for(int j = 1; j <= i; ++j)
14 | {
15 | cout << number << " ";
16 | ++number;
17 | }
18 |
19 | cout << endl;
20 | }
21 |
22 | return 0;
23 | }
24 |
--------------------------------------------------------------------------------
/contributions/fibonacci.py:
--------------------------------------------------------------------------------
1 | # Function for nth Fibonacci number
2 |
3 | def Fibonacci(n):
4 | if n<=0:
5 | print("Incorrect input")
6 | # First Fibonacci number is 0
7 | elif n==1:
8 | return 0
9 | # Second Fibonacci number is 1
10 | elif n==2:
11 | return 1
12 | else:
13 | return Fibonacci(n-1)+Fibonacci(n-2)
14 |
15 | # Driver Program
16 |
17 | print(Fibonacci(9))
18 |
19 | #This code is contributed by Aishwaryaditya jha
20 |
--------------------------------------------------------------------------------
/contributions/Prateek_Agarwal/pattern.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 | int main()
4 | {
5 | int rows;
6 | cin>>rows;
7 | for(int i=rows-1;i>=0;i--)
8 | {
9 | for(int j=0;j
2 | using namespace std;
3 |
4 | int largest(int arr[], int n){
5 | int i;
6 | int max = arr[0];
7 | for (i = 1; i < n; i++)
8 | if (arr[i] > max)
9 | max = arr[i];
10 | return max;
11 | }
12 | int main(){
13 | int arr[] = {10, 324, 45, 90, 9808};
14 | int n = sizeof(arr) / sizeof(arr[0]);
15 | cout << "Largest element in given array is: "<< largest(arr, n);
16 | return 0;
17 | }
18 |
--------------------------------------------------------------------------------
/contributions/PayalSharma/file2:
--------------------------------------------------------------------------------
1 | from bs4 import BeautifulSoup
2 | import requests
3 | import re
4 | import pandas as pd
5 | import numpy as np
6 | from PyInquirer import prompt
7 | import os
8 | import signal
9 | import sys
10 | import requests
11 | page_link ='https://www.zigwheels.com/reviews-advice/reviews/tata-harrier-first-drive-review/32481/%23leadform#leadform'
12 | page_response = requests.get(page_link, timeout=5)
13 | soup = BeautifulSoup(page_response.text, 'html.parser')
14 | print(soup.prettify())
15 |
--------------------------------------------------------------------------------
/contributions/Saumpii/palindrome.java:
--------------------------------------------------------------------------------
1 | class PalindromeExample{
2 | public static void main(String args[]){
3 | int r,sum=0,temp;
4 | int n=454;//It is the number variable to be checked for palindrome
5 |
6 | temp=n;
7 | while(n>0){
8 | r=n%10; //getting remainder
9 | sum=(sum*10)+r;
10 | n=n/10;
11 | }
12 | if(temp==sum)
13 | System.out.println("palindrome number ");
14 | else
15 | System.out.println("not palindrome");
16 | }
17 | }
--------------------------------------------------------------------------------
/contributions/Prakhar Saxena/My first REpo.java:
--------------------------------------------------------------------------------
1 | package Assignment1;
2 | import java.util.*;
3 |
4 | public class ques_1 {
5 |
6 | /**
7 | * @param args
8 | */
9 | public static void main(String[] args) {
10 | Scanner ques1 = new Scanner(System.in);
11 | System.out.print("Enter a number1: ");
12 |
13 | int a =ques1.nextInt();
14 | System.out.print("Enter a number2:");
15 | int b = ques1.nextInt();
16 | int c = (a*a)+(b*b*b);
17 | System.out.print((a*a)+" + "+(b*b*b)+" = "+c);
18 |
19 | }
20 |
21 | }
22 |
--------------------------------------------------------------------------------
/contributions/kanchanachathuranga/factorial.c:
--------------------------------------------------------------------------------
1 | #include
2 | int fact (int);
3 | int main()
4 | {
5 | int n,f;
6 | printf("Enter the number ?");
7 | scanf("%d",&n);
8 | f = fact(n);
9 | printf("factorial = %d",f);
10 | }
11 | int fact(int n)
12 | {
13 | if (n==0)
14 | {
15 | return 0;
16 | }
17 | else if ( n == 1)
18 | {
19 | return 1;
20 | }
21 | else
22 | {
23 | return n*fact(n-1);
24 | }
25 | }
--------------------------------------------------------------------------------
/webapp/src/index.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import ReactDOM from 'react-dom';
3 | import './index.css';
4 | import App from './App';
5 | import * as serviceWorker from './serviceWorker';
6 |
7 | ReactDOM.render(
8 | ,
9 | document.getElementById('root')
10 | );
11 |
12 | // If you want your app to work offline and load faster, you can change
13 | // unregister() to register() below. Note this comes with some pitfalls.
14 | // Learn more about service workers: https://bit.ly/CRA-PWA
15 | serviceWorker.unregister();
16 |
--------------------------------------------------------------------------------
/contributions/kanchanachathuranga/palindromeinc.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main() {
3 | int n, revnum = 0, remaind, firstnum;
4 | printf("Enter Number: ");
5 | scanf("%d", &n);
6 | firstnum = n;
7 |
8 | while (n != 0) {
9 | remaind = n % 10;
10 | revnum = revnum * 10 + remaind;
11 | n /= 10;
12 | }
13 |
14 | if (firstnum == revnum )
15 | printf("%d is a palindrome.", firstnum);
16 | else
17 | printf("%d is not a palindrome.", firstnum);
18 | return 0;
19 | }
20 |
--------------------------------------------------------------------------------
/contributions/Prakhar Saxena/my fourth code.java:
--------------------------------------------------------------------------------
1 | package Assignment1;
2 | import java.util.*;
3 | public class ques_12 {
4 |
5 | public static void main(String[] args) {
6 | // TODO Auto-generated method stub
7 | Scanner ques12 = new Scanner(System.in);
8 | System.out.print("Enter 1st number: ");
9 | int a,b,c,d,e;
10 | a = ques12.nextInt();
11 | System.out.print("Enter 2nd number: ");
12 | b= ques12.nextInt();
13 | c= b%10;
14 | d = c + a ;
15 | e= b- c;
16 | System.out.print("Product is: "+(d*e));
17 | }
18 |
19 | }
20 |
--------------------------------------------------------------------------------
/contributions/Shrey Tank/Python/MonkeyAndCoconutProblem.py:
--------------------------------------------------------------------------------
1 | i=int(input())
2 | n=int(input())
3 | for x in range(1,i+1):
4 | j=n//i
5 | k=n%i
6 | if(k>1):
7 | z="nuts"
8 | elif(k==1):
9 | z="nut"
10 | else:
11 | z="no nuts"
12 | print(n,"nuts =",j,"nuts for pirate#",x,"and",k,(z),"for the monkey")
13 | n=n-(j+k)
14 | j=n//i
15 | k=n%i
16 | if(k>1):
17 | z="nuts"
18 | elif(k==1):
19 | z="nut"
20 | else:
21 | z="no nuts"
22 | print("each pirate gets",j,"nuts and",z,"for the monkey")
23 |
--------------------------------------------------------------------------------
/contributions/kanchanachathuranga/fibbonacci.c:
--------------------------------------------------------------------------------
1 | #include
2 | int fibonacci(int);
3 | void main ()
4 | {
5 | int n,f;
6 | printf("Enter the value?");
7 | scanf("%d",&n);
8 | f = fibonacci(n);
9 | printf("%d",f);
10 | }
11 | int fibonacci (int n)
12 | {
13 | if (n==0)
14 | {
15 | return 0;
16 | }
17 | else if (n == 1)
18 | {
19 | return 1;
20 | }
21 | else
22 | {
23 | return fibonacci(n-1)+fibonacci(n-2);
24 | }
25 | }
--------------------------------------------------------------------------------
/contributions/Saumya Pai/Fibonacci.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main()
3 | {
4 | int t1 = 0, t2 = 1, nextTerm = 0, n;
5 | printf("Enter a positive number: ");
6 | scanf("%d", &n);
7 |
8 | // displays the first two terms which is always 0 and 1
9 | printf("Fibonacci Series: %d, %d, ", t1, t2);
10 | nextTerm = t1 + t2;
11 |
12 | while (nextTerm <= n)
13 | {
14 | printf("%d, ", nextTerm);
15 | t1 = t2;
16 | t2 = nextTerm;
17 | nextTerm = t1 + t2;
18 | }
19 |
20 | return 0;
21 | }
--------------------------------------------------------------------------------
/contributions/anujVerma/forcefullyPULLED.py:
--------------------------------------------------------------------------------
1 | '''
2 | # Sample code to perform I/O:
3 |
4 | name = input() # Reading input from STDIN
5 | print('Hi, %s.' % name) # Writing output to STDOUT
6 |
7 | # Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
8 | '''
9 |
10 | # Write your code here
11 | d=int(input())
12 | t = 0
13 | while d>0:
14 | l=list(map(int,input().split()))
15 | r=l[0]
16 | x=l[1]
17 |
18 | if 44*r<=x*700:
19 | t+=1
20 |
21 | d-=1
22 | print(t)
23 |
--------------------------------------------------------------------------------
/contributions/Rust_Bubble_Sort.rs:
--------------------------------------------------------------------------------
1 | fn main() {
2 |
3 | let mut num_array = [200, 31, 80, 14, 1, 432, 84, 33, 18];
4 |
5 | let mut swap_performed = true;
6 |
7 | while swap_performed{
8 | swap_performed = false;
9 |
10 | for i in 1..num_array.len() {
11 | if num_array[i-1]> num_array[i] {
12 | num_array.swap(i-1, i);
13 | swap_performed=true
14 | }
15 | }
16 | }
17 |
18 | println!("{}", "Sorted Array:");
19 | println!("{:?}", num_array);
20 | }
21 |
--------------------------------------------------------------------------------
/contributions/febonacci_AayushMehta.txt:
--------------------------------------------------------------------------------
1 | nterms = int(input("How many terms? "))
2 |
3 | # first two terms
4 | n1, n2 = 0, 1
5 | count = 0
6 |
7 | # check if the number of terms is valid
8 | if nterms <= 0:
9 | print("Please enter a positive integer")
10 | elif nterms == 1:
11 | print("Fibonacci sequence upto",nterms,":")
12 | print(n1)
13 | else:
14 | print("Fibonacci sequence:")
15 | while count < nterms:
16 | print(n1)
17 | nth = n1 + n2
18 | # update values
19 | n1 = n2
20 | n2 = nth
21 | count += 1
22 |
--------------------------------------------------------------------------------
/contributions/Prakhar Saxena/my third song.java:
--------------------------------------------------------------------------------
1 | package Assignment1;
2 | import java.util.*;
3 | public class ques_10 {
4 |
5 | public static void main(String[] args) {
6 | // TODO Auto-generated method stub
7 | Scanner ques10 = new Scanner(System.in);
8 | System.out.print("Enter the number: ");
9 | int a,b,c,d,e,f,g,h,i,j;
10 | a= ques10.nextInt();
11 | b= a%100;
12 | c= a%1000;
13 | d = a-c;
14 | e = b%10;
15 | f = e*100;
16 | g = b/10;
17 | h = g*10;
18 | i = c/100;
19 | j= d+f+i+h;
20 | System.out.print("Number: "+j);
21 | }
22 |
23 | }
24 |
--------------------------------------------------------------------------------
/contributions/Ritika-Roongta/Bruteforce.py:
--------------------------------------------------------------------------------
1 | 1. BRUTE FORCE Algorithm for string pattern matching //in python
2 |
3 | def bruteF(P, T):
4 | M = len(P)
5 | N = len(T)
6 | for i in range(N - M + 1):
7 | j = 0
8 | while(j < M):
9 | if (T[i + j] != P[j]):
10 | break
11 | j += 1
12 |
13 | if (j == M):
14 | print("Pattern found at index ", i)
15 |
16 |
17 | if __name__ == '__main__':
18 | T = input("Enter the text: ")
19 | P = input("Enter the pattern: ")
20 | bruteF(P, T)
21 |
--------------------------------------------------------------------------------
/webapp/.firebase/hosting.cHVibGlj.cache:
--------------------------------------------------------------------------------
1 | favicon.ico,1602590001991,12c77055696278694a8feb77a9421dd85f8af25a81d812822be112e4be628fcf
2 | index.html,1602765389616,e8e87da2da7308c6980724a8da46aefde4ac0fbb960f61f6f912ada3f0fb9792
3 | logo192.png,1602590001991,76c449ccb9cd117c2f2338f091b18f7050f3210e249b2228f5c81b23f34377cd
4 | logo512.png,1602590001991,7779210d56c1f3741e2e487799fe3092def4fa6ac450a60532b807c3a8971205
5 | manifest.json,1602590001991,0958a5e0c831126100c8c2d06a6bbaa665a3900f21aaff4130238a6f5a113aa1
6 | robots.txt,1602590001991,2544ca049f223a42bff01f72ad930a5edba75bbb7199d0f8430a02ff5aca16ec
7 |
--------------------------------------------------------------------------------
/contributions/Prateek_Agarwal/fibonacci_series.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 | void fib(int n) {
4 | int f[n];
5 | int i;
6 | f[0] = 0;
7 | f[1] = 1;
8 | for (i = 2; i < n; i++) {
9 | f[i] = f[i-1] + f[i-2];
10 | }
11 | for (i = 0; i < n; i++) {
12 | cout<>n;
19 | fib(n);
20 | return 0;
21 | }
22 |
23 | /*
24 |
25 | Input
26 | Enter no. of terms: 15
27 |
28 | Output
29 | 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
30 |
31 | */
32 |
--------------------------------------------------------------------------------
/contributions/Siddharth-Khandelwal/fibonacci.java:
--------------------------------------------------------------------------------
1 | import java.util.Scanner;
2 | public class Fibonacci
3 | {
4 | public static void main(String[] args)
5 | {
6 | int num, x = 0, y = 0, z = 1;
7 | Scanner scan = new Scanner(System.in);
8 | System.out.print("Enter the last count for the series:");
9 | num = scan.nextInt();
10 | System.out.print("Fibonacci Series:");
11 | for(int i = 1; i <= num; i++)
12 | {
13 | x = y;
14 | y = z;
15 | z = x + y;
16 | System.out.print(x+" ");
17 | }
18 | }
19 | }
--------------------------------------------------------------------------------
/contributions/anujVerma/anagram.py:
--------------------------------------------------------------------------------
1 | t=int(input())
2 | i=count=z=0
3 | a=[]
4 | b=[]
5 | c=[]#for counting characters
6 | while z 0
13 | return star if amount == 1
14 |
15 | star + (tab(2) + star) * (amount - 1)
16 | end
17 |
18 | def print_pyramid(height)
19 | i = 0
20 | while i < height do
21 | tab_size = height - (i + 1)
22 | tabbed_stars_amount = i + 1
23 |
24 | puts tab(tab_size) + tabbed_stars(tabbed_stars_amount)
25 | i += 1
26 | end
27 | end
28 |
29 | height = gets.to_i
30 | print_pyramid height
31 |
--------------------------------------------------------------------------------
/contributions/sathiranipun/fibonacci.java:
--------------------------------------------------------------------------------
1 | import java.util.Scanner;
2 |
3 | public class hacktoberfest {
4 | public static void main(String[] args) {
5 | Scanner inputnum = new Scanner(System.in);
6 | System.out.print("Enter the number of terms :");
7 | int n = inputnum.nextInt();
8 |
9 | int x = 0, y = 1;
10 | System.out.print("First " + n + " terms: ");
11 | for (int i = 1; i <= n; ++i)
12 | {
13 | System.out.print(x + " + ");
14 | int sum = x + y;
15 | x = y;
16 | y = sum;
17 | }
18 | }
19 | }
--------------------------------------------------------------------------------
/contributions/kanchanachathuranga/fibonacci1.java:
--------------------------------------------------------------------------------
1 | import java.util.Scanner;
2 |
3 | public class hacktoberfest {
4 | public static void main(String[] args) {
5 | Scanner inputnum = new Scanner(System.in);
6 | System.out.print("Enter the number of terms :");
7 | int n = inputnum.nextInt();
8 |
9 | int x = 0, y = 1;
10 | System.out.print("First " + n + " terms: ");
11 | for (int i = 1; i <= n; ++i)
12 | {
13 | System.out.print(x + " + ");
14 | int sum = x + y;
15 | x = y;
16 | y = sum;
17 | }
18 | }
19 | }
--------------------------------------------------------------------------------
/webapp/public/manifest.json:
--------------------------------------------------------------------------------
1 | {
2 | "short_name": "React App",
3 | "name": "Create React App Sample",
4 | "icons": [
5 | {
6 | "src": "favicon.ico",
7 | "sizes": "64x64 32x32 24x24 16x16",
8 | "type": "image/x-icon"
9 | },
10 | {
11 | "src": "logo192.png",
12 | "type": "image/png",
13 | "sizes": "192x192"
14 | },
15 | {
16 | "src": "logo512.png",
17 | "type": "image/png",
18 | "sizes": "512x512"
19 | }
20 | ],
21 | "start_url": ".",
22 | "display": "standalone",
23 | "theme_color": "#000000",
24 | "background_color": "#ffffff"
25 | }
26 |
--------------------------------------------------------------------------------
/contributions/Ankit Raj/fib.go:
--------------------------------------------------------------------------------
1 | package main
2 |
3 | import "fmt"
4 |
5 | func main(){
6 | var n int
7 | t1:=0
8 | t2:=1
9 | nextTerm:=0
10 |
11 | fmt.Print("Enter the number of terms : ")
12 | fmt.Scan(&n)
13 | fmt.Print("Fibonacci Series :")
14 | for i:=1;i<=n;i++ {
15 | if(i==1){
16 | fmt.Print(" ",t1)
17 | continue
18 | }
19 | if(i==2){
20 | fmt.Print(" ",t2)
21 | continue
22 | }
23 | nextTerm = t1 + t2
24 | t1=t2
25 | t2=nextTerm
26 | fmt.Print(" ",nextTerm)
27 | }
28 | }
29 |
--------------------------------------------------------------------------------
/contributions/Prakhar Saxena/ex.java:
--------------------------------------------------------------------------------
1 | import java.util.Scanner;
2 | public class ex {
3 | public static void main(String[]args){
4 | Scanner ip=new Scanner(System.in);
5 | int a=ip.nextInt();
6 | int c=a;
7 | int b=0;
8 | int sum=0;
9 | for(int x=2;x*x
2 | using namespace std;
3 |
4 | int main()
5 | {
6 | int n, num, digit, rev = 0;
7 |
8 | cout << "Enter a positive number: ";
9 | cin >> num;
10 |
11 | n = num;
12 |
13 | do
14 | {
15 | digit = num % 10;
16 | rev = (rev * 10) + digit;
17 | num = num / 10;
18 | } while (num != 0);
19 |
20 | cout << " The reverse of the number is: " << rev << endl;
21 |
22 | if (n == rev)
23 | cout << " The number is a palindrome.";
24 | else
25 | cout << " The number is not a palindrome.";
26 |
27 | return 0;
28 | }
--------------------------------------------------------------------------------
/contributions/gauravbisht005/BubbleSort.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 | int main(){
4 | int n, i, j, temp;
5 | cout<<"Enter total number of elements:";
6 | cin>>n;
7 | int arr[n];
8 | cout<<"Enter the array elements:";
9 | for(i=0; i>arr[i];
11 | }
12 | for(i=0; i<(n-1); i++){
13 | for(j=0; j<(n-i-1); j++){
14 | if(arr[j]>arr[j+1]){
15 | temp=arr[j];
16 | arr[j]=arr[j+1];
17 | arr[j+1]=temp;
18 | }
19 | }
20 | }
21 | cout<<"\nArray elements after Bubble Sorting:\n";
22 | for(i=0; i " + f[i]);
12 | }
13 | }
14 |
15 | public static void main(String[] args) {
16 | Fibo f = new Fibo();
17 | Scanner scan = new Scanner(System.in);
18 | System.out.print("Enter the number of fibonacci numbers you need: ");
19 | int n = scan.nextInt();
20 |
21 | f.fib(n);
22 | }
23 | }
24 |
--------------------------------------------------------------------------------
/contributions/mridul/print.pyramid:
--------------------------------------------------------------------------------
1 |
2 | #Function to print a spaced pyramid based on number of rows
3 | def printPyramid(height) :
4 | for i in range(0, height):
5 | # print the first row
6 | # print spaces and do not move to new line
7 | for gap in range(1, (height-i)+1):
8 | print(" " * 2, end="")
9 | # print stars and do not move to new line
10 | for star in range(0, i+1):
11 | print("* ",end="")
12 | # go to next row
13 | print()
14 |
15 | #Input method
16 | if __name__=='__main__':
17 | height = int(input("Enter number rows : "))
18 | printPyramid(height)
19 |
--------------------------------------------------------------------------------
/contributions/Ashank/Pattern1.java:
--------------------------------------------------------------------------------
1 | //program for the following pattern :
2 | //* * * * *
3 | //* * * *
4 | //* * *
5 | //* *
6 | //*
7 |
8 | import java.util.*;
9 |
10 | public class Pattern1 {
11 |
12 | public static void main(String[] args) {
13 | Scanner scn = new Scanner(System.in);
14 | int n = scn.nextInt();
15 |
16 | int stars = n;
17 | for (int i = 1; i <= n; i++) {
18 | for (int j = 1; j <= stars; j++) {
19 | System.out.print("*\t");
20 | }
21 | stars--;
22 | System.out.println();
23 | }
24 |
25 | }
26 | }
27 |
--------------------------------------------------------------------------------
/contributions/Monigingir Pal/printPattern.py:
--------------------------------------------------------------------------------
1 | #Function to print a spaced pyramid based on number of rows
2 | def printPyramid(height) :
3 | for i in range(0, height):
4 | # print the first row
5 | # print spaces and do not move to new line
6 | for gap in range(1, (height-i)+1):
7 | print(" " * 2, end="")
8 | # print stars and do not move to new line
9 | for star in range(0, i+1):
10 | print("* ",end="")
11 | # go to next row
12 | print()
13 |
14 | #Input method
15 | if __name__=='__main__':
16 | height = int(input("Enter number rows : "))
17 | printPyramid(height)
18 |
19 |
--------------------------------------------------------------------------------
/contributions/Saumpii/palindrome.c:
--------------------------------------------------------------------------------
1 | #include
2 | int main()
3 | {
4 | int n, reversedN = 0, remainder, originalN;
5 | printf("Enter an integer: ");
6 | scanf("%d", &n);
7 | originalN = n;
8 |
9 | // Reversed integer is stored in reversedN
10 | while (n != 0)
11 | {
12 | remainder = n % 10;
13 | reversedN = reversedN * 10 + remainder;
14 | n /= 10;
15 | }
16 |
17 | // palindrome if orignalN and reversedN are equal
18 | if (originalN == reversedN)
19 | printf("%d is a palindrome.", originalN);
20 | else
21 | printf("%d is not a palindrome.", originalN);
22 |
23 | return 0;
24 | }
--------------------------------------------------------------------------------
/contributions/Ashank/Pattern6.java:
--------------------------------------------------------------------------------
1 | //program for the following pattern :
2 | //*
3 | // *
4 | // *
5 | // *
6 | // *
7 |
8 | import java.util.*;
9 |
10 | public class Pattern6 {
11 |
12 | public static void main(String[] args) {
13 | Scanner scn = new Scanner(System.in);
14 | int n = scn.nextInt();
15 |
16 | int sp = 0;
17 | for (int i = 1; i <= n; i++) {
18 | for (int j = 1; j <= sp; j++) {
19 | System.out.print("\t");
20 | }
21 | System.out.print("*\t");
22 | System.out.println();
23 | sp++;
24 | }
25 |
26 | }
27 | }
28 |
--------------------------------------------------------------------------------
/contributions/Saumpii/palindrome.cs:
--------------------------------------------------------------------------------
1 | using System;
2 | public class PalindromeExample
3 | {
4 | public static void Main(string[] args)
5 | {
6 | int n,r,sum=0,temp;
7 | Console.Write("Enter the Number: ");
8 | n = int.Parse(Console.ReadLine());
9 | temp=n;
10 | while(n>0)
11 | {
12 | r=n%10;
13 | sum=(sum*10)+r;
14 | n=n/10; cc
15 | }
16 | if(temp==sum)
17 | Console.Write("Number is Palindrome.");
18 | else
19 | Console.Write("Number is not Palindrome");
20 | }
21 | }
--------------------------------------------------------------------------------
/webapp/src/BaseComponents/DataSavedSnackbar.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import Snackbar from '@material-ui/core/Snackbar';
3 | import MuiAlert from '@material-ui/lab/Alert';
4 |
5 | function Alert(props) {
6 | return ;
7 | }
8 |
9 | export default function DataSavedSnackbar(props) {
10 | return (
11 |
12 |
14 |
15 | {props.msg}
16 |
17 |
18 |
19 |
20 |
19 |
20 |
21 |
22 |
23 | );
24 | }
25 |
--------------------------------------------------------------------------------
/contributions/imshahnawazdevil/PreSum.cpp:
--------------------------------------------------------------------------------
1 | // Calculating Presum Of array
2 | #include
3 | #include
4 | #include
5 | using namespace std;
6 | int main(){
7 | ios_base::sync_with_stdio(false);
8 | cin.tie(NULL);
9 | int n,i;
10 | cout<<"ennter Size of Array: "<>n;
12 |
13 | int* ar= new int[n];
14 | int sum=0;
15 | for(i=0;i>element;
18 | sum+=element;
19 | ar[i]=sum;
20 | }
21 |
22 | cout<<"Presum Array :"<>l>>r;
28 | if(l 0) {
18 | int rem = n % 10;
19 | val += rem * Math.pow(b,exp);
20 | exp++;
21 | n = n / 10;
22 | }
23 |
24 | return val;
25 | }
26 | }
27 |
28 | //Input
29 | //111001
30 | //2
31 |
32 | //Output
33 | //57
34 |
--------------------------------------------------------------------------------
/contributions/Ashank/DecimaltoAnyBase.java:
--------------------------------------------------------------------------------
1 | import java.util.*;
2 |
3 | public class DecimaltoAnyBase {
4 |
5 | public static void main(String[] args) {
6 | Scanner scn = new Scanner(System.in);
7 | int n = scn.nextInt();
8 | int b = scn.nextInt();
9 | int dn = getValueInBase(n, b);
10 | System.out.println(dn);
11 | }
12 |
13 | public static int getValueInBase(int n, int b) {
14 | int exp = 0;
15 | int val = 0;
16 |
17 | while (n > 0) {
18 | int rem = n % b;
19 | val += rem * Math.pow(10,exp);
20 | exp++;
21 | n = n / b;
22 | }
23 |
24 | return val;
25 | }
26 | }
27 |
28 | //Input
29 | //57
30 | //2
31 |
32 | //Output
33 | //111001
34 |
--------------------------------------------------------------------------------
/contributions/Ashank/Pattern2.java:
--------------------------------------------------------------------------------
1 | //program for the following pattern :
2 | // *
3 | // * *
4 | // * * *
5 | // * * * *
6 | //* * * * *
7 |
8 | import java.util.*;
9 |
10 | public class Pattern2 {
11 |
12 | public static void main(String[] args) {
13 | Scanner scn = new Scanner(System.in);
14 | int n = scn.nextInt();
15 |
16 | int sp = n - 1;
17 | int st = 1;
18 | for (int i = 1; i <= n; i++) {
19 | for (int j = 1; j <= sp; j++) {
20 | System.out.print("\t");
21 | }
22 | for (int j = 1; j <= st; j++) {
23 | System.out.print("*\t");
24 | }
25 | sp--;
26 | st++;
27 | System.out.println();
28 | }
29 |
30 | }
31 | }
32 |
--------------------------------------------------------------------------------
/contributions/Ashank/Pattern3.java:
--------------------------------------------------------------------------------
1 | //program for the following pattern :
2 | //* * * * *
3 | // * * * *
4 | // * * *
5 | // * *
6 | // *
7 |
8 | import java.util.*;
9 |
10 | public class Pattern3 {
11 |
12 | public static void main(String[] args) {
13 | Scanner scn = new Scanner(System.in);
14 | int n = scn.nextInt();
15 |
16 | int sp = 0;
17 | int st = n;
18 |
19 | for (int i = 1; i <= n; i++) {
20 | for (int j = 1; j <= sp; j++) {
21 | System.out.print("\t");
22 | }
23 | for (int j = 1; j <= st; j++) {
24 | System.out.print("*\t");
25 | }
26 | System.out.println();
27 | sp++;
28 | st--;
29 | }
30 |
31 | }
32 | }
33 |
--------------------------------------------------------------------------------
/contributions/Saumya-Patel/StrongPasswords.py:
--------------------------------------------------------------------------------
1 | #!/usr/bin/env python
2 | # coding: utf-8
3 |
4 | # In[1]:
5 |
6 |
7 | test = int(input())
8 | psswrd = []
9 | i=0
10 | while(i=8):
25 | count+=1
26 | if(any(i in characters for i in j)):
27 | count+=1
28 | A.append(count)
29 | for i in A:
30 | if(i == 5):
31 | print("strong")
32 | elif(i == 3 or i == 4):
33 | print("moderate")
34 | else:
35 | print("weak")
36 |
37 |
38 | # In[ ]:
39 |
--------------------------------------------------------------------------------
/contributions/Vikalp/Bubble sort.c:
--------------------------------------------------------------------------------
1 |
2 | #include
3 | int main ()
4 | {
5 | int a[50], n, i, j, temp = 0;
6 | printf ("Enter how many numbers you want:\n");
7 | scanf ("%d", &n);
8 | printf ("Enter the %d elements:", n);
9 | for (i = 0; i < n; i++)
10 | scanf ("%d", &a[i]);
11 | printf ("\nThe given array is:");
12 | for (i = 0; i < n; i++)
13 | printf ("\n%d", a[i]);
14 | for (i = 0; i < n; i++)
15 | {
16 | for (j = i + 1; j < n; j++)
17 | {
18 | if (a[i] > a[j])
19 | {
20 | temp = a[i];
21 | a[i] = a[j];
22 | a[j] = temp;
23 | }
24 | }
25 | }
26 | printf ("\nThe sorted array using Bubble sort is:\n");
27 | for (i = 0; i < n; i++)
28 | printf ("\n%d", a[i]);
29 | return 0;
30 | }
31 |
32 |
33 |
--------------------------------------------------------------------------------
/contributions/Shrey Tank/Python/BabySittingProblem.py:
--------------------------------------------------------------------------------
1 | import math
2 | h1= int(input("Enter start hr"))
3 | m1= int(input("Enter start min"))
4 | h2= int(input("Enter end hr"))
5 | m2= int(input("Enter end min"))
6 |
7 | t1 = h1 + (m1/60)
8 |
9 | if(h2==0):
10 | h2=24
11 | t2 = h2 + (m2/60)
12 |
13 | if(t1>=18.5 and t2<=24.0):
14 |
15 | if (t1>=18):
16 |
17 | if (t2<=21.5):
18 |
19 | time = t2-t1
20 | price = 2*time
21 |
22 | else:
23 |
24 | time1 = 21.5 - t1
25 | time2 = t2 - 21.5
26 | price = (2*time1) + (4*time2)
27 |
28 | elif(t1>=21.5):
29 |
30 | time = t2-t1
31 | price = 4*time
32 |
33 | print(price)
34 |
35 | else:
36 |
37 | print("invalid input")
38 |
39 |
--------------------------------------------------------------------------------
/contributions/anujVerma/costofballons.py:
--------------------------------------------------------------------------------
1 | T = int(input())
2 | while T > 0:
3 | green,purple = input().split()
4 | n = int(input())
5 | list1 = []
6 | list2 = []
7 | for i in range(n):
8 | l1,l2 = input().split()
9 | list1.append(int(l1))
10 | list2.append(int(l2))
11 | sum1=0
12 | sum2=0
13 | for k in range(n):
14 | sum1 = sum1 + list1[k]
15 | sum2 = sum2 + list2[k]
16 | if sum1 >= sum2:
17 | if int(green)>=int(purple):
18 | cost = int(purple)*sum1+int(green)*sum2
19 | else:
20 | cost = int(purple) * sum2 + int(green) * sum1
21 | else:
22 | if int(green) >= int(purple):
23 | cost = int(purple) * sum2 + int(green) * sum1
24 | else:
25 | cost = int(purple) * sum1 + int(green) * sum2
26 | print(cost)
27 | T-=1
28 |
--------------------------------------------------------------------------------
/contributions/Aniket Shrivastav/check_palindrome.cpp:
--------------------------------------------------------------------------------
1 | //I LOVE MY CODES 3000 TIMES
2 | //NEVER GIVE UP
3 | //WHATEVER IT TAKES
4 | #include
5 | using namespace std ;
6 | #define ll long long int
7 | #define loop(i,a,b) for(i=a;i=b;i--)
9 | #define AVENGERS ios_base::sync_with_stdio(false);cin.tie(NULL);
10 | #define INFINITYWAR ll t;cin>> t;while(t--)
11 | #define mod 1000000007
12 | #define gcd(a,b) __gcd(a,b)
13 | #define pb push_back
14 | #define sub(b,c) substr(b,c)
15 | #define sorted(a,n) is_sorted(a,a+n)
16 | //YOU ARE IN ENDGAME NOW,DISPLAY YOUR CODE HERE
17 |
18 | int main(){
19 | AVENGERS
20 | ll n;
21 | cin >> n;
22 | ll k=n;
23 | ll p=0;
24 | while(k>0){
25 | p=p*10+k%10;
26 | k=k/10;
27 | }
28 | if(p==n)
29 | cout << "YES THE NUMBER IS PALINDROME"<< endl;
30 | else
31 | cout << "NO THE NUMBER IS NOT PALINDROME" << endl;
32 | return 0;
33 | }
34 |
--------------------------------------------------------------------------------
/webapp/src/App.css:
--------------------------------------------------------------------------------
1 | @import url('https://fonts.googleapis.com/css2?family=Work+Sans&display=swap');
2 | body{
3 | font-family: 'Work Sans', sans-serif;
4 | }
5 | .App {
6 | text-align: center;
7 | }
8 | .new{
9 | text-align: center;
10 | }
11 |
12 | .App-logo {
13 | height: 40vmin;
14 | pointer-events: none;
15 | }
16 |
17 | @media (prefers-reduced-motion: no-preference) {
18 | .App-logo {
19 | animation: App-logo-spin infinite 20s linear;
20 | }
21 | }
22 |
23 | .App-header {
24 | background-color: #282c34;
25 | min-height: 100vh;
26 | display: flex;
27 | flex-direction: column;
28 | align-items: center;
29 | justify-content: center;
30 | font-size: calc(10px + 2vmin);
31 | color: white;
32 | }
33 |
34 | .App-link {
35 | color: #61dafb;
36 | }
37 |
38 | @keyframes App-logo-spin {
39 | from {
40 | transform: rotate(0deg);
41 | }
42 | to {
43 | transform: rotate(360deg);
44 | }
45 | }
46 |
--------------------------------------------------------------------------------
/contributions/AnmolSingh/Jedi:
--------------------------------------------------------------------------------
1 | [Star Wars] Anakin Died
2 |
3 | Let me start out by saying I have no proof of this whatsoever and have no concrete backing to this theory.
4 |
5 | Anakin Skywalker is actually a clone of the original. Why I believe this? Well podracing. Whenever I think about it, a boy as young as Anakin having skills racing/building a podracer is absolutely insane. I know you probably will chalk it up to as "Oh he's just naturally talented because the force, midichlorians, etc" but I say maybe you're right.
6 |
7 | OR maybe he got those skills from the original that died? A Sith maybe? Shmi claimed that there was no father.
8 | So perhaps while she was a slave, an old dying Anakin Jedi Mind Tricked her so he could implant a clone of himself inside her womb so he could carry on his legacy.
9 | Either that or he had such a knowledge of the force that he could influence mediclorians to make a child in her without Shmi knowing about it.
10 |
--------------------------------------------------------------------------------
/contributions/Shrey Tank/Python/StrengthOfPassword.py:
--------------------------------------------------------------------------------
1 | p=int(input())
2 | list=[]
3 |
4 | for x in range(0,p):
5 |
6 | a=input()
7 | list.append(a)
8 |
9 | for x in range(0,p):
10 |
11 | i,j,k,l,count=0,0,0,0,0
12 |
13 | if len(list[x])>=8:
14 | count+=1
15 |
16 | for z in list[x]:
17 | if z.isupper():
18 | j+=1
19 |
20 | if z.islower():
21 | k+=1
22 |
23 | if z.isdigit():
24 | l+=1
25 |
26 | if (not (ord(z)>47 and ord(z)<58) and not(ord(z)>64 and ord(z)<91) and not (ord(z)>96 and ord(z)<123)):
27 | i+=1
28 |
29 | if i>=1:
30 | count+=1
31 | if j>=1:
32 | count+=1
33 | if k>=1:
34 | count+=1
35 | if l>=1:
36 | count+=1
37 |
38 |
39 | if count<3:
40 | print("weak")
41 |
42 | elif count==4 or count==3:
43 | print("moderate")
44 |
45 | else:
46 | print("strong")
47 |
--------------------------------------------------------------------------------
/contributions/Shubham-Bhandari/Queue-using-stack.py:
--------------------------------------------------------------------------------
1 | class MyQueue(object):
2 | def __init__(self):
3 | self.stack_pri = []
4 | self.stack_sec = []
5 |
6 | def transfer(self):
7 | if len(self.stack_sec) == 0:
8 | for i in self.stack_pri:
9 | self.stack_sec.insert(0, i)
10 | self.stack_pri.clear()
11 | return
12 |
13 | def peek(self):
14 | self.transfer()
15 | return self.stack_sec[0]
16 |
17 | def pop(self):
18 | self.transfer()
19 | del self.stack_sec[0]
20 |
21 | def put(self, value):
22 | self.stack_pri.insert(0, value)
23 |
24 |
25 | queue = MyQueue()
26 | t = int(input())
27 | for line in range(t):
28 | values = map(int, input().split())
29 | values = list(values)
30 | if values[0] == 1:
31 | queue.put(values[1])
32 | elif values[0] == 2:
33 | queue.pop()
34 | else:
35 | print(queue.peek())
36 |
--------------------------------------------------------------------------------
/contributions/Shubham-Bhandari/merge-sort.py:
--------------------------------------------------------------------------------
1 | def main():
2 | arr = list(map(int, input().split()))
3 | print(partition(arr))
4 |
5 |
6 | swap = 0
7 |
8 |
9 | def merge(arr_a, arr_b):
10 | global swap
11 | final_arr = []
12 | i = 0
13 | j = 0
14 | while i < len(arr_a) and j < len(arr_b):
15 | if arr_a[i] <= arr_b[j]:
16 | final_arr.append(arr_a[i])
17 | i += 1
18 | elif arr_b[j] < arr_a[i]:
19 | final_arr.append(arr_b[j])
20 | j += 1
21 | swap += len(arr_a) - i
22 | final_arr.extend(arr_a[i:])
23 | final_arr.extend(arr_b[j:])
24 | return final_arr
25 |
26 |
27 | def partition(arr):
28 | left = 0
29 | right = len(arr)
30 | if left < right - 1:
31 | mid = left + (right - left) // 2
32 | arr = merge(partition(arr[left:mid]), partition(arr[mid:right]))
33 | return arr
34 |
35 |
36 | if __name__ == '__main__':
37 | main()
38 | print(swap)
39 |
--------------------------------------------------------------------------------
/contributions/nilesh_choudhary/triangle_pattern.php:
--------------------------------------------------------------------------------
1 |
2 |
6 |
7 | ";
29 | }
30 | }
31 | ?>
32 |
33 |
43 |
--------------------------------------------------------------------------------
/contributions/Ashank/Armstrong.java:
--------------------------------------------------------------------------------
1 | import java.util.Scanner;
2 | import java.lang.Math;
3 |
4 | public class Armstrong {
5 |
6 | public static void main(String[] args) {
7 | Scanner sc = new Scanner(System.in);
8 | System.out.print("Enter a number : ");
9 | int number = sc.nextInt();
10 | int originalNumber, remainder, result = 0;
11 |
12 | originalNumber = number;
13 |
14 | while (originalNumber != 0)
15 | {
16 | remainder = originalNumber % 10;
17 | result += Math.pow(remainder, 3);
18 | originalNumber /= 10;
19 | }
20 |
21 | if(result == number)
22 | System.out.println(number + " is an Armstrong number.");
23 | else
24 | System.out.println(number + " is not an Armstrong number.");
25 | }
26 | }
27 |
28 | //Input : 343
29 | //Output : 343 is not an Armstrong number.
30 |
31 | //Input : 371
32 | //Output : 371 is an Armstrong number.
33 |
--------------------------------------------------------------------------------
/contributions/Ashank/Pattern4.java:
--------------------------------------------------------------------------------
1 | //program for the following pattern :
2 | // *
3 | // * * *
4 | //* * * * *
5 | // * * *
6 | // *
7 |
8 | import java.util.*;
9 |
10 | public class Pattern4 {
11 |
12 | public static void main(String[] args) {
13 | Scanner scn = new Scanner(System.in);
14 | int n = scn.nextInt();
15 |
16 | int sp = n/2;
17 | int st = 1;
18 |
19 | for (int i = 1; i <= n; i++) {
20 | for (int j = 1; j <= sp; j++) {
21 | System.out.print("\t");
22 | }
23 | for (int j = 1; j <= st; j++) {
24 | System.out.print("*\t");
25 | }
26 | System.out.println();
27 | if (i <= n/2) {
28 | sp--;
29 | st += 2;
30 | }
31 | else {
32 | sp++;
33 | st -= 2;
34 | }
35 | }
36 |
37 | }
38 | }
39 |
--------------------------------------------------------------------------------
/contributions/Class Details.txt:
--------------------------------------------------------------------------------
1 | 26/10 (Mon)
2 |
3 | [10-12] CDA
4 | 95223866420
5 | ES1101
6 |
7 | [2-3] D&P
8 | 93821573376
9 | ES1110
10 | ------------------------------------------------------
11 | 27/10 (Tue)
12 |
13 | [10-11] FoC
14 | 98426550403
15 | CC1101
16 |
17 | [11.30-12.30] FoA
18 | 94738224923
19 | ES1111
20 |
21 | [2-3] D&P
22 | 93821573376
23 | ES1110
24 | ------------------------------------------------------
25 | 28/10 (Wed)
26 |
27 | [10-12] CDA
28 | 95223866420
29 | ES1101
30 |
31 | [2-3] ScP
32 | 99956053351
33 | AS1102
34 | ------------------------------------------------------
35 | 29/10 (Thu)
36 |
37 | [10-12] FoA
38 | 94738224923
39 | ES1111
40 |
41 | [2-3] D&P
42 | 93821573376
43 | ES1110
44 | ------------------------------------------------------
45 | 30/10 (Fri)
46 |
47 | [10-11] FoC
48 | 98426550403
49 | CC1101
50 |
51 | [11.30-12.30] ScP
52 | 99956053351
53 | AS1102
54 |
55 | [2-4] CDA
56 | 95223866420
57 | ES1101
--------------------------------------------------------------------------------
/contributions/Ritika-Roongta/RABIN KARP.py:
--------------------------------------------------------------------------------
1 | RABIN KARP Algorithm //for string pattern matching
2 |
3 |
4 | d = 26
5 |
6 | def RabinK(P, T, q):
7 | M = len(P)
8 | N = len(T)
9 | i = 0
10 | j = 0
11 | p = 0
12 | t = 0
13 | h = 1
14 |
15 | for i in range(M-1):
16 | h = (h*d)%q
17 |
18 | for i in range(M):
19 | p = (d*p + ord(P[i]))%q
20 | t = (d*t + ord(T[i]))%q
21 |
22 | for s in range(N-M+1):
23 | if p==t:
24 | for j in range(M):
25 | if T[s+j] != P[j]:
26 | break
27 | else: j+=1
28 |
29 | if j==M:
30 | print ("Pattern found at index " + str(s))
31 |
32 | if s < N-M:
33 | t = (d*(t-ord(T[s])*h) + ord(T[s+M]))%q
34 |
35 | if t < 0:
36 | t = t+q
37 |
38 | T = input("Enter the text: ").lower()
39 | P = input("Enter the pattern: ").lower()
40 | q = int(input("Enter the prime number: "))
41 | RabinK(P,T,q)
42 |
--------------------------------------------------------------------------------
/contributions/nilesh_choudhary/fibonacci_series.php:
--------------------------------------------------------------------------------
1 |
2 |
6 |
7 |
36 |
37 |
--------------------------------------------------------------------------------
/webapp/src/Components/InfoPage.css:
--------------------------------------------------------------------------------
1 | @import url('https://fonts.googleapis.com/css2?family=Work+Sans&display=swap');
2 |
3 | .Head-part-1{
4 |
5 | text-align: center;
6 | padding-bottom: 20px;
7 | }
8 | body{
9 | background-color: #F8F9F9;
10 | font-family: 'Work Sans', sans-serif;
11 | }
12 | .Head-part-2{
13 | position: relative;
14 | top:12px;
15 | }
16 | @media only screen and (max-width: 600px) {
17 | body {
18 | margin: 0px;
19 | padding: 0px;
20 | display: flex;
21 | flex-direction: row;
22 | justify-content: center;
23 | }
24 | .Head-part-1{
25 | padding-top: 40px;
26 | }
27 | .Head-part-2{
28 | padding-left: 20px;
29 | padding-right: 20px;
30 | }
31 |
32 | }
33 | .Head-part-11{
34 | text-align: center;
35 | }
36 |
37 | .span-text{
38 | text-align: left;
39 | }
40 |
41 | .text-apart{
42 | color: white;
43 | text-decoration: underline;
44 | }
45 | .text-apart:hover{
46 | color: white;
47 | cursor: pointer;
48 | }
--------------------------------------------------------------------------------
/contributions/AnmolSingh/MotaMota:
--------------------------------------------------------------------------------
1 |
2 | Skip to content
3 | Pull requests
4 | Issues
5 | Marketplace
6 | Explore
7 | @ANMsingh
8 | Learn Git and GitHub without any code!
9 |
10 | Using the Hello World guide, you’ll start a branch, write comments, and open a pull request.
11 | ANMsingh /
12 | jklu-fraternity-network
13 | forked from jklu-jaipur/jklu-fraternity-network
14 |
15 | 0
16 | 0
17 |
18 | 87
19 |
20 | Code
21 | Pull requests
22 | Actions
23 | Projects
24 | Wiki
25 | Security
26 | Insights
27 |
28 | Settings
29 |
30 | jklu-fraternity-network/contributions/AnmolSingh/
31 | 1
32 |
33 |
34 |
35 | @ANMsingh
36 | Commit new file
37 | Commit summary
38 | Optional extended description
39 | Commit directly to the main branch.
40 | Create a new branch for this commit and start a pull request. Learn more about pull requests.
41 |
42 | © 2020 GitHub, Inc.
43 | Terms
44 | Privacy
45 | Security
46 | Status
47 | Help
48 | Contact GitHub
49 | Pricing
50 | API
51 | Training
52 | Blog
53 | About
54 |
55 |
--------------------------------------------------------------------------------
/webapp/src/BaseComponents/SubmitButtonSnackbar.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import Snackbar from '@material-ui/core/Snackbar';
3 | import MuiAlert from '@material-ui/lab/Alert';
4 | import {makeStyles} from '@material-ui/core/styles';
5 |
6 | function Alert(props) {
7 | return ;
8 | }
9 |
10 | const useStyles = makeStyles((theme) => ({
11 | root: {
12 | width: '100%',
13 | '& > * + *': {
14 | marginTop: theme.spacing(2),
15 | },
16 | },
17 | }));
18 |
19 | export default function SubmitButtonSnackbar(props) {
20 | const classes = useStyles();
21 |
22 | return (
23 |
24 |
26 |
27 | {props.msg}
28 |
29 |
30 |
Binary search tree implementation in PHP
3 |
4 | Example: Array data:
5 | [ 10, 20, 30, 40, 50, 60, 70, 80, 90, 100 ]
6 |
7 | Result:
8 |
48 |
49 |
--------------------------------------------------------------------------------
/webapp/src/Components/UserForm.css:
--------------------------------------------------------------------------------
1 | .text{
2 | text-align: center;
3 | font-size: 210%;
4 | padding-bottom: 10px;
5 | }
6 | .starter{
7 |
8 |
9 | }
10 | .align-part1{
11 | margin-top: 10px;
12 | }
13 | .register-text{
14 | position: relative;
15 | top:11px;
16 | }
17 | .subtext{
18 | padding-top: -50px;
19 | text-align: center;
20 | font-size: 130%;
21 | margin-bottom: -15px;
22 | }
23 |
24 | .form-style{
25 | display: flex;
26 | justify-content: center;
27 | flex-wrap: wrap;
28 | margin-bottom: -60px;
29 | }
30 | .textarea-1{
31 | width: 30ch;
32 | }
33 | .designform{
34 | margin: 30px;
35 | text-align: center;
36 | }
37 | .designform1{
38 | margin: 30px;
39 | text-align: center;
40 | margin-bottom: -20px;
41 | }
42 | .button-design{
43 | margin-top: 50px;
44 | text-align: center;
45 | }
46 | .text-design{
47 | font-size: 140%;
48 | }
49 | .Button-align{
50 | padding-top: 30px;
51 | float: right;
52 | }
53 | .button1{
54 | position: relative;
55 | left:10px;
56 |
57 |
58 | }
59 | .button2{
60 | position: relative;
61 | left:20px;
62 | }
63 | @media only screen and (max-width: 600px) {
64 | body{
65 | width: 100%;
66 | height: 100%;
67 | justify-content: center;
68 | flex-wrap: wrap;
69 | }
70 | .text{
71 | padding-top: 45px;
72 | }
73 | .textarea-1{
74 | width: auto;
75 | }
76 | .paper-respo{
77 | width: 100%;
78 | }
79 |
80 | }
81 |
82 |
83 | .tf-comp{
84 | margin: 10px;
85 |
86 | }
87 | .paper-respo{
88 | padding: 20px;
89 |
90 | }
91 | .paper-respo-1{
92 | padding: 0px;
93 | }
--------------------------------------------------------------------------------
/contributions/Prachika-Kanodia/Hacktoberfest2020.py:
--------------------------------------------------------------------------------
1 | # Python program to find largest
2 | # number in a list
3 |
4 | # list of numbers
5 | list1 = [10, 20, 4, 45, 99]
6 |
7 | # sorting the list
8 | list1.sort()
9 |
10 | # printing the last element
11 | print("Largest element is:", list1[-1])
12 |
13 |
14 | # Python3 program to add two numbers
15 |
16 | num1 = 15
17 | num2 = 12
18 |
19 | # Adding two nos
20 | sum = num1 + num2
21 |
22 | # printing values
23 | print("Sum of {0} and {1} is {2}" .format(num1, num2, sum))
24 |
25 |
26 | # Python program to find the factorial of a number provided by the user.
27 |
28 | # change the value for a different result
29 | num = 7
30 |
31 | # To take input from the user
32 | #num = int(input("Enter a number: "))
33 |
34 | factorial = 1
35 |
36 | # check if the number is negative, positive or zero
37 | if num < 0:
38 | print("Sorry, factorial does not exist for negative numbers")
39 | elif num == 0:
40 | print("The factorial of 0 is 1")
41 | else:
42 | for i in range(1,num + 1):
43 | factorial = factorial*i
44 | print("The factorial of",num,"is",factorial)
45 |
46 | # Program to display the Fibonacci sequence up to n-th term
47 |
48 | nterms = int(input("How many terms? "))
49 |
50 | # first two terms
51 | n1, n2 = 0, 1
52 | count = 0
53 |
54 | # check if the number of terms is valid
55 | if nterms <= 0:
56 | print("Please enter a positive integer")
57 | elif nterms == 1:
58 | print("Fibonacci sequence upto",nterms,":")
59 | print(n1)
60 | else:
61 | print("Fibonacci sequence:")
62 | while count < nterms:
63 | print(n1)
64 | nth = n1 + n2
65 | # update values
66 | n1 = n2
67 | n2 = nth
68 | count += 1
69 |
70 |
--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
1 | # See https://help.github.com/articles/ignoring-files/ for more about ignoring files.
2 | firebase.js
3 | # dependencies
4 | **/node_modules
5 | /.pnp
6 | **/build
7 | .pnp.js
8 | settings.json
9 | # testing
10 | /coverage
11 | **/build
12 | # production
13 | **/build/
14 | **/.idea
15 | cloud-function/public
16 | # misc
17 | .DS_Store
18 | .env.local
19 | .env.development.local
20 | .env.test.local
21 | .env.production.local
22 |
23 | npm-debug.log*
24 | yarn-debug.log*
25 | yarn-error.log*
26 |
27 | .vscode/*
28 | !.vscode/settings.json
29 | !.vscode/tasks.json
30 | !.vscode/launch.json
31 | !.vscode/extensions.json
32 | *.code-workspace
33 |
34 | # Local History for Visual Studio Code
35 | .history/
36 |
37 | # User-specific stuff
38 | .idea/**/workspace.xml
39 | .idea/**/tasks.xml
40 | .idea/**/usage.statistics.xml
41 | .idea/**/dictionaries
42 | .idea/**/shelf
43 |
44 | # Generated files
45 | .idea/**/contentModel.xml
46 |
47 | # Sensitive or high-churn files
48 | .idea/**/dataSources/
49 | .idea/**/dataSources.ids
50 | .idea/**/dataSources.local.xml
51 | .idea/**/sqlDataSources.xml
52 | .idea/**/dynamic.xml
53 | .idea/**/uiDesigner.xml
54 | .idea/**/dbnavigator.xml
55 |
56 |
57 | # CMake
58 | cmake-build-*/
59 |
60 | # Mongo Explorer plugin
61 | .idea/**/mongoSettings.xml
62 |
63 | # File-based project format
64 | *.iws
65 |
66 | # IntelliJ
67 | out/
68 |
69 | # mpeltonen/sbt-idea plugin
70 | .idea_modules/
71 |
72 | # JIRA plugin
73 | atlassian-ide-plugin.xml
74 |
75 | # Cursive Clojure plugin
76 | .idea/replstate.xml
77 |
78 | # Crashlytics plugin (for Android Studio and IntelliJ)
79 | com_crashlytics_export_strings.xml
80 | crashlytics.properties
81 | crashlytics-build.properties
82 | fabric.properties
83 |
84 | # Editor-based Rest Client
85 | .idea/httpRequests
86 |
87 |
--------------------------------------------------------------------------------
/contributions/Create Stack data structure implementation. #17ANUJ SRIVASTAVA:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 |
5 | using namespace std;
6 |
7 | typedef struct
8 | {
9 | int *elems;
10 | int logLength;
11 | int allocLength;
12 | } Stack;
13 |
14 | void createStack(Stack *s)
15 | {
16 | s->logLength = 0;
17 | s->allocLength = 4;
18 | s->elems = (int *)malloc(4 * sizeof(int));
19 | assert(s->elems != NULL);
20 | }
21 |
22 | void deleteStack(Stack *s)
23 | {
24 | free(s->elems);
25 | s->logLength = 0;
26 | /* free(s) - Don't do this.
27 | The structure is not dynamically allocated */
28 | }
29 |
30 | void pushStack(Stack *s, int value)
31 | {
32 | if(s->logLength == s->allocLength) {
33 | /* doubling stratege */
34 | s->allocLength *= 2;
35 | s->elems = (int *)realloc(s->elems,s->allocLength * sizeof(int));
36 | assert(s->elems != NULL);
37 | }
38 |
39 | s->elems[s->logLength] = value;
40 | s->logLength++;
41 | }
42 |
43 | int popStack(Stack *s)
44 | {
45 | assert(s->logLength > 0);
46 | s->logLength--;
47 | return s->elems[s->logLength];
48 | }
49 |
50 | void printStack(Stack *s)
51 | {
52 | for(int i = 0; i < s->logLength; i++) {
53 | cout << s->elems[i] << " ";
54 | }
55 | cout << endl;
56 | return;
57 | }
58 |
59 | int main()
60 | {
61 | Stack s;
62 | createStack(&s;);
63 | for(int i = 0; i < 10; i++) {
64 | pushStack(&s;,i);
65 | }
66 | printStack(&s;);
67 | cout << "Pop: " << popStack(&s;) << endl;
68 | printStack(&s;);
69 | cout << "Pop: " << popStack(&s;) << endl;
70 | printStack(&s;);
71 |
72 | cout << "Stack disposed" << endl;
73 | deleteStack(&s;);
74 | printStack(&s;);
75 | }
76 | //output
77 | 0 1 2 3 4 5 6 7 8 9
78 | Pop: 9
79 | 0 1 2 3 4 5 6 7 8
80 | Pop: 8
81 | 0 1 2 3 4 5 6 7
82 | Stack disposed
83 |
--------------------------------------------------------------------------------
/cloud-function/index.js:
--------------------------------------------------------------------------------
1 | const crypto = require('crypto');
2 | const db = require('./firebase');
3 | const settings = require('./settings');
4 |
5 | exports.handleNewMergedPullRequest = (req, res) => {
6 | return validatePullRequest(req)
7 | .then(() => {
8 | console.log('in');
9 | if (req.body.action === 'closed' && req.body.pull_request.merged === true) {
10 | console.log('user validated, about to save');
11 | return saveToDatabase(req.body.pull_request.user.login);
12 | } else {
13 | console.log('not saved');
14 | }
15 | }).then(() => {
16 | console.log('exit');
17 | res.status(200).end();
18 | })
19 | .catch((err) => {
20 | console.error(err.stack);
21 | res.status(err.statusCode ? err.statusCode : 500)
22 | .send(err.message)
23 | .end();
24 | });
25 | };
26 |
27 | function saveToDatabase(githubId) {
28 | return db.collection('users').doc(githubId.toLowerCase()).update({
29 | verified: true
30 | }).then(() => {
31 | console.log('saved')
32 | }).catch(error => {
33 | console.error(error)
34 | });
35 | }
36 |
37 | function validatePullRequest(req) {
38 | return Promise.resolve()
39 | .then(() => {
40 | const digest = crypto
41 | .createHmac('sha1', settings.secretToken)
42 | .update(JSON.stringify(req.body))
43 | .digest('hex');
44 | if (req.headers['x-hub-signature'] !== `sha1=${digest}`) {
45 | const error = new Error('Unauthorized');
46 | error.statusCode = 403;
47 | throw error;
48 | } else {
49 | console.log('Request validated.');
50 |
51 | }
52 | });
53 | }
54 |
--------------------------------------------------------------------------------
/contributions/Rishabh Singhal/DFS.java:
--------------------------------------------------------------------------------
1 | import java.util.*;
2 | public class DFS{
3 | Stack S=new Stack<>();
4 | static class Node{
5 | int data;
6 | ArrayList neighbour=new ArrayList<>();
7 | boolean visit;
8 | public Node(int v){
9 | data=v;
10 | }
11 | public class Graph {
12 | private int[][] nodes; // all nodes; e.g. int[][] nodes = {{1,2,3}, {3,2,1,5,6}...};
13 | public int[] getAdjacentNodes(int v) {
14 | return nodes[v];
15 | }
16 | // number of vertices in a graph
17 | public int vSize() {
18 | return nodes.length;
19 | }
20 | }
21 | public void addneighbour(Node n){
22 | neighbour.add(n);
23 | }
24 | public ArrayList getneighbour(Node n){
25 | return n.neighbour;
26 | }
27 | public void printneighbour(Node n){
28 | ArrayList nn =getneighbour(n);
29 | for(int i=0;i E = ex.getneighbour(ex);//getting nei and adding to queue
41 | for(int i=0;i
11 |
12 |
13 |
14 |
Designed & Developed by
15 |
16 |
17 |
20 |
24 |
28 |
32 |
36 |
37 |
38 | );
39 | }
40 | }
41 |
42 | export default Contributors;
43 |
--------------------------------------------------------------------------------
/webapp/src/Components/Navigation.css:
--------------------------------------------------------------------------------
1 | .bm-burger-button {
2 | position: fixed;
3 | width: 30px;
4 | height: 25px;
5 | left: 26px;
6 | top: 26px;
7 | }
8 | /*todo: change color of burger button*/
9 | /* Color/shape of burger icon bars */
10 | .bm-burger-bars {
11 | background: #17202A;
12 | }
13 |
14 | /* Color/shape of burger icon bars on hover*/
15 | /*todo: change color to theme color*/
16 | .bm-burger-bars-hover {
17 | background: #0091EA;
18 |
19 | }
20 |
21 | /* Position and sizing of clickable cross button */
22 | /*todo change h and w of cross*/
23 | .bm-cross-button {
24 | height: 24px;
25 | width: 24px;
26 | }
27 |
28 | /* Color/shape of close button cross */
29 | /*todo change color according to text*/
30 | .bm-cross {
31 | background: #bdc3c7;
32 | }
33 |
34 | /*
35 | Sidebar wrapper styles
36 | Note: Beware of modifying this element as it can break the animations - you should not need to touch it in most cases
37 | */
38 | .bm-menu-wrap {
39 | position: fixed;
40 | height: 100%;
41 | }
42 |
43 | /* General sidebar styles */
44 | /*todo: change background color according to theme*/
45 | .bm-menu {
46 | background: #2980b9;
47 | padding: 2.5em 0.2em 0;
48 | font-size: 1.15em;
49 | }
50 |
51 | /* Morph shape necessary with bubble or elastic */
52 | .bm-morph-shape {
53 | fill: #373a47;
54 | }
55 |
56 | /* Wrapper for item list */
57 | .bm-item-list {
58 | color: #b8b7ad;
59 | padding: 0.8em;
60 | }
61 |
62 | /* Individual item */
63 | .bm-item {
64 | display: inline-block;
65 | }
66 |
67 | /* Styling of overlay */
68 | .bm-overlay {
69 | background: rgba(0, 0, 0, 0.3);
70 | }
71 | /*todo change color of text*/
72 | .menu-item{
73 | color: white;
74 | outline: none;
75 | font-size: 120%;
76 | margin: 30px;
77 | }
78 | /*todo change hover color*/
79 | .menu-item:hover{
80 | color: #00203FFF;
81 | text-decoration: none;
82 | }
83 | a:hover{
84 | cursor: pointer;
85 | }
86 | .jk-tag{
87 | padding-left: 2px;
88 | font-size: 150%;
89 | color: white;
90 | outline: none;
91 | }
92 |
--------------------------------------------------------------------------------
/contributions/Suhas/InstCrawler.py:
--------------------------------------------------------------------------------
1 | # Requirements to be installed:
2 | # pip install requests
3 | # pip install BeautifulSoup4
4 | # pip install prettytable
5 |
6 | import json
7 | import requests
8 | from bs4 import BeautifulSoup
9 | import sys
10 | import datetime as dt
11 | from prettytable import PrettyTable
12 |
13 | URL = "https://www.instagram.com/{}/"
14 |
15 |
16 | def scrape_data(username):
17 | r = requests.get(URL.format(username))
18 | soup= BeautifulSoup(r.text, "html.parser")
19 |
20 | script = soup.find('script', text=lambda t: t.startswith('window._sharedData'))
21 | page_json = script.text.split(' = ', 1)[1].rstrip(';')
22 | data = json.loads(page_json)
23 | non_bmp_map = dict.fromkeys(range(0x10000, sys.maxunicode + 1), 0xfffd)
24 | raw_posts = data['entry_data']['ProfilePage'][0]['graphql']['user']['edge_owner_to_timeline_media']['edges']
25 |
26 | profile = soup.find("meta", property = "og:description")
27 | posts = []
28 |
29 | for i in range(len(raw_posts)):
30 | link = raw_posts[i]['node']['display_url']
31 | date = dt.datetime.fromtimestamp(raw_posts[i]['node']['taken_at_timestamp']).strftime('%Y-%m-%d %H:%M:%S')
32 | likes = raw_posts[i]['node']['edge_liked_by']['count']
33 | comments = raw_posts[i]['node']['edge_media_to_comment']['count']
34 | type = "Video" if raw_posts[i]['node']['is_video'] else "Image"
35 | posts.append({"id": i, "link": link, "type": type, "date": date, "likes": likes, "comments": comments})
36 |
37 | return posts
38 |
39 |
40 | def printTable(data):
41 | t = PrettyTable(["S.No", "Date", "Post Type", "No. likes", "No. Comments"])
42 | for row in data:
43 | t.add_row([row["id"], row["date"], row["type"], row["likes"], row["comments"]])
44 |
45 | print(t)
46 |
47 |
48 | if __name__ == "__main__":
49 |
50 | print("Enter your Instagram UserName: ")
51 | username = input()
52 |
53 | data = scrape_data(username)
54 |
55 | print("\n\tRecent Instagram Posts Data of ", username)
56 | printTable(data);
57 |
58 |
--------------------------------------------------------------------------------
/contributions/gauravbisht005/MergeSort.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | using namespace std;
3 |
4 | void merge(int A[], int l, int m, int r){
5 | int i = 0;
6 | int j = 0;
7 | int k = l;
8 | int sizeOfRight = r - m;
9 | int sizeOfLeft = m - l + 1;
10 | int leftArray[sizeOfLeft];
11 | int rightArray[sizeOfRight];
12 | for(i; i < sizeOfLeft; i++){
13 | leftArray[i] = A[k];
14 | k++;
15 | }
16 | for(j; j < sizeOfRight; j++){
17 | rightArray[j] = A[k];
18 | k++;
19 | }
20 | i = 0;
21 | j = 0;
22 | k = l;
23 | while(i < sizeOfLeft && j < sizeOfRight){
24 | if(leftArray[i] <= rightArray[j]){
25 | A[k] = leftArray[i];
26 | i++;
27 | k++;
28 | }
29 | else{
30 | A[k] = rightArray[j];
31 | j++;
32 | k++;
33 | }
34 | }
35 | while(i < sizeOfLeft){
36 | A[k] = leftArray[i];
37 | i++;
38 | k++;
39 | }
40 | while(j < sizeOfRight){
41 | A[k] = rightArray[j];
42 | j++;
43 | k++;
44 | }
45 | }
46 | void mergeSort(int A[], int l, int r){
47 | int first = l;
48 | int last = r;
49 | if(first == last)
50 | return;
51 | else {
52 | int middle = (first + last) / 2;
53 | mergeSort(A,first, middle);
54 | mergeSort(A, middle + 1, last);
55 | merge(A, first, middle, last);
56 | }
57 | }
58 | int main(){
59 | cout << "Please enter the length (number of elements) of the input array: ";
60 | int n;
61 | cin >> n;
62 | if(n <= 0){
63 | cout << "Illegal input array length!" << endl;
64 | return 0;
65 | }
66 | int* A = new int [n];
67 | cout << "Please enter each element in the array" << endl;
68 | cout << "(each element must be an integer within the range of int type)." << endl;
69 | for(int i=0; i 0]
48 | print(bucket_sort(unsorted))
49 |
--------------------------------------------------------------------------------
/contributions/linked list:
--------------------------------------------------------------------------------
1 | // A complete working Java program to demonstrate deletion in singly
2 | // linked list
3 | class LinkedList
4 | {
5 | Node head; // head of list
6 |
7 | /* Linked list Node*/
8 | class Node
9 | {
10 | int data;
11 | Node next;
12 | Node(int d)
13 | {
14 | data = d;
15 | next = null;
16 | }
17 | }
18 |
19 | /* Given a key, deletes the first occurrence of key in linked list */
20 | void deleteNode(int key)
21 | {
22 | // Store head node
23 | Node temp = head, prev = null;
24 |
25 | // If head node itself holds the key to be deleted
26 | if (temp != null && temp.data == key)
27 | {
28 | head = temp.next; // Changed head
29 | return;
30 | }
31 |
32 | // Search for the key to be deleted, keep track of the
33 | // previous node as we need to change temp.next
34 | while (temp != null && temp.data != key)
35 | {
36 | prev = temp;
37 | temp = temp.next;
38 | }
39 |
40 | // If key was not present in linked list
41 | if (temp == null) return;
42 |
43 | // Unlink the node from linked list
44 | prev.next = temp.next;
45 | }
46 |
47 | /* Inserts a new Node at front of the list. */
48 | public void push(int new_data)
49 | {
50 | Node new_node = new Node(new_data);
51 | new_node.next = head;
52 | head = new_node;
53 | }
54 |
55 | /* This function prints contents of linked list starting from
56 | the given node */
57 | public void printList()
58 | {
59 | Node tnode = head;
60 | while (tnode != null)
61 | {
62 | System.out.print(tnode.data+" ");
63 | tnode = tnode.next;
64 | }
65 | }
66 |
67 | /* Drier program to test above functions. Ideally this function
68 | should be in a separate user class. It is kept here to keep
69 | code compact */
70 | public static void main(String[] args)
71 | {
72 | LinkedList llist = new LinkedList();
73 |
74 | llist.push(7);
75 | llist.push(1);
76 | llist.push(3);
77 | llist.push(2);
78 |
79 | System.out.println("\nCreated Linked list is:");
80 | llist.printList();
81 |
82 | llist.deleteNode(1); // Delete node with data 1
83 |
84 | System.out.println("\nLinked List after Deletion of 1:");
85 | llist.printList();
86 | }
87 | }
88 |
--------------------------------------------------------------------------------
/contributions/Atul/Depth First Search (DFS).kt:
--------------------------------------------------------------------------------
1 | fun main(args: Array) {
2 |
3 | val adjacencyList = AdjacencyList()
4 |
5 | val s = adjacencyList.createVertex("S")
6 | val a = adjacencyList.createVertex("A")
7 | val b = adjacencyList.createVertex("B")
8 | val c = adjacencyList.createVertex("C")
9 | val d = adjacencyList.createVertex("D")
10 | val f = adjacencyList.createVertex("F")
11 | val g = adjacencyList.createVertex("G")
12 | val e = adjacencyList.createVertex("E")
13 |
14 | adjacencyList.add(Undirected(), s, a)
15 | adjacencyList.add(Undirected(), a, b)
16 | adjacencyList.add(Undirected(), a, d)
17 | adjacencyList.add(Undirected(), a, c)
18 | adjacencyList.add(Undirected(), b, d)
19 | adjacencyList.add(Undirected(), d, g)
20 | adjacencyList.add(Undirected(), d, f)
21 | adjacencyList.add(Undirected(), f, e)
22 |
23 | print(adjacencyList)
24 | print(depthFirstSearch(s, e, adjacencyList))
25 |
26 | }
27 |
28 | fun depthFirstSearch(start: VertexString, end: VertexString, graph: AdjacencyList): Stack {
29 | val visited: MutableSet = mutableSetOf()
30 | val stack = Stack()
31 |
32 | stack.push(start)
33 | visited.add(start)
34 |
35 | var vertex = stack.peek()
36 |
37 | loop@while (vertex != null && vertex != end) {
38 |
39 | val neighbors = graph.edges(vertex)
40 | if (neighbors != null && neighbors.count() > 0) {
41 |
42 | for (edge in neighbors) {
43 | if (!visited.contains(edge.destination)) {
44 | visited.add(edge.destination)
45 | stack.push(edge.destination)
46 | print("$stack")
47 | vertex = stack.peek()
48 | continue@loop
49 | }
50 | }
51 |
52 | } else {
53 | print("backtrack from $vertex")
54 | stack.pop()
55 | vertex = stack.peek()
56 | continue
57 | }
58 |
59 | print("backtrack from $vertex")
60 | stack.pop()
61 | vertex = stack.peek()
62 | }
63 |
64 | return stack
65 | }
--------------------------------------------------------------------------------
/contributions/AnmolSingh/Art:
--------------------------------------------------------------------------------
1 | Fax Machines be like: "OOOO oo 0000000 ᵒᵒᴼᵒ⁰ᵒᴼᴼᴼ⁰ᵒᴼᴼᴼᴼᵒᵒᵒ ⁰⁰⁰ᵒ⁰ᵒᵒᵒ⁰ᵒ⁰ᵒ⁰ᵒᴼᴼ⁰ᵒ⁰ᴼ⁰ᴼ⁰ᵒᵒ⁰ᴼ⁰ᴼᵒᴼᴼᴼᵒ DoOOOOOOODOOOOOOOODOOOOOOOOODOOOOOOOOOo
2 |
3 | ⁰⁰⁰ᵒ⁰ᵒᵒᵒ⁰ᵒ⁰ᵒ⁰ᵒᴼᴼ⁰ᵒ⁰ᴼ⁰ᴼ⁰ᵒᵒ⁰ᴼ⁰ᴼᵒᴼᴼᴼᵒ AAAAAAAAAＡＡＡＡ ＲＲＲ ＡＡＡＡＡＲＲＲＲ ＡＡＡＡＡＲＲＲA̸̤̰̯͙̳̦͓̪͖̖̤̭̎̃̈́̿͛̀̅͆̾̓͗͝ͅŞ̸̲̟̬̝̟̜̺̪͎̭̅S̷̯̥̭̪̘̟̹̱̘̫͚̦̘͋̊́̅͂Ș̵̢̛͎̩͎̩̩̖̲̪͓̱͈̦̱̿͂͑̅̑́͗̓̏̋͘͝͝S̴͕̀̎͆͐̋̊͘͠S̶̖̈́͐͂̒͋̍̃͒͑̈́̀̈͠S̸̡̡̡̬̗̲͈͌̐̃̐̒̏̀̈́͝S̸̨͎̙͕̩̠̳͙̠̬̜̯̩̏̒̓̀̈́̀͂̎͗̀̋́̕͠Ş̶̪̹͙̕S̴̮̝̮̣̙͇̈́̋D̷̡͚̦̊̆͌̂̃G̷̢̞͍͒̅̈͐̈́͗͌̅̀̀̄͂̀̿̚A̶̟͖͚̦̤̍̉̎͝S̷̡̪̣̪͈̱͔̪͇̫̹̈͑̎͌̄͐͊̔́̈́͜͜͠J̵̨̩̮̪͑̑̀͝H̶̨̞̜͍̥̻̎́ͅD̸̟̮̺͔͉̆͂͝F̵̛̫̀̈̕G̸̨̟̭͇̿̔̕ͅJ̴̛̲͂̎̏̋̈́̓͗̇̏̉͠Å̶̤̓̽̆̈́͐̀͒̓͆̃͆͗͌H̶͉͔̟̙̊̃̀͊̓͠͠Š̸̢̧̧̥̤͎̻̭̩̞̱̯͉̞̗̈́̾͝D̶̡̻̰͕̭͍̠͉̫̖̤͂͝Ģ̷̯̳̥̳͓̼̹͒̌̈͜͠F̸̧̭̟̦̺̭̻̣̗̭̭̱̜̠̬̽͗͐͗̈̈͋̓͆͆̉Ḧ̸̨̱͈͚̰̤͕̲̲̪̺̪̾̾̎͌͗̀̂̓͋͊̾̇Ấ̵̡͖̥̤̖̪͖̱̫̟͖̅̇̆͋̐̆́̅̏͠S̵̨̨͈̗̪̲͙̞̤̲̗̳̺̓̃̀͊͊̀͐̾͛̉̽͌̚̚͝Ḑ̶̧̫̞̳̽̊͒̔̋͑̏̅̌͛̚͝F̴̦̤̝̖̗̦̗̠͈̝̀̌͗́̄͂̋̆̇͛͐́͒̈́̃J̵̨̧̝̭̳̬̣̣̬̩̬̬͙̺̈̀H̸̢̰̣̦̙͔͍̃̔̋͌̉̓̾̚Ą̶̨̳̂S̸͓̫͒̇̊͒̄̎͆D̴̰̻̊̂͐̐̎̏́̏̏͘̕F̶̧̣̘̦̪̮̰̫̯̞͓̀̓̀̆͐͂̈̕͜͠͝͠H̶̢̨̢͕̰̩̯͍̜̳͕̓́̍̈́͑͗̍̌̓̑̈́͐̕̚Ā̴̧̤̰͓̝̑̆̿̑͛̾̀̒͘J̸̗̈́́̈́Ŝ̴̢͕̖̰͚̗̥͑͊̓̈̌̇̆͒͑͗̂̇D̸̨̛͕̬̩̤̱͗͊̽̍͂̋͠F̴̡̥̌̃̃͆̑͝͝͝J̷̧̢̩̱̥̺̝̖̤̣̎̌͑̀͋̍̔͋̀̃̚A̸̲͗͆̋̌͆̓́̔̌̍̇̂͊̑͑͜H̶̛͕̑̂̐̚̚S̵̺͔͍̼̐̈́̈̆͐̄͑̋̈́̕͝͝Ḑ̶͎̜̌͒̅̈́̈̔̃̔̋F̶͚̼͋̈́̋̈́͜Ģ̷̨̯̫̭͉͇͔͎̙͆̐͆̓̐̀͑́͌̈̎̋̕A̶̧̢̹̟͈̔̾͑̏̈́͂̇̿̄̄̉͝J̸̡͕̜̼̠͔̝̹͈̦̏̊S̵͇͔̤̻̩͚̖͙̰͍̘͚̃͗̎̊̓̓̈́̈́̃̐̕͜ͅȞ̶̢̲̰̩̮͙̪͎̲̝̠͙̃͐̐̅̈́̓͑̚͝͝D̸̢̤̥̘͙͖͍̟͒͛͂̇͐̌͊̇̊͂͌͘̕͠F̷̡̩̞̯̝͕̝̩̝̦̫̜̻͖̒̅̑̓̎́̄͑̏̔͝ͅG̸̢͍̝̝͈͍͙̦̝͇̺̽͗̓͑̊́̈͊̆̂̽̂͘̚Ḁ̷͕̩̰͎̽̑͌͌̓͐̓̈̾̓̍̚̕K̶͚̳̖̭͙̬̖͌̈́̈́͆̋̎J̷̛̗̉̆̎͌͋̽͆̍̄̆̕͘͝͝S̶̨̱̪̖̘̥̺̙̦̖̙̠͓͌̊Ḩ̷̖̼̹̠̞̜̙͇̤̹̝͇̭́̓̚ͅD̵̡̻͇̰͚̦̰̐͂͋̅͑̾̕͝ͅF̷̢̨͍̳͇̘͍̠̠̜̓̆̿͆͛̀́͐͂̚͝ͅĢ̶͓͈̠̖̬̮̞̪̺͇̆͂̈̈́̕ͅA̶̢̙̟͇̗̭̭̹̥͔̹͇͚̻̎̀̀͜Ḱ̷͚̼͔̜͔͓͖̲̟̺͉̻͔̠̽̑̂̄͂͊̌̔̏͘̕͝͝S̷̟̗͚͓̮͕̺̝͍̬͇̩͗́̿͊̓͒̐̐͝J̸̡͈̩̤͇͚͎͔̹͔͋̑͝D̸̨̢̨̻̬̜̥̭͖̬̺̦̯̽̋́̀̊̈́̊̈́͑̌͗͐͛̕͜͜H̵̯̮̔͑̃͛̅̐̆̐͂̈͋̐̾̚G̵͙̝̗̼͚̳͇͓̣͆̂͜A̵̛̛̻̰͍̅̎͛́̄͗̓̾́Ş̶̛͙̠͈̱̬͚̳̪̹͕̤̭̔́̈̀̈́͗͗̑̈L̵̠̟̪͚͚̠͇̗̿̈́̉͂̃͂F̵͓͉̬̺̘͈̣̝͗̈͂͋̓̚͠K̴̟̋̐̃̏͆̊͛̓͆͠J̵̢̛̪̫̫̬̹͔̖͙͓̲̻͌̈́̾̎́̊̾̆̓̍́̍̕͜H̶̡̛̺̖̖͈̙̹̱͖̕͜Ȧ̵̡̯͕̭̳͍̩̙̩̰̫͕̀́̈́͂̊̎̈̑́͌̾͛ͅͅS̵̡̪̫̫̠̗͍̭͓̥̎̉͆̒̋́̓͜͝L̶̢̥̯̮̫̠̫̼̲̝͍̯̯̮̭̀̐͆͆͋̇̇̈́͗̊͠J̶̡̬̲̟̹͚̟̣̬̦͒́̂̔̌̿͘͝͠K̶̡̼̱̙̱̦̼̜͉͉͉̦̉̿̕͝͝ͅD̷̢̨͎̖̘̰͓̜̞͇͙̱̍́͋̍͑͜͠F̸̧̧̥̳̙͇͖͉̳̲̺͙̗͎̑̃͌̑̐͋ͅĜ̴̢͔̠̺͚̘̎̓̒̇̾͝H̶̡̲͚̥̘̹͓̻̳̥͎̦̾͋̔̋̋͑͊̈͛̚͘͜͝J̴̢̨̬̙͔̜̟͉̮̃̾̃̋̓̉̂̒͋̇Ș̷̡̛̹̪̪̤̖̜͙͓̾̇̌̇̆̈́͘͜D̴͙͔͚͓̪̮̰̞̭̎̈̏̾̌́͆̄̕̕͜͝ͅG̴̨̲͙̰͈̖̠̝̠̒̈́͂̑̎̈͑̓̕̚͝F̵̝͇̮̺̮̦͔̈̓͂̿̇̌̓̊̂̿̔͘̕͘Ą̵̨̨̨̛̣̯͕̼͓̯̗̠͇͍̉̔̈̿̈́̀̔̊̚̕͠J̸̨̟̺̭͓̠̄K̸̨̪͔̤͌͝S̸̢͙͕̖̻͑̄̊̄̇̉̍̃͗̀̾́̍͗͘D̴̨̡̟͍̰̜͚͇̙͙̣̹̜̈́̒̿̾̒͘͝F̸̘̥̖͐Ġ̴̱̙
4 |
5 | chhk chk chk chk ch chk chk chhkk chkchk chcchkchkchkc. hkccccchk cchk chkchc ckhc krkrkrhckchk chchkck hkkchrkchckr chkrkrchk ch chhhhhhhhhhhhhkrdk"
6 |
--------------------------------------------------------------------------------
/contributions/Dhruv Khatri/Beale_1.txt:
--------------------------------------------------------------------------------
1 | 71, 194, 38, 1701, 89, 76, 11, 83, 1629, 48, 94, 63, 132, 16, 111, 95, 84, 341, 975,14, 40, 64, 27, 81, 139, 213, 63, 90, 1120, 8, 15, 3, 126, 2018, 40, 74, 758, 485,604, 230, 436, 664, 582, 150, 251, 284, 308, 231, 124, 211, 486, 225, 401, 370,11, 101, 305, 139, 189, 17, 33, 88, 208, 193, 145, 1, 94, 73, 416, 918, 263, 28, 500,538, 356, 117, 136, 219, 27, 176, 130, 10, 460, 25, 485, 18, 436, 65, 84, 200, 283,118, 320, 138, 36, 416, 280, 15, 71, 224, 961, 44, 16, 401, 39, 88, 61, 304, 12, 21,24, 283, 134, 92, 63, 246, 486, 682, 7, 219, 184, 360, 780, 18, 64, 463, 474, 131,160, 79, 73, 440, 95, 18, 64, 581, 34, 69, 128, 367, 460, 17, 81, 12, 103, 820, 62,116, 97, 103, 862, 70, 60, 1317, 471, 540, 208, 121, 890, 346, 36, 150, 59, 568,614, 13, 120, 63, 219, 812, 2160, 1780, 99, 35, 18, 21, 136, 872, 15, 28, 170, 88, 4,30, 44, 112, 18, 147, 436, 195, 320, 37, 122, 113, 6, 140, 8, 120, 305, 42, 58, 461,44, 106, 301, 13, 408, 680, 93, 86, 116, 530, 82, 568, 9, 102, 38, 416, 89, 71, 216,728, 965, 818, 2, 38, 121, 195, 14, 326, 148, 234, 18, 55, 131, 234, 361, 824, 5,81, 623, 48, 961, 19, 26, 33, 10, 1101, 365, 92, 88, 181, 275, 346, 201, 206, 86,36, 219, 324, 829, 840, 64, 326, 19, 48, 122, 85, 216, 284, 919, 861, 326, 985,233, 64, 68, 232, 431, 960, 50, 29, 81, 216, 321, 603, 14, 612, 81, 360, 36, 51, 62,194, 78, 60, 200, 314, 676, 112, 4, 28, 18, 61, 136, 247, 819, 921, 1060, 464, 895,10, 6, 66, 119, 38, 41, 49, 602, 423, 962, 302, 294, 875, 78, 14, 23, 111, 109, 62,31, 501, 823, 216, 280, 34, 24, 150, 1000, 162, 286, 19, 21, 17, 340, 19, 242, 31,86, 234, 140, 607, 115, 33, 191, 67, 104, 86, 52, 88, 16, 80, 121, 67, 95, 122, 216,548, 96, 11, 201, 77, 364, 218, 65, 667, 890, 236, 154, 211, 10, 98, 34, 119, 56,216, 119, 71, 218, 1164, 1496, 1817, 51, 39, 210, 36, 3, 19, 540, 232, 22, 141, 617,84, 290, 80, 46, 207, 411, 150, 29, 38, 46, 172, 85, 194, 39, 261, 543, 897, 624, 18,212, 416, 127, 931, 19, 4, 63, 96, 12, 101, 418, 16, 140, 230, 460, 538, 19, 27, 88,612, 1431, 90, 716, 275, 74, 83, 11, 426, 89, 72, 84, 1300, 1706, 814, 221, 132,40, 102, 34, 868, 975, 1101, 84, 16, 79, 23, 16, 81, 122, 324, 403, 912, 227, 936,447, 55, 86, 34, 43, 212, 107, 96, 314, 264, 1065, 323, 428, 601, 203, 124, 95, 216,814, 2906, 654, 820, 2, 301, 112, 176, 213, 71, 87, 96, 202, 35, 10, 2, 41, 17, 84,221, 736, 820, 214, 11, 60, 760.
2 |
--------------------------------------------------------------------------------
/contributions/Shubham-Bhandari/restart-router.py:
--------------------------------------------------------------------------------
1 |
2 | from selenium import webdriver
3 | from selenium.webdriver.chrome.options import Options
4 | from selenium.common.exceptions import WebDriverException
5 |
6 | # function to update chrome driver
7 | def update_chrome_driver(n):
8 | import subprocess
9 | try:
10 | print('Need to update the Chromedriver')
11 | rc = subprocess.run('/home/sb/dev/Projects-Python/automate-boring-stuff/update-chrome-driver.sh')
12 | rc.check_returncode()
13 | print('Chrome driver updated successfully')
14 | main(n + 1)
15 | except subprocess.CalledProcessError:
16 | print('Error in updating Chrome driver, please do it manually')
17 | return
18 |
19 |
20 | def main(n):
21 | if n <= 1:
22 | try:
23 | opt = Options()
24 | opt.headless = True
25 | global browser
26 | browser = webdriver.Chrome(chrome_options=opt)
27 | print('Rebooting router')
28 | browser.get('http://192.168.1.254')
29 | browser.find_element_by_xpath(r'//*[(@id = "username")]').send_keys('') #Enter your user id here.
30 | browser.find_element_by_xpath(r'//*[(@id = "password")]').send_keys('') #enter your password here
31 | browser.find_element_by_xpath(
32 | '//td//td[(((count(preceding-sibling::*) + 1) = 1) and parent::*)]//input').click()
33 | browser.find_element_by_xpath('//*[contains(concat( " ", @class, " " ),'
34 | ' concat( " ", "x_main_menu", " " )) '
35 | 'and (((count(preceding-sibling::*) + 1) = 5) and parent::*)]//a').click()
36 | browser.find_element_by_xpath('/html/body/div/section/div[1]/div[1]/div[1]/ul[5]/li[5]').click()
37 | browser.switch_to.frame(browser.find_element_by_id('mainFrame'))
38 | browser.find_element_by_id('do_reboot').click()
39 | alert = browser.switch_to.alert
40 | alert.accept()
41 | import time
42 | time.sleep(2)
43 | browser.close()
44 | print('Successfully Rebooted')
45 | except WebDriverException:
46 | update_chrome_driver(n)
47 | else:
48 | print("Error in rebooting router")
49 |
50 |
51 | main(0)
52 |
--------------------------------------------------------------------------------
/webapp/src/BaseComponents/InfoAccordion.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import {makeStyles} from '@material-ui/core/styles';
3 | import Accordion from '@material-ui/core/Accordion';
4 | import AccordionSummary from '@material-ui/core/AccordionSummary';
5 | import AccordionDetails from '@material-ui/core/AccordionDetails';
6 | import Typography from '@material-ui/core/Typography';
7 | import ExpandMoreIcon from '@material-ui/icons/ExpandMore';
8 | import './InfoAccordion.css';
9 | import Pic from '../media/hack.png';
10 |
11 |
12 | const useStyles = makeStyles((theme) => ({
13 | heading: {
14 | fontSize: theme.typography.pxToRem(15),
15 | fontWeight: theme.typography.fontWeightRegular,
16 | color: 'white'
17 | },
18 | coloring: {
19 | backgroundColor: '#2980B9',
20 | },
21 | text: {
22 | color: 'white'
23 | }
24 | }));
25 |
26 | export default function InfoAccordion(props) {
27 | const classes = useStyles();
28 | const [expanded, setExpanded] = React.useState(false);
29 | // const image =[Pic,Git];
30 |
31 | const handleChange = (panel) => (event, isExpanded) => {
32 | console.log(panel);
33 | setExpanded(isExpanded ? panel : false);
34 | };
35 | return (
36 |
37 | }
39 | aria-controls={props.controls}
40 | id={props.id}
41 | >
42 | {props.heading}
43 |
44 |
45 | {props.isImage ? 
: null}
46 |
47 |
48 | {props.content}
49 |
50 |
51 |
52 |
53 | );
54 | }
55 |
--------------------------------------------------------------------------------
/contributions/Megha khangarot/end & print.txt:
--------------------------------------------------------------------------------
1 | Print - itself carries the meaning of new line character and
2 | "end" in Python is behaving like a variable to display any value - Hi/space,
3 | otherwise end behaves like new line, we need to stick it to same line until all stars are printed
4 |
5 | Python's print() function comes with a parameter called 'end'. By default,
6 | the value of this parameter is '\n', i.e. the new line character.
7 |
8 | The end key of print function will set the string that needs
9 | to be appended when printing is done.
10 |
11 | By default the end key is set by newline character.
12 | So after finishing printing all the variables,
13 | a newline character is appended.
14 | Hence, we get the output of each print statement in different line.
15 | But we will now overwrite the newline character by a hyphen(-)
16 | at the end of the print statement. See the following example.
17 |
18 | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
19 |
20 | # initialize a list
21 | initList = ['camel', 'case', 'stop']
22 |
23 | # print each words using loop
24 | print('Printing using default print function')
25 | for item in initList:
26 | print(item) # default print function. newline is appended after each item.
27 |
28 | print() # another newline
29 |
30 | # print each words using modified print function
31 | print('Printing using modified print function')
32 | for item in initList:
33 | print(item, end='-')
34 |
35 | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
36 | Output
37 |
38 | Printing using default print function
39 | camel
40 | case
41 | stop
42 |
43 | Printing using modified print function
44 | camel-case-stop-
45 | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
46 |
47 | Another example
48 |
49 | for i in range(0, 5):
50 | for j in range(0, i+1):
51 | print("*",end="")
52 | print()
53 |
54 | *
55 | **
56 | ***
57 | ****
58 | *****
59 |
60 |
61 | for i in range(0, 5):
62 | for j in range(0, i+1):
63 | print("* ",end="")
64 | print()
65 |
66 | *
67 | * *
68 | * * *
69 | * * * *
70 | * * * * *
71 |
72 | for i in range(0, 5):
73 | for j in range(0, i+1):
74 | print("* ",end="Hi")
75 | print()
76 |
77 | * Hi
78 | * Hi* Hi
79 | * Hi* Hi* Hi
80 | * Hi* Hi* Hi* Hi
81 | * Hi* Hi* Hi* Hi* Hi
--------------------------------------------------------------------------------
/webapp/src/util/FormValidation.js:
--------------------------------------------------------------------------------
1 | import {AddUser} from './FormDb';
2 | import {Octokit} from '@octokit/core'
3 |
4 |
5 | import pat from '../settings';
6 |
7 |
8 | async function validateGithubId(id) {
9 | const kit = new Octokit({auth: pat.pat, userAgent: 'network-jklu-webapp'});
10 | return await kit.request('GET /users/' + id, {});
11 | }
12 |
13 | function getRequiredFields(result) {
14 |
15 | return {
16 | 'gitId': result.data.login,
17 | 'avatar': result.data.avatar_url,
18 | 'pubRepo': result.data.public_repos
19 | }
20 | }
21 |
22 | export default function FormValidation(gitId, clg, frndOne, frndTwo, frndThree, frndFour, loc, name) {
23 | let friends = [];
24 | let unqFriends = new Set();
25 | unqFriends.add(frndOne);
26 | unqFriends.add(frndTwo);
27 | unqFriends.add(frndThree);
28 | unqFriends.add(frndFour);
29 | unqFriends.delete('');
30 | unqFriends = Array.from(unqFriends);
31 | let mainUser = {};
32 | return validateGithubId(gitId).then(res => {
33 | mainUser = getRequiredFields(res);
34 | if (unqFriends.includes(gitId) || unqFriends.length < 2) {
35 | return false
36 | }
37 | return validateGithubId(unqFriends[0]);
38 | }).then(res => {
39 | if (res) {
40 | friends.push(getRequiredFields(res));
41 | return validateGithubId(unqFriends[1]);
42 | }
43 | return false
44 | }).then(res => {
45 | if (res) {
46 | friends.push(getRequiredFields(res));
47 | if (unqFriends.length >= 3) {
48 | return validateGithubId(unqFriends[2]);
49 | } else {
50 | return true
51 | }
52 | }
53 | return false
54 | }).then(res => {
55 | if (res === false) {
56 | return false
57 | }
58 | if (res !== true) {
59 | friends.push(getRequiredFields(res));
60 | if (unqFriends.length === 4) {
61 | return validateGithubId(unqFriends[3])
62 | }
63 | }
64 | return true
65 | }).then(res => {
66 |
67 | if (res === false) {
68 | return false
69 | }
70 | if (res !== true) {
71 | friends.push(getRequiredFields(res));
72 | }
73 | return AddUser(mainUser, clg, friends, loc, name);
74 | })
75 | }
76 |
77 |
--------------------------------------------------------------------------------
/contributions/Saumya-Patel/Snowball_Numbers.py:
--------------------------------------------------------------------------------
1 | #!/usr/bin/env python
2 | # coding: utf-8
3 |
4 | # In[ ]:
5 |
6 |
7 | def letter_distribution(sentence):
8 | all_freq = {}
9 | for i in sentence: #loop through characters of sentence
10 | if i.isalpha():
11 | if i in all_freq: # characters is not a key in all_freq
12 | all_freq[i] += 1
13 | else:
14 | all_freq[i] = 1
15 | return (all_freq)
16 |
17 |
18 | # In[ ]:
19 |
20 |
21 | def snowball(sentence):
22 | freq = letter_distribution(sentence)
23 | frequency = []
24 | for v in freq.values():
25 | frequency.append(v) # making a list of values of freq
26 | freq_1 = []
27 | for i in frequency:
28 | if(i not in freq_1):
29 | freq_1.append(i) # making a unique list of all elements in frequency
30 | if(len(freq_1) < len(frequency)): # elemnts in frequency were duplicate
31 | return False
32 | else:
33 | return True
34 |
35 |
36 | # In[ ]:
37 |
38 |
39 | def pyramid(sentence):
40 | freq = letter_distribution(sentence)
41 | frequency = []
42 | for v in freq.values():
43 | frequency.append(v) # making a list of values of freq
44 | freq_1 = []
45 | for i in range(len(frequency)):
46 | count =0
47 | for j in range(i+1,len(frequency)):
48 | if(frequency[i]==frequency[j]): # if the element occurs again in list
49 | count+=1
50 | freq_1.append(count)
51 | flag=0
52 | for i in freq_1:
53 | if(i==1): # if 1 occurs in freq_1
54 | flag =1
55 | if(flag==1):
56 | return True
57 | else:
58 | return False
59 |
60 |
61 | # In[ ]:
62 |
63 |
64 | def pi(sentence):
65 | from mpmath import mp
66 | freq = letter_distribution(sentence)
67 | frequency = []
68 | for v in freq.values():
69 | frequency.append(str(v)) # making a list of values of freq
70 | string = ""
71 | for i in frequency:
72 | string += i
73 | sort_string = sorted(string) #sorting string elements
74 | mp.dps = len(frequency)
75 | pi_num = mp.pi #to get value of pi till 50 decimal places
76 | pi_num = str(pi_num)
77 | PI_n = ""
78 | for i in pi_num:
79 | if(i == "."):
80 | pass
81 | else:
82 | PI_n += i
83 | sort_pi = sorted(PI_n)
84 | if(sort_string == sort_pi):
85 | return True
86 | else:
87 | return False
88 |
89 |
--------------------------------------------------------------------------------
/contributions/Shruti Solani/Stack in C.c:
--------------------------------------------------------------------------------
1 | //Implementing Stacks using array
2 | //using a menu-driven program
3 | #include
4 | #define MAX 10 //defining size of stack
5 |
6 | int stack[MAX] , top = -1;
7 | void push(int st[], int value); //push value into stack
8 | int pop(int st[]); //pop element from stack
9 | int peek(int st[]); //returns top element in stack
10 | void display(int st[]); //displays stack
11 |
12 | int main()
13 | {
14 | int value,choice,popped,peeked;
15 | do
16 | {
17 | printf("\n1) Push");
18 | printf("\n2) Pop");
19 | printf("\n3) Peek");
20 | printf("\n4) Display");
21 | printf("\n5) Exit");
22 | printf("\nEnter your choice : ");
23 | scanf("%d",&choice);
24 | switch(choice)
25 | {
26 | case 1:
27 | printf("\nEnter value to push : ");
28 | scanf("%d",&value);
29 | push(stack,value);
30 | break;
31 | case 2:
32 | popped = pop(stack);
33 | if(popped != -1)
34 | printf("%d is popped",popped);
35 | break;
36 | case 3:
37 | peeked = peek(stack);
38 | if(peeked != -1)
39 | printf("%d is at the top of stack",peeked);
40 | break;
41 | case 4:
42 | display(stack);
43 | break;
44 | }
45 | }while(choice != 5);
46 | return 0;
47 | }
48 |
49 | void push(int st[],int value)
50 | {
51 | if(top == MAX - 1)
52 | {
53 | printf("\nStack is full");
54 | }
55 | else
56 | {
57 | top++;
58 | st[top] = value;
59 | }
60 | }
61 |
62 | int pop(int st[])
63 | {
64 | int popped;
65 | if(top == -1)
66 | {
67 | printf("\nStack is empty.");
68 | }
69 | else
70 | {
71 | popped = st[top];
72 | top--;
73 | return popped;
74 | }
75 | }
76 |
77 | int peek(int st[])
78 | {
79 | if(top == -1)
80 | {
81 | printf("\nStack is Empty");
82 | }
83 | else
84 | {
85 | int peeked = st[top];
86 | return peeked;
87 | }
88 | }
89 |
90 | void display(int st[])
91 | {
92 | int i;
93 | if(top == -1)
94 | {
95 | printf("\nStack is Empty.");
96 | }
97 | else
98 | {
99 | for(i = top; i>=0; i--)
100 | {
101 | printf("\n%d",st[i]);
102 | }
103 | }
104 | }
105 |
--------------------------------------------------------------------------------
/webapp/src/logo.svg:
--------------------------------------------------------------------------------
1 |
8 |
--------------------------------------------------------------------------------
/contributions/activity-logger:
--------------------------------------------------------------------------------
1 | from __future__ import print_function
2 | import pickle
3 | import os.path
4 | from googleapiclient.discovery import build
5 | from google_auth_oauthlib.flow import InstalledAppFlow
6 | from google.auth.transport.requests import Request
7 | import datetime
8 | import argparse
9 |
10 | parser = argparse.ArgumentParser()
11 | parser.add_argument('act', help='Name of the activity')
12 | parser.add_argument('-d', '--desc', help='Description of the activity')
13 | args = parser.parse_args()
14 | # If modifying these scopes, delete the file token.pickle.
15 | SCOPES = ['https://www.googleapis.com/auth/spreadsheets']
16 | base = '' # file directory location
17 |
18 |
19 | def main(act='-', desc='-'):
20 | creds = None
21 | # The file token.pickle stores the user's access and refresh tokens, and is
22 | # created automatically when the authorization flow completes for the first
23 | # time.
24 | if os.path.exists(base + 'token.pickle'):
25 | with open(base + 'token.pickle', 'rb') as token:
26 | creds = pickle.load(token)
27 | # If there are no (valid) credentials available, let the user log in.
28 | if not creds or not creds.valid:
29 | if creds and creds.expired and creds.refresh_token:
30 | creds.refresh(Request())
31 | else:
32 | flow = InstalledAppFlow.from_client_secrets_file(
33 | base + 'client_secret.json', SCOPES)
34 | creds = flow.run_local_server(port=0)
35 | # Save the credentials for the next run
36 | with open(base + 'token.pickle', 'wb') as token:
37 | pickle.dump(creds, token)
38 |
39 | service = build('sheets', 'v4', credentials=creds)
40 |
41 | spreadsheet_id = '' #Id for the spreadsheet
42 | range_name = 'Sheet1'
43 | value_input_option = 'RAW'
44 | date = datetime.date.today()
45 | time = datetime.datetime.now()
46 | print('{0}: {1}/{2}/{3}::{4}:{5}:{6}'.format(act, date.day, date.month, date.year, time.hour, time.minute,
47 | time.second))
48 | values = {'values': [[act, desc, date.day, date.month, date.year, time.hour, time.minute, time.second]]}
49 | # Call the Sheets API
50 | sheet = service.spreadsheets()
51 | result = sheet.values().append(
52 | spreadsheetId=spreadsheet_id, range=range_name,
53 | valueInputOption=value_input_option, insertDataOption='INSERT_ROWS',
54 | body=values
55 | ).execute()
56 | print('{0} cells updated.'.format(result['updates'].get('updatedCells')))
57 |
58 |
59 | if __name__ == '__main__':
60 | main(args.act, args.desc)
61 |
--------------------------------------------------------------------------------
/contributions/Vanshika Sharma/queue.java:
--------------------------------------------------------------------------------
1 | import java.util.Scanner;
2 | public class queue
3 | {
4 | public static void main(String args[])
5 | {
6 | Scanner sc = new Scanner(System.in);
7 | System.out.print("Size of queue: ");
8 | int size = sc.nextInt(), choice=0;
9 | queue_methods ob = new queue_methods(size);
10 | System.out.println("Menu:\n1. Push \n2. Pop \n3. Peep \n4. Exit");
11 | System.out.print("\nEnter your choice (number): ");
12 | choice = sc.nextInt();
13 | while(choice != 4)
14 | {
15 | switch(choice)
16 | {
17 | case 1: System.out.print("Enter value: ");
18 | int n= sc.nextInt();
19 | ob.push(n);
20 | ob.display();
21 | break;
22 | case 2: ob.pop();
23 | ob.display();
24 | break;
25 | case 3: ob.peep();
26 | break;
27 | default: System.out.println("Wrong choice");
28 | break;
29 | }
30 | System.out.print("\nEnter your choice (number): ");
31 | choice = sc.nextInt();
32 | }
33 | }
34 | }
35 |
36 | class queue_methods
37 | {
38 | int arr[], front, rear, size;
39 | public queue_methods(int s)
40 | {
41 | size =s;
42 | arr = new int[size];
43 | front = -1;
44 | rear=-1;
45 | }
46 | public void push(int n)
47 | {
48 | if(rear == size-1)
49 | System.out.println("**Queue is Overflowing**");
50 | else
51 | {
52 | rear++;
53 | arr[rear] = n;
54 | System.out.println("--Item is pushed--");
55 | }
56 | if(rear == 0) //condition of first element getting pushed
57 | front = 0;
58 | }
59 | public void pop()
60 | {
61 | if(front == -1)
62 | System.out.println("**Underflow**");
63 | else if (front == rear)
64 | {
65 | front = rear = -1;
66 | System.out.println("---Item Popped---");
67 | }
68 | else
69 | {
70 | System.out.println("---Item Popped---");
71 | front++;
72 | }
73 | }
74 | public void peep()
75 | {
76 | if(rear==-1)
77 | System.out.println("---Queue is Empty---");
78 | else
79 | System.out.println("-- Queue has following value on rear: --\n "+arr[rear]);
80 | }
81 | public void display()
82 | {
83 | if(rear == -1)
84 | System.out.println("---Queue is Empty---");
85 | else
86 | {
87 | System.out.println("Your Queue contains: ");
88 | for(int x=rear; x>=front; x--)
89 | System.out.println(arr[x]);
90 | }
91 | }
92 | }
93 |
--------------------------------------------------------------------------------
/contributions/Ritika-Roongta/ANN.txt:
--------------------------------------------------------------------------------
1 | For creating an Artificial Neural Network (ANN), I have used the Pima-Indian-Diabetes data set which was freeley available on Kaggle.
2 | The result obtained will show a prediction of whether a person has diabetes or not.
3 | If the predicted values comes out to be '1', it means the person has diabetes and if it comes out to be '0', he/she does not has diabetes.
4 | Firsty I imported fifferent libraries like pandas, sklearn's model selection & the dataset and then the dataset was converted into an array.
5 | Then data was split into independent set 'X' and dependent set 'y'. Then, the dataset values were processed so that they contain values between 0 and 1.
6 | Then data was again splitted into training and testing data.
7 | Then processing for ANN was done. Here data was divided into three layers using "Sequential model" and "reLu, sigmoid" activations. After the above data is compiled, 'binary_crossentropy' loss function was done to measure how well training was done and then Stochastic Gradient Descent ‘sgd’ optimizer was used to improve upon the loss. Accuracy on each step was also calculated using 'accuracy' metrics. The model was trained by using the fit method on the training data, and in batch sizes of 57, with 1000 epochs. To see how well the model is performing, validation data was given to the model by splitting the training data into 20% validation. Then model performance was visualized using graphs. Lastly, predictrion was done using X_test data set. A threshold was created where values .5 and above classify the target data as (1) and values less then that as (0). Then, the model was evaluated on training and testing data set and corresponding accuracy was calculated.
8 |
9 |
10 |
11 |
12 | data1 = json.load(inputFile1)
13 | inputFile1.close()
14 | data2 = json.load(inputFile2)
15 | inputFile2.close()
16 | data3 = json.load(inputFile3)
17 | inputFile3.close()
18 | data4 = json.load(inputFile4)
19 | inputFile4.close()
20 | data5 = json.load(inputFile5)
21 | inputFile5.close()
22 | output1 = csv.writer(outputFile1)
23 | output2 = csv.writer(outputFile2)
24 | output3 = csv.writer(outputFile3)
25 | output4 = csv.writer(outputFile4)
26 | output5 = csv.writer(outputFile5)
27 |
28 |
29 |
30 |
31 | inputFile4 = pd.read_json("/content/yelp_academic_dataset_tip.json", lines=True)
32 | inputFile5 = pd.read_json("/content/yelp_academic_dataset_user.json", lines=True)
33 |
34 |
35 |
36 | outputFile4 = inputFile4.to_csv("/content/tip.csv")
37 | outputFile5 = inputFile5.to_csv("/content/user.csv")
38 |
39 |
40 | inputFile3 = pd.read_json("/content/yelp_academic_dataset_review.json", lines=True)
41 | outputFile3 = inputFile3.to_csv("/content/review.csv")
42 |
43 |
44 |
45 | LOAD CSV FROM "file:////content/checkin.csv"
46 | LOAD CSV FROM "file:////content/tip.csv"
47 |
--------------------------------------------------------------------------------
/contributions/SwatiTripathi/Pattern_In_C.c:
--------------------------------------------------------------------------------
1 | #include
2 | void fullpyramidofStars(int rows){
3 | int i, blank, k = 0;
4 | for (i = 1; i <= rows; ++i, k = 0) {
5 | for (blank = 1; blank <= rows - i; ++blank) {
6 | printf(" ");
7 | }
8 | while (k != 2 * i - 1) {
9 | printf("* ");
10 | ++k;
11 | }
12 | printf("\n");
13 | }
14 | }
15 | void FullPyramidOfNumbers(int rows)
16 | {
17 | int i, space, k = 0, count = 0, count1 = 0;
18 | for (i = 1; i <= rows; ++i) {
19 | for (space = 1; space <= rows - i; ++space) {
20 | printf(" ");
21 | ++count;
22 | }
23 | while (k != 2 * i - 1) {
24 | if (count <= rows - 1) {
25 | printf("%d ", i + k);
26 | ++count;
27 | } else {
28 | ++count1;
29 | printf("%d ", (i + k - 2 * count1));
30 | }
31 | ++k;
32 | }
33 | count1 = count = k = 0;
34 | printf("\n");
35 | }
36 | }
37 | void InvertedPyramidofStars(int rows)
38 | {
39 | int i, j, space;
40 | for (i = rows; i >= 1; --i) {
41 | for (space = 0; space < rows - i; ++space)
42 | printf(" ");
43 | for (j = i; j <= 2 * i - 1; ++j)
44 | printf("* ");
45 | for (j = 0; j < i - 1; ++j)
46 | printf("* ");
47 | printf("\n");
48 | }
49 | }
50 | void HalfPyramidofStars(int rows)
51 | {
52 | int i, j;
53 | for (i = 1; i <= rows; ++i) {
54 | for (j = 1; j <= i; ++j) {
55 | printf("* ");
56 | }
57 | printf("\n");
58 | }
59 | }
60 | int main() {
61 | int rows,choice =0;
62 | printf("Enter the number of rows: ");
63 | scanf("%d", &rows);
64 | printf("List of Patterns this program can print ");
65 | printf("\n1)Full Pyramid of stars \n2)Full Pyramid of Numbers");
66 | printf("\n3)Inverted Pyramid of stars \n4)Half Pyramid of Stars\n");
67 | printf("5)Quit program ");
68 | printf("\nEnter your choice no(1-5) from list below:\n");
69 | scanf("%d", &choice);
70 | switch(choice)
71 | {
72 | case 1: fullpyramidofStars(rows);break;
73 | case 2: FullPyramidOfNumbers(rows);break;
74 | case 3: InvertedPyramidofStars(rows);break;
75 | case 4: HalfPyramidofStars(rows);break;
76 | case 5: printf("Quiting\n");return 0;
77 | default: printf("wrong choice"); break;
78 | }
79 | return 0;
80 | }
81 | /* Output looks like below:
82 | Enter the number of rows: 5
83 | List of Patterns this program can print
84 | 1)Full Pyramid of stars
85 | 2)Full Pyramid of Numbers
86 | 3)Inverted Pyramid of stars
87 | 4)Half Pyramid of Stars
88 | 5)Quit program
89 | Enter your choice no(1-5) from list below:
90 | 1
91 | *
92 | * * *
93 | * * * * *
94 | * * * * * * *
95 | * * * * * * * * *
96 |
97 |
98 | */
--------------------------------------------------------------------------------
/contributions/Adarsh_Sengar/heap.py:
--------------------------------------------------------------------------------
1 | #!/usr/bin/python
2 |
3 | # This heap class start from here.
4 | class Heap:
5 | def __init__(self): # Default constructor of heap class.
6 | self.h = []
7 | self.currsize = 0
8 |
9 | def leftChild(self, i):
10 | if 2 * i + 1 < self.currsize:
11 | return 2 * i + 1
12 | return None
13 |
14 | def rightChild(self, i):
15 | if 2 * i + 2 < self.currsize:
16 | return 2 * i + 2
17 | return None
18 |
19 | def maxHeapify(self, node):
20 | if node < self.currsize:
21 | m = node
22 | lc = self.leftChild(node)
23 | rc = self.rightChild(node)
24 | if lc is not None and self.h[lc] > self.h[m]:
25 | m = lc
26 | if rc is not None and self.h[rc] > self.h[m]:
27 | m = rc
28 | if m != node:
29 | temp = self.h[node]
30 | self.h[node] = self.h[m]
31 | self.h[m] = temp
32 | self.maxHeapify(m)
33 |
34 | def buildHeap(
35 | self, a
36 | ): # This function is used to build the heap from the data container 'a'.
37 | self.currsize = len(a)
38 | self.h = list(a)
39 | for i in range(self.currsize // 2, -1, -1):
40 | self.maxHeapify(i)
41 |
42 | def getMax(self): # This function is used to get maximum value from the heap.
43 | if self.currsize >= 1:
44 | me = self.h[0]
45 | temp = self.h[0]
46 | self.h[0] = self.h[self.currsize - 1]
47 | self.h[self.currsize - 1] = temp
48 | self.currsize -= 1
49 | self.maxHeapify(0)
50 | return me
51 | return None
52 |
53 | def heapSort(self): # This function is used to sort the heap.
54 | size = self.currsize
55 | while self.currsize - 1 >= 0:
56 | temp = self.h[0]
57 | self.h[0] = self.h[self.currsize - 1]
58 | self.h[self.currsize - 1] = temp
59 | self.currsize -= 1
60 | self.maxHeapify(0)
61 | self.currsize = size
62 |
63 | def insert(self, data): # This function is used to insert data in the heap.
64 | self.h.append(data)
65 | curr = self.currsize
66 | self.currsize += 1
67 | while self.h[curr] > self.h[curr / 2]:
68 | temp = self.h[curr / 2]
69 | self.h[curr / 2] = self.h[curr]
70 | self.h[curr] = temp
71 | curr = curr / 2
72 |
73 | def display(self): # This function is used to print the heap.
74 | print(self.h)
75 |
76 |
77 | def main():
78 | l = list(map(int, input().split()))
79 | h = Heap()
80 | h.buildHeap(l)
81 | h.heapSort()
82 | h.display()
83 |
84 |
85 | if __name__ == "__main__":
86 | main()
87 |
--------------------------------------------------------------------------------
/contributions/namanagarwal/Array_Implementation.py:
--------------------------------------------------------------------------------
1 | #Stacks can be implemented with th ehelp of arrays as well.
2 | #We can insert and delete elements only at the end of the array(the top of the stack)
3 | #Python comes built-in with lists which are basically arrays.
4 | #They contain functionalities like append and pop which correspond to the push and pop methods of stacks respectively
5 | #So implementing stacks using arrays is pretty simple in Python
6 | #The time complexities of different operations are same as that for the inked list implementation of stacks
7 |
8 |
9 | #We define a class Stack with the array which will store the elements and the methods we require for a stack
10 | class Stack():
11 |
12 | #The constructor consists of only an empty array as length comes built-in with arrays(lists)
13 | def __init__(self):
14 | self.array = []
15 |
16 | #In the peek method we access the last element of the array(top element of the stack) by using the built-in length functionality of arrays
17 | def peek(self):
18 | return self.array[len(self.array)-1]
19 |
20 | #For push operation, we use the built-in append method of lists, which appends/pushes/inserts an element at the end of the list(top of the stack)
21 | def push(self, data):
22 | self.array.append(data)
23 | return
24 |
25 | #For pop operation, we use thebuilt-in pop method of lists, which removes the last element of the list(top element of the stack)
26 | #Time complexity of pop operation for the last element of the list is O(1).
27 | def pop(self):
28 | if len(self.array)!= 0:
29 | self.array.pop()
30 | return
31 | else:
32 | print("Stack Empty")
33 | return
34 |
35 | #Stack follows LIFO, so for the print operation, we have to print the last element of the list first.
36 | #This will require a loop traversing the entire array, so the complexity is O(n)
37 | def print_stack(self):
38 | for i in range(len(self.array)-1, -1, -1):
39 | print(self.array[i])
40 | return
41 |
42 |
43 |
44 | my_stack = Stack()
45 | my_stack.push("Andrei's")
46 | my_stack.push("Courses")
47 | my_stack.push("Are")
48 | my_stack.push("Awesome")
49 | my_stack.print_stack()
50 | #Awesome
51 | #Are
52 | #Courses
53 | #Andrei's
54 |
55 | my_stack.pop()
56 | my_stack.pop()
57 | my_stack.print_stack()
58 | #Courses
59 | #Andrei's
60 |
61 | print(my_stack.peek())
62 | #Courses
63 |
64 | print(my_stack.__dict__)
65 | #{'array': ["Andrei's", 'Courses']}
66 |
67 |
68 | '''Stacks can be implemented in Python in two more ways.
69 | 1. Using the 'deque' class from 'collections' module. Same methods used in lists, append and pop are used in deques
70 | 2. Using 'LifoQueue' from the 'queue' module . 'put()' and 'get()' methods are used for pushing and popping. It comes with some other useful metjods async well.
71 | '''
--------------------------------------------------------------------------------