What do you want to save?
Add Code snippet
New code examples
-
Java 2022-01-22 12:35:37
print position of character in alphabet java
import java.util.Scanner; public class FindPositionOfLetterInAlphabet { public static int findPosition(char inputLetter) { // converting input letter in to uniform case. char inputLetterToLowerCase= Character.toLowerCase(inputLetter); // COnver... Add solution -
Java 2022-01-22 10:21:17
Java convert octal to decimal
import java.util.Scanner; public class OctalToBinaryJava { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Please enter octal number: "); int octal = Integer.parseInt(sc.n... Add solution -
Java 2022-01-22 07:51:29
Multiplication table for number Java
int i,k; Scanner sc = new Scanner(System.in); System.out.println("Enter the Number for the table: "); int n = sc.nextInt(); for (i=1;i<=10;i++){ k = n * i; //n + "*" + c + " = " + (n*c)) System.ou... Add solution -
Java 2021-11-21 21:17:16
Java program to find perimeter of a rectangle
import java.util.Scanner; public class PerimeterOfRectangleDemo { public static void main(String []args) { float length, width, perimeter; Scanner sc = new Scanner(System.in); System.out.print("Please enter length of recta... Add solution -
Java 2021-11-20 03:31:10
tcp checksum calculation java code
// Java code for Checksum_Sender package checksum_sender; import java.io.*; import java.net.*; import java.util.*; public class Checksum_Sender { // Setting maximum data length &n... 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