What do you want to save?
Add Code snippet
New code examples
-
Java 2022-03-26 13:40:11
generate all prime number less than n java
/** Author: Jeffrey Huang As far as I know this is almost the fastest method in java for generating prime numbers less than n. A way to make it faster would be to implement Math.sqrt(i) instead of i/2. I don't know if you could implement sieve of eratost... Add solution -
Java 2022-03-13 05:10:26
how to use scanners in java
import java.util.Scanner; // import scanner Scanner myScanner = new Scanner(System.in); // Make scanner obj String inputString = myScanner.nextLine(); // Take whole line boolean inputBoolean = myScanner.nextBoolean(); //Boolean input long inputLong ... Add solution -
Javascript 2022-01-27 01:16:08
swap nodes algo hackerrank solution
import java.io.*; import java.math.*; import java.text.*; import java.util.*; import java.util.regex.*; public class Solution { /* * Complete the swapNodes function below. */ static class Node { int index; int depth; ... Add solution -
Java 2021-11-19 23:00:23
how to get a user to add to an arraylist in java
public class chores { public static void main(String[] args) { Boolean close = false; ArrayList<String> name = new ArrayList(); ArrayList<String> chores = new ArrayList(); Scanner scanner = new Scanner(System.in); Syste... Add solution -
Java 2021-11-17 15:16:15
generate all prime number less than n java (fastest method)
/** Author: Jeffrey Huang As far as I know this is almost the fastest method in java for generating prime numbers less than n. A way to make it faster would be to implement Math.sqrt(i) instead of i/2. I don't know if you could implement sieve of eratos... Add solution
Best helpers
+5
+5
+5
+5
+5
+5
+5
+5
+5