Skip to content

Instantly share code, notes, and snippets.

import java.util.*;
public class HelloWorld{
// static HashSet<Integer> allLengths(int k, int shorter, int longer){
// HashSet<Integer> lengths = new HashSet<Integer>();
// getAllLengths(k, 0, shorter, longer, lengths);
// return lengths;
// }
// // O(2 ^ K)
/**
* The first, reverseArray, takes an array as argument and
* produces a new array that has the same elements in
* the inverse order
* **/
// input
// [1, 3, 4, 5, 6, 7, 9]
// output 1
// [9, 7, 6, 5, 4, 3, 1]

Keybase proof

I hereby claim:

  • I am msusur on github.
  • I am msusur (https://keybase.io/msusur) on keybase.
  • I have a public key ASDnZ5GmGMRDfAjMD2QuT7Xm5fMHZMBX9Xz2eyzfqiNDpAo

To claim this, I am signing this object: