Codenervemerge

.github/workflows/maven.yml

@@ -0,0 +1,37 @@
+# This workflow will build a Java project with Maven
+# For more information see: https://help.github.com/actions/language-and-framework-guides/building-and-testing-java-with-maven
+
+name: Java CI with Maven
+
+on:
+  push:
+    branches: [ master ]
+  pull_request:
+    branches: [ master ]
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    steps:
+    - uses: actions/checkout@v2
+    - name: Set up JDK 1.8
+      uses: actions/setup-java@v1
+      with:
+        java-version: 1.8
+    - name: Build with Maven
+      run: mvn -P doc
+    - name: Zip Release
+      # You may pin to the exact commit or the version.
+      # uses: TheDoctor0/zip-release@a1afcab9c664c9976ac398fa831eac67bed1eb0e
+      uses: TheDoctor0/[email protected]
+      with:
+        # Filename for archive
+        filename: site.zip
+        # Base path for archive files
+        path: target/staging
+    - uses: actions/upload-artifact@v2
+      with:
+        name: Artifact upload
+        path: site.zip

.gitignore

@@ -0,0 +1,7 @@
+target
+*/.classpath
+*/.project
+*/.settings
+.settings
+.project
+.classpath

AddFibonacciNumbers/pom.xml

@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+  xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+  <modelVersion>4.0.0</modelVersion>
+
+  <parent>
+    <groupId>com.let.us.java</groupId>
+    <artifactId>LetUsJava</artifactId>
+    <version>1.0-SNAPSHOT</version>
+  </parent>
+
+  <groupId>com.let.us.java</groupId>
+  <artifactId>AddFibonacciNumbers</artifactId>
+  <packaging>jar</packaging>
+
+  <name>Add Fibonacci Numbers</name>
+
+</project>

AddFibonacciNumbers/src/main/java/BruteForce.java

@@ -0,0 +1,31 @@
+import java.io.*;
+
+public class BruteForce { 
+
+
+    static int calculateSum(int n) {
+        if (n <= 0)
+           return 0;
+
+        int fibo[]=new int[n+1];
+        fibo[0] = 0; fibo[1] = 1;
+
+        // Initialize result
+        int sum = fibo[0] + fibo[1];
+
+        // Add remaining terms
+        for (int i=2; i<=n; i++)
+        {
+            fibo[i] = fibo[i-1]+fibo[i-2];
+            sum += fibo[i];
+        }
+
+        return sum;
+    }
+
+    public static void main(String args[]) {
+        int n = 4;
+        System.out.println("Sum of Fibonacci" +
+        " numbers is : "+ calculateSum(n));
+    }
+}

AddFibonacciNumbers/src/main/java/DPEfficient.java

@@ -0,0 +1,20 @@
+import java.util.HashMap;
+import java.util.Map;
+
+public class DPEfficient {
+    Map<Integer,Integer> map = new HashMap<>();
+
+    public int fib(int n) {
+        if(n <= 0) {
+            return 0;
+        } else if(n == 1 || n == 2) {
+            return 1;
+        } else if(map.containsKey(n)){
+            return map.get(n);
+        } else {
+            int answer = fib(n - 1) + fib(n - 2);
+            map.put(n, answer);
+            return answer;
+        }
+    }
+}

AddFibonacciNumbers/src/main/java/Efficient.java

@@ -0,0 +1,50 @@
+import java.io.*;
+import java.util.*;
+
+public class Efficient { 
+    static int MAX = 1000;
+
+
+    static int f[] = new int[MAX];
+
+
+    static int fib(int n)
+    {
+        Arrays.fill(f, 0);
+        // Base cases
+        if (n == 0)
+            return 0;
+        if (n == 1 || n == 2)
+            return (f[n] = 1);
+
+        // If fib(n) is already computed
+        if (f[n] == 1)
+            return f[n];
+            int k;
+        if((n & 1) == 1)
+            k = (n + 1) / 2 ;
+        else
+            k = n / 2;
+
+        if((n & 1) == 1)
+            f[n] = (fib(k) * fib(k) +
+            fib(k - 1) * fib(k - 1));
+        else
+            f[n] = (2 * fib(k - 1) + fib(k)) * fib(k);
+
+        return f[n];
+    }
+
+    static int calculateSum(int n)
+    {
+        return fib(n + 2) - 1;
+    }
+
+
+    public static void main(String args[])
+    {
+        int n = 4;
+        System.out.println( "Sum of Fibonacci numbers is : " + calculateSum(n));
+
+    }
+}

