Java help:
Using doubly linked list with dummy heads and dummy tails,determine the starting indices for all match locations. Theseindices can result in overlapping subsequences. For example, if thesubsequence is [‘A’, ’B’, ‘A’] and the list is [‘A’, ‘C’, ‘A’, ‘B’,‘A’, ‘C’, ‘A’, ‘B’, ‘A’], this method will return [2, 6]. If thesubsequence is not present, then the array returned will be of size0.![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 <T>subseauense) t //А list to hold all the starting indices found DoublyLinkedList<integer> indices = new DoublyLinkedList<>(); /TODO: Add implementation to find the starting indices // Array Conversion int [ ] startingIndices = new int [indices . size (J ; for (inti = 0; i < indices. size(): i++) { startingIndices[i]-indices.get (i) return startingIndices;](https://media.cheggcdn.com/media%2F2b5%2F2b5d3ebd-3df3-4902-a766-421e58a0e830%2FphpbpFsEz.png)
r
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured