Method Signature

public static AbstractList genesOrder$($InputGenerator gen, int k$)$

Method Behaviour & Notes

Returns a list of the different genes $($substrands$)$ of length k $>0$ in the sequence generated by a given InputGenerator, in the order they are first encountered.Desired Complexity & Notes

O$($k$2$n$)$A time, where n is the number of characters generated.

O$($kd$)$ space, where k is the integer input parameter, and d is the solution.

Since there are $4$ bases, d k and thus log d $=$ O$($k$).$

Even within these bounds, do your best to minimize wasteful time or space operation in order to pass all the performance tests. note: you can only use the following imports: import input.InputGenerator;

import input.FileCharGenerator;

import input.AlternatingCharGenerator;

import ods.ArrayDeque;

import ods.ArrayQueue;

import ods.ArrayStack;

import ods.RootishArrayStack;

import ods.SLList;

import ods.DLList;

import ods.SEList;

import ods.SkiplistList;

import ods.SkiplistSSet;

import ods.BinaryTree;

import ods.BinarySearchTree;

import ods.Treap;

import ods.ScapegoatTree;

import ods.SSet;

import java.util.AbstractList;

import java.util.ListIterator;

import java.util.Iterator;