Skip to content

Instantly share code, notes, and snippets.

public class HelloWorld{
public static void main(String []args){
System.out.println("Fee for 23 minutes");
System.out.println(fee(23));
System.out.println("Fee for 60 minutes");
System.out.println(fee(60));
System.out.println("Fee for 61 minutes");
System.out.println(fee(61));
System.out.println("Fee for 93 minutes");
import java.util.Arrays;
public class InsertionSort{
public static void main(String []args){
int j;
int key;
int i;
int[] random_array = {10,5,11,194,-1,291,3,3,7,9};
for (j = 1; j < random_array.length; j++) // start with second number
{
import java.util.*;
import java.util.Arrays;
import java.math.*;
public class ArrayStats
{
//first method
public static double[] getArrayStats( double input[] )
{
/**
* Utilities for checking whether a given two-dimensional array is
* a valid Sudoku solution.
*/
import java.util.BitSet;
public class main {
/**
* Try it out.
/**
* Utilities for checking whether a given two-dimensional array is
* a valid Sudoku solution.
*/
import java.util.Scanner;
public class main {
/**
/**
*
*/
public class main {
/**
* Try it out.
*/
#include <iostream>
using namespace std;
//this method complexity is O(n) time and O(1) space
bool check_unique_string(string to_be_checked){
bool check_array[256]={};
for(int i=0;i<to_be_checked.length();i++){
if (check_array[to_be_checked[i]])
return false;
else check_array[to_be_checked[i]] = true;
#include <iostream>
using namespace std;
//this method complexity is O(n) time and O(1) space
void reverse(char *str) {
cout<<str<<endl;
char *end=str;
while(*end)
end++;
end--;
//first problem
int min (array a){
if (a.size() == 1 )
return a[0]
else
{
if (a[0] < a[a.size()-1] )
{
//copy everything but the last element to new array b
create a new array b with size = a.size()-1;
public class HelloWorld{
public static void main(String []args){
//test with 5
System.out.println("Test print(5)");
print(5);
//test with 10
System.out.println("Test print(10)");
print(10);