Java help:

Using doubly linked list with dummy heads and dummy tails, determine the starting indices for all match locations. These indices can result in overlapping subsequences. For example, if the subsequence is [A, B, A] and the list is [A, C, A, B, A, C, A, B, A], this method will return [2, 6]. If the subsequence is not present, then the array returned will be of size 0.

r k * Determine the starting indices that match the subSequence eparam subseguence the list you want to check to see if there is a matoh public intll matsh (DoublyLinkedList subseauense) t // list to hold all the starting indices found DoublyLinkedList indices = new DoublyLinkedList(); /TODO: Add implementation to find the starting indices // Array Conversion int [ ] startingIndices = new int [indices . size (J ; for (inti = 0; i subseauense) t // list to hold all the starting indices found DoublyLinkedList indices = new DoublyLinkedList(); /TODO: Add implementation to find the starting indices // Array Conversion int [ ] startingIndices = new int [indices . size (J ; for (inti = 0; i