kristofer / WeatherApp.java
0 likes
0 forks
1 files
Last active
| 1 | import java.io.BufferedReader; |
| 2 | import java.io.IOException; |
| 3 | import java.io.InputStreamReader; |
| 4 | import java.net.HttpURLConnection; |
| 5 | import java.net.URL; |
| 6 | |
| 7 | // go to https://openweathermap.org to see |
| 8 | |
| 9 | |
| 10 | public class WeatherApp { |
kristofer / NotesApp.java
0 likes
0 forks
1 files
Last active
| 1 | import java.io.*; |
| 2 | import java.util.ArrayList; |
| 3 | import java.util.Scanner; |
| 4 | |
| 5 | class Note { |
| 6 | private String title; |
| 7 | private String content; |
| 8 | |
| 9 | public Note(String title, String content) { |
| 10 | this.title = title; |
kristofer / NQueenProblem.java
0 likes
0 forks
1 files
Last active
| 1 | // Java program to solve N Queen Problem using backtracking |
| 2 | |
| 3 | public class NQueenProblem { |
| 4 | final int N = 4; |
| 5 | |
| 6 | // A utility function to print solution |
| 7 | void printSolution(int board[][]) |
| 8 | { |
| 9 | for (int i = 0; i < N; i++) { |
| 10 | for (int j = 0; j < N; j++) { |
kristofer / Minesweeper.java
0 likes
0 forks
1 files
Last active
| 1 | import java.util.Random; |
| 2 | import java.util.Scanner; |
| 3 | |
| 4 | public class Minesweeper { |
| 5 | private static final int SIZE = 10; |
| 6 | private static final int MINES = 15; |
| 7 | |
| 8 | private char[][] board; |
| 9 | private boolean[][] mines; |
| 10 | private boolean[][] revealed; |
kristofer / IntersectionOfTwoArrays.java
0 likes
0 forks
1 files
Last active
| 1 | import java.util.*; |
| 2 | |
| 3 | public class IntersectionOfTwoArrays { |
| 4 | public static void main(String args[]) |
| 5 | { |
| 6 | Scanner sc=new Scanner(System.in); |
| 7 | HashSet<Integer>s=new HashSet<Integer>(); |
| 8 | System.out.println("Enter the no. of elements in array a"); |
| 9 | int n1=sc.nextInt(); |
| 10 | System.out.println("Enter the no. of elements in array b"); |
kristofer / InterfaceDemo.java
0 likes
0 forks
1 files
Last active
| 1 | interface Shape { |
| 2 | double area(); |
| 3 | double perimeter(); |
| 4 | } |
| 5 | |
| 6 | class Circle implements Shape { |
| 7 | private double radius; |
| 8 | |
| 9 | public Circle(double radius) { |
| 10 | this.radius = radius; |
kristofer / PolymorphismInheritance.java
0 likes
0 forks
1 files
Last active
| 1 | class A |
| 2 | { |
| 3 | public void methodA() { |
| 4 | System.out.println("method of Class A"); |
| 5 | } |
| 6 | } |
| 7 | class B extends A{ |
| 8 | public void methodB(){ |
| 9 | System.out.println("method of Class B"); |
| 10 | } |
kristofer / Inheritance.java
0 likes
0 forks
1 files
Last active
| 1 | class A |
| 2 | { |
| 3 | public void methodA() { |
| 4 | System.out.println("method of Class A"); |
| 5 | } |
| 6 | } |
| 7 | class B extends A{ |
| 8 | public void methodB(){ |
| 9 | System.out.println("method of Class B"); |
| 10 | } |
kristofer / HeapSort.java
0 likes
0 forks
1 files
Last active
| 1 | import java.util.*; |
| 2 | public class HeapSort { |
| 3 | public void sort(int arr[]) |
| 4 | { |
| 5 | int N = arr.length; |
| 6 | |
| 7 | for (int i = N / 2 - 1; i >= 0; i--) |
| 8 | heapify(arr, N, i); |
| 9 | |
| 10 | for (int i = N - 1; i > 0; i--) { |
kristofer / WebsiteStatusChecker.java
0 likes
0 forks
1 files
Last active
| 1 | import java.io.IOException; |
| 2 | import java.net.HttpURLConnection; |
| 3 | import java.net.URL; |
| 4 | import java.util.Scanner; |
| 5 | |
| 6 | public class WebsiteStatusChecker { |
| 7 | public static void main(String[] args) { |
| 8 | Scanner scanner = new Scanner(System.in); |
| 9 | System.out.print("Enter the website URL to check: "); |
| 10 | String urlToCheck = scanner.nextLine(); |