Admission/pom.xml

@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+  xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+  <modelVersion>4.0.0</modelVersion>
+
+  <parent>
+    <groupId>com.let.us.java</groupId>
+    <artifactId>LetUsJava</artifactId>
+    <version>1.0-SNAPSHOT</version>
+  </parent>
+
+  <groupId>com.let.us.java</groupId>
+  <artifactId>Admission</artifactId>
+  <packaging>jar</packaging>
+
+  <name>Admission</name>
+
+</project>

admission.java → Admission/src/main/java/admission.java

@@ -49,7 +49,7 @@ public void display()
 	}
 }
 
-class admission{
+public class admission{
 	public static void main(String arg[])
 	{
 			Scanner sc=new Scanner(System.in);

ArmstrongNumber/pom.xml

@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+  xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+  <modelVersion>4.0.0</modelVersion>
+
+  <parent>
+    <groupId>com.let.us.java</groupId>
+    <artifactId>LetUsJava</artifactId>
+    <version>1.0-SNAPSHOT</version>
+  </parent>
+
+  <groupId>com.let.us.java</groupId>
+  <artifactId>ArmstrongNumber</artifactId>
+  <packaging>jar</packaging>
+
+  <name>Armstrong-Number</name>
+
+</project>

armstrong-number/Armstrong-Number.java → ArmstrongNumber/src/main/java/ArmstrongNum.java

@@ -1,17 +1,17 @@
 import java.util.Scanner;
 
-class ArmstrongNum {
+public class ArmstrongNum {
 
 	/* driver function commented
   public static void main(String[] args) {
-		
+
 		Scanner kb = new Scanner(System.in);
 		int N = kb.nextInt();
-		
+
 		int k = length(N);
-		
+
 		System.out.println(isArmstrongNumber(N, k));
-		
+
 		kb.close();
 	}
   */
@@ -30,16 +30,16 @@ public static int length(int N) {
 	public static boolean isArmstrongNumber(int N, int k) {
 		long powerSum = 0;
 		int n = N;
-		
+
 		while (n != 0) {
 			int rem = n % 10;
 
 			powerSum += (int) Math.pow(rem, k);
-			
+
 			n /= 10;
 		}
 		System.out.println(powerSum);
 		return (powerSum==N);
 	}
-  
+
 }

CONTRIBUTING.md

@@ -0,0 +1,10 @@
+# Rules of contribution
+
+## Code contribution
+- Please make sure to add your code in the directory that makes sense, if there is no directory present please make one.
+- Please make sure to add a code that is not simply a print statement saying something random and an actual contribution
+- Add as many codes you want, every contribution welcome
+
+## ReadMe contribution
+- Please make sure that the formatting is all good and is not messy
+- No PRs just for a few typos, however feel free to make a PR listing the contributors' name who have contributed to the repository but their username is not on the ReadMe

CalculatePi/pom.xml

@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+  xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+  <modelVersion>4.0.0</modelVersion>
+
+  <parent>
+    <groupId>com.let.us.java</groupId>
+    <artifactId>LetUsJava</artifactId>
+    <version>1.0-SNAPSHOT</version>
+  </parent>
+
+  <groupId>com.let.us.java</groupId>
+  <artifactId>CalculatePi</artifactId>
+  <packaging>jar</packaging>
+
+  <name>Calculate Pi</name>
+
+</project